Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Virgile Mogbil

dblp:10/2060 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
0since 2021 · last 2011
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 4Software engineering, systems software and programming languages · 2

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Logic in computer science · 67% Computational complexity · 33%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Logic in computer science › proof theory › substructural logic
linear logic		 0.112008
Correctness of Multiplicative Additive Proof Structures is NL-Complete · LICS 2008
Computational complexity › space complexity
NL-completeness		 0.112008
Correctness of Multiplicative Additive Proof Structures is NL-Complete · LICS 2008
Logic in computer science
proof theory		 0.112008
Correctness of Multiplicative Additive Proof Structures is NL-Complete · LICS 2008

Methods — techniques the papers use, named apart from their topics

proof structures · 0.1correctness criterion · 0.1
YearPublicationVenuePosition
2011 Correctness of linear logic proof structures is NL-complete
Paulin Jacobé de Naurois, Virgile Mogbil
 Theor. Comput. Sci.2
2010 A PolyTime Functional Language from Light Linear Logic
Patrick Baillot, Marco Gaboardi, Virgile Mogbil
 ESOP3
2008 Correctness of Multiplicative Additive Proof Structures is NL-Complete
abstract
The authors revisit the correctness criterion for the multiplicative additive fragment of linear logic. We prove that deciding the correctness of corresponding proof structures is NL-complete.
Paulin Jacobé de Naurois, Virgile Mogbil
 LICS2
2004 Soft lambda-Calculus: A Language for Polynomial Time Computation
Patrick Baillot, Virgile Mogbil
 FoSSaCS2
2001 Encoding Hamiltonian circuits into multiplicative linear logic
Thomas Krantz, Virgile Mogbil
 Theor. Comput. Sci.2