LTL with the freeze quantifier and register automata S Demri, R Lazić ACM Transactions on Computational Logic (TOCL) 10 (3), 1-30, 2009 | 365 | 2009 |
Incomplete information: Structure, inference, complexity SP Demri, E Orlowska Springer Science & Business Media, 2002 | 201* | 2002 |
Temporal logics in computer science: finite-state systems S Demri, V Goranko, M Lange Cambridge University Press, 2016 | 168 | 2016 |
The complexity of propositional linear temporal logics in simple cases S Demri, P Schnoebelen Information and Computation 174 (1), 84-103, 2002 | 151 | 2002 |
An automata-theoretic approach to constraint LTL S Demri, D d’Souza Information and Computation 205 (3), 380-415, 2007 | 134 | 2007 |
On the freeze quantifier in constraint LTL: decidability and complexity S Demri, R Lazić, D Nowak Information and Computation 205 (1), 2-24, 2007 | 104 | 2007 |
On the almighty wand R Brochenin, S Demri, E Lozes Information and Computation 211, 106-137, 2012 | 84 | 2012 |
Deciding regular grammar logics with converse through first-order logic S Demri, H De Nivelle Journal of Logic, Language and Information 14, 289-329, 2005 | 73 | 2005 |
The effects of bounding syntactic resources on Presburger LTL S Demri, R Gascon Journal of Logic and Computation 19 (6), 1541-1575, 2009 | 56 | 2009 |
A modal perspective on path constraints N Alechina, S Demri, M de Rijke Journal of Logic and Computation 13 (6), 939-956, 2003 | 56 | 2003 |
The covering and boundedness problems for branching vector addition systems S Demri, M Jurdziński, O Lachish, R Lazić Journal of Computer and System Sciences 79 (1), 23-38, 2013 | 54 | 2013 |
Model checking freeze LTL over one-counter automata S Demri, R Lazić, A Sangnier International Conference on Foundations of Software Science and …, 2008 | 53 | 2008 |
The complexity of regularity in grammar logics and related modal logics S Demri Journal of Logic and Computation 11 (6), 933-960, 2001 | 52 | 2001 |
Complexity of modal logics with Presburger constraints S Demri, D Lugiez Journal of Applied Logic 8 (3), 233-252, 2010 | 49 | 2010 |
Logical analysis of indiscernibility S Demri, E Orlowska Incomplete information: Rough set analysis, 347-380, 1998 | 49 | 1998 |
On selective unboundedness of VASS S Demri Journal of Computer and System Sciences 79 (5), 689-713, 2013 | 47 | 2013 |
Presburger modal logic is PSPACE-Complete S Demri, D Lugiez Automated Reasoning: Third International Joint Conference, IJCAR 2006 …, 2006 | 44 | 2006 |
Separation logic with one quantified variable S Demri, D Galmiche, D Larchey-Wendling, D Méry Theory of Computing Systems 61 (2), 371-461, 2017 | 42 | 2017 |
Towards a model-checker for counter systems S Demri, A Finkel, V Goranko, G van Drimmelen International Symposium on Automated Technology for Verification and …, 2006 | 42 | 2006 |
A parametric analysis of the state-explosion problem in model checking S Demri, F Laroussinie, P Schnoebelen Journal of Computer and System Sciences 72 (4), 547-575, 2006 | 42 | 2006 |