Quadratic Correctness Criterion for Non-commutative Logic. - Virgile Mogbil (CSL, 2001)

Encoding Hamiltonian circuits into multiplicative linear logic. - Thomas Krantz; Virgile Mogbil (Theor. Comput. Sci., 2001)

Sémantique des phases, réseaux de preuve et divers problèmes de décision en logique linéaire. (Phase semantics, proof nets and some decision problems in linear logic). - Virgile Mogbil (2001)

Soft lambda-Calculus: A Language for Polynomial Time Computation. - Patrick Baillot; Virgile Mogbil (FoSSaCS, 2004)

Modules and Logic Programming - Christophe Fouqueré; Virgile Mogbil (CoRR, 2004)

Correctness of Multiplicative (and Exponential) Proof Structures is NL -Complete. - Paulin Jacobé de Naurois; Virgile Mogbil (CSL, 2007)

Uniform Circuits, & Boolean Proof Nets. - Virgile Mogbil; Vincent Rahli (LFCS, 2007)

Rewritings for Polarized Multiplicative and Exponential Proof Structures. - Christophe Fouqueré; Virgile Mogbil (TERMGRAPH@ETAPS, 2007)

Correctness of Multiplicative Additive Proof Structures is NL-Complete. - Paulin Jacobé de Naurois; Virgile Mogbil (LICS, 2008)

Non-deterministic Boolean Proof Nets. - Virgile Mogbil (FOPARA, 2009)

A PolyTime Functional Language from Light Linear Logic. - Patrick Baillot; Marco Gaboardi; Virgile Mogbil (ESOP, 2010)

Rewriting Systems for Reachability in Vector Addition Systems with Pairs. - Paulin Jacobé de Naurois; Virgile Mogbil (RP, 2010)

Correctness of linear logic proof structures is NL-complete. - Paulin Jacobé de Naurois; Virgile Mogbil (Theor. Comput. Sci., 2011)

Proofs as Executions. - Emmanuel Beffara; Virgile Mogbil (IFIP TCS, 2012)

An Interpretation of CCS into Ludics. - Stefano Del Vecchio; Virgile Mogbil (LSFA, 2017)