Skip to Main content

Export Publications

Export the displayed publications:

Keywords

Co-authors

Number of documents

110

Stéphane Demri's Publications


Journal articles60 documents

  • Stéphane Demri, Raul Fervari, Alessio Mansutti. Internal Proof Calculi for Modal Logics with Separating Conjunction. Journal of Logic and Computation, Oxford University Press (OUP), In press. ⟨hal-03185457⟩
  • Stéphane Demri, Raul Fervari. The Power of Modal Separation Logics. Journal of Logic and Computation, Oxford University Press (OUP), 2019, 29 (8), pp.1139--1184. ⟨hal-03005862⟩
  • Natasha Alechina, Nils Bulling, Stephane Demri, Brian Logan. On the complexity of resource-bounded logics. Theoretical Computer Science, Elsevier, 2018, ⟨10.1016/j.tcs.2018.01.019⟩. ⟨hal-02366661⟩
  • Stephane Demri, Didier Galmiche, Dominique Larchey-Wendling, Daniel Mery. Separation Logic with One Quantified Variable. Theory of Computing Systems, Springer Verlag, 2017, 61 (2), pp.371-461. ⟨hal-01258821⟩
  • Stéphane Demri, Amit Kumar Dhar, Arnaud Sangnier. Equivalence Between Model-Checking Flat Counter Systems and Presburger Arithmetic. Theoretical Computer Science, Elsevier, 2017, 735, pp.2-23. ⟨10.1016/j.tcs.2017.07.007⟩. ⟨hal-03192244⟩
  • Stéphane Demri, Morgan Deters. Temporal Logics on Strings with Prefix Relation. Journal of Logic and Computation, Oxford University Press (OUP), 2016, 26 (3), pp.989-1017. ⟨10.1093/logcom/exv028⟩. ⟨hal-03186079⟩
  • Stéphane Demri, Morgan Deters. Expressive Completeness of Separation Logic With Two Variables and No Separating Conjunction. ACM Transactions on Computational Logic, Association for Computing Machinery, 2016, 17 (2), pp.12:1-12:44. ⟨10.1145/2835490⟩. ⟨hal-03186336⟩
  • Stéphane Demri, Diego Figueira, M. Praveen. Reasoning about Data Repetitions with Counter Systems. Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2016, 12 (3), ⟨10.2168/LMCS-12(3:1)2016⟩. ⟨hal-01685180⟩
  • Parosh Aziz Abdulla, Stephane Demri, Alain Finkel, Jérôme Leroux, Igor Potapov. Preface. Fundamenta Informaticae, Polskie Towarzystwo Matematyczne, 2016, 143 (3-4), pp.i-ii. ⟨10.3233/FI-2016-1311⟩. ⟨hal-02391811⟩
  • Stéphane Demri, Amit Kumar Dhar, Arnaud Sangnier. Taming Past LTL and Flat Counter Systems. Information and Computation, Elsevier, 2015, 242, pp.306-339. ⟨10.1016/j.ic.2015.03.007⟩. ⟨hal-03192199⟩
  • Stéphane Demri, Morgan Deters. Separation Logics and Modalities: A Survey. Journal of Applied Non-Classical Logics, Taylor & Francis, 2015, 25 (1), pp.50-99. ⟨10.1080/11663081.2015.1018801⟩. ⟨hal-03186076⟩
  • Stéphane Demri, Morgan Deters. Two-Variable Separation Logic and Its Inner Circle. ACM Transactions on Computational Logic, Association for Computing Machinery, 2015, 16 (2:15), ⟨10.1145/2724711⟩. ⟨hal-03192209⟩
  • Stéphane Demri. On Selective Unboundedness of VASS. Journal of Computer and System Sciences, Elsevier, 2013, 79 (5), pp.689-713. ⟨10.1016/j.jcss.2013.01.014⟩. ⟨hal-03187435⟩
  • Philippe Darondeau, Stephane Demri, Roland Meyer, Christophe Morvan. Petri Net Reachability Graphs: Decidability Status of First Order Properties. Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2012, 8 (4:9), pp.1-28. ⟨10.2168/LMCS-8(4:9)2012⟩. ⟨hal-00743935⟩
  • Rémi Brochenin, Stephane Demri, Etienne Lozes. On the Almighty Wand. Information and Computation, Elsevier, 2012. ⟨hal-01905158⟩
  • Stéphane Demri, Marcin Jurdziński, Oded Lachish, Ranko Lazić. The covering and boundedness problems for branching vector addition systems. Journal of Computer and System Sciences, Elsevier, 2012, 79 (1), pp.23-38. ⟨10.1016/j.jcss.2012.04.002⟩. ⟨hal-03191875⟩
  • Stéphane Demri, Deepak Dsouza, Régis Gascon. Temporal Logics of Repeating Values. Journal of Logic and Computation, Oxford University Press (OUP), 2011, 22 (5), pp.1059-1096. ⟨10.1093/logcom/exr013⟩. ⟨hal-03191243⟩
  • Stéphane Demri, Alain Finkel, Valentin Goranko, Govert van Drimmelen. Model-Checking CTL* over Flat Presburger Counter Systems. Journal of Applied Non-Classical Logics, Taylor & Francis, 2010, 20 (4), pp.313-344. ⟨10.3166/jancl.20.313-344⟩. ⟨hal-03191246⟩
  • Stéphane Demri, Ranko Lazić, Arnaud Sangnier. Model checking memoryful linear-time logics over one-counter automata. Theoretical Computer Science, Elsevier, 2010, 411 (22-24), pp.2298-2316. ⟨10.1016/j.tcs.2010.02.021⟩. ⟨hal-03190262⟩
  • Stéphane Demri, Alexander Rabinovich. The complexity of linear-time temporal logic over the class of ordinals. Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2010, 6 (4), ⟨10.2168/LMCS-6(4:9)2010⟩. ⟨hal-03190247⟩
  • Stéphane Demri, Denis Lugiez. Complexity of Modal Logics with Presburger Constraints. Journal of Applied Logic, Elsevier, 2010, 8 (3), pp.233-252. ⟨10.1016/j.jal.2010.03.001⟩. ⟨hal-03188381⟩
  • Stéphane Demri, Ranko Lazić. LTL with the Freeze Quantifier and Register Automata. ACM Transactions on Computational Logic, Association for Computing Machinery, 2009, 10 (3). ⟨hal-03189491⟩
  • Rémi Brochenin, Stephane Demri, Etienne Lozes. Reasoning about sequences of memory states. Annals of Pure and Applied Logic, Elsevier Masson, 2009. ⟨hal-01905172⟩
  • Stéphane Demri, Régis Gascon. The Effects of Bounding Syntactic Resources on Presburger LTL. Journal of Logic and Computation, Oxford University Press (OUP), 2009, 19 (6), pp.1541-1575. ⟨hal-03187851⟩
  • Stéphane Demri, Régis Gascon. Verification of qualitative Z constraints. Theoretical Computer Science, Elsevier, 2008, 409 (1), pp.24-40. ⟨10.1016/j.tcs.2008.07.023⟩. ⟨hal-03190241⟩
  • Stéphane Demri, D Souza. An Automata-Theoretic Approach to Constraint LTL. Information and Computation, Elsevier, 2007, 205 (3), pp.380-415. ⟨10.1016/j.ic.2006.09.006⟩. ⟨hal-03189574⟩
  • Stéphane Demri, Deepak D Souza. An Automata-Theoretic Approach to Constraint LTL. Information and Computation, Elsevier, 2007, 205 (3), pp.380-415. ⟨hal-03189923⟩
  • Stéphane Demri, David Nowak. Reasoning about transfinite sequences. International Journal of Foundations of Computer Science, World Scientific Publishing, 2007, 18 (1), pp.87--112. ⟨10.1142/S0129054107004589⟩. ⟨hal-03189812⟩
  • Stéphane Demri, Ewa Orlowska. Relative Nondeterministic Information Logic is EXPTIME-complete. Fundamenta Informaticae, Polskie Towarzystwo Matematyczne, 2007, 75 (1-4), pp.163-178. ⟨hal-03189973⟩
  • Stéphane Demri, Ranko Lazić, David Nowak. On the freeze quantifier in Constraint LTL: decidability and complexity. Information and Computation, Elsevier, 2007, 205 (1), pp.2-24. ⟨10.1016/j.ic.2006.08.003⟩. ⟨hal-03189579⟩
  • Stéphane Demri. Linear-time Temporal Logics with Presburger Constraints: an Overview. Journal of Applied Non-Classical Logics, Taylor & Francis, 2006, 16 (3-4), pp.311-347. ⟨10.3166/jancl.16.311-347⟩. ⟨hal-03189932⟩
  • Stéphane Demri, François Laroussinie, Ph Schnoebelen. A Parametric Analysis of the State-Explosion Problem in Model Checking. Journal of Computer and System Sciences, Elsevier, 2006, 72 (4), pp.547--575. ⟨10.1016/j.jcss.2005.11.003⟩. ⟨hal-03189811⟩
  • Stéphane Demri. LTL over Integer Periodicity Constraints. Theoretical Computer Science, Elsevier, 2006, 360 (1--3), pp.96-123. ⟨10.1016/j.tcs.2006.02.019⟩. ⟨hal-03189810⟩
  • Stéphane Demri, Ranko Lazić, David Nowak. On the freeze quantifier in Constraint LTL: decidability and complexity. Information and Computation, Elsevier, 2006, 205 (1), pp.2-24. ⟨10.1016/j.ic.2006.08.003⟩. ⟨hal-03190175⟩
  • Stéphane Demri, Hans de Nivelle. Deciding regular grammar logics with converse through first-order logic. Journal of Logic, Language and Information, Springer Verlag, 2005, 14 (3), pp.289-329. ⟨10.1007/s10849-005-5788-9⟩. ⟨hal-03187843⟩
  • Stéphane Demri. A reduction from DLP to PDL. Journal of Logic and Computation, Oxford University Press (OUP), 2005, 15 (5), pp.767-785. ⟨10.1093/logcom/exi043⟩. ⟨hal-03193413⟩
  • Stéphane Demri. A polynomial space construction of tree-like models for logics with local chains of modal connectives. Theoretical Computer Science, Elsevier, 2003, 300 (1-3), pp.235-258. ⟨10.1016/S0304-3975(02)00082-8⟩. ⟨hal-03194857⟩
  • Natasha Alechina, Stéphane Demri, Maarten de Rijke. A Modal Perspective on Path Constraints. Journal of Logic and Computation, Oxford University Press (OUP), 2003, 13 (6), pp.939-956. ⟨10.1093/logcom/13.6.939⟩. ⟨hal-03189647⟩
  • Stéphane Demri, Ulrike Sattler. Automata-Theoretic Decision Procedures for Information Logics. Fundamenta Informaticae, Polskie Towarzystwo Matematyczne, 2002, 53 (1), pp.1-22. ⟨10.5555/1220762.1220763⟩. ⟨hal-03194002⟩
  • Stéphane Demri, Philippe Schnoebelen. The Complexity of Propositional Linear Temporal Logics in Simple Cases. Information and Computation, Elsevier, 2002, 174 (1), pp.84-103. ⟨10.1006/inco.2001.3094⟩. ⟨hal-03189492⟩
  • Stéphane Demri, Rajeev Goré. Theoremhood Preserving Maps Characterising Cut Elimination for Modal Provability Logics. Journal of Logic and Computation, Oxford University Press (OUP), 2002, 12 (5), pp.861-884. ⟨10.1093/logcom/12.5.861⟩. ⟨hal-03195082⟩
  • Stéphane Demri, Rajeev Goré. Display Calculi for Nominal Tense Logics. Journal of Logic and Computation, Oxford University Press (OUP), 2002, 12 (6), pp.993-1016. ⟨10.1093/logcom/12.6.993⟩. ⟨hal-03195079⟩
  • Stéphane Demri. The Complexity of Regularity in Grammar Logics and Related Modal Logics. Journal of Logic and Computation, Oxford University Press (OUP), 2001, 11 (6), pp.933-960. ⟨10.1093/logcom/11.6.933⟩. ⟨hal-03189648⟩
  • Stéphane Demri. The Nondeterministic Information Logic NIL is PSPACE-complete. Fundamenta Informaticae, Polskie Towarzystwo Matematyczne, 2000, 42 (3-4), pp.211-234. ⟨hal-03192251⟩
  • Stéphane Demri, Rajeev Goré. Display Calculi for Logics with Relative Accessibility Relations. Journal of Logic, Language and Information, Springer Verlag, 2000, 9 (2), pp.213-236. ⟨10.1023/A:1008341521750⟩. ⟨hal-03194849⟩
  • Stéphane Demri, Jaroslaw Stepaniuk. Computational Complexity of Multimodal Logics Based on Rough Sets. Fundamenta Informaticae, Polskie Towarzystwo Matematyczne, 2000, 44 (4), pp.373-396. ⟨hal-03195322⟩
  • Stéphane Demri, Dov Gabbay. On Modal Logics Characterized by Models with Relative Accessibility Relations: Part I. Studia Logica, Springer Verlag (Germany), 2000, 65 (3), pp.323-353. ⟨10.1023/A:1005235713913⟩. ⟨hal-03192248⟩
  • Stéphane Demri, Dov M. Gabbay. On Modal Logics Characterized by Models with Relative Accessibility Relations: Part II. Studia Logica, Springer Verlag (Germany), 2000, 65 (3), pp.349-384. ⟨10.1023/A:1005260600511⟩. ⟨hal-03192250⟩
  • Stéphane Demri. A Simple Modal Encoding of Propositional Finite Many-Valued Logics. Journal of Multiple-Valued Logic and Soft Computing, Old City Publishing, 2000, 6, pp.443-461. ⟨hal-03192253⟩
  • Stéphane Demri, Ewa Orlowska. Every Finitely Reducible Logic has the Finite Model Property with Respect to the Class of Diamond-Formulae. Studia Logica, Springer Verlag (Germany), 1999, 62 (2), pp.177-200. ⟨10.1023/A:1026499402531⟩. ⟨hal-03192512⟩
  • Stéphane Demri. A Logic with Relative Knowledge Operators. Journal of Logic, Language and Information, Springer Verlag, 1999, 8 (2), pp.167-185. ⟨10.1023/A:1008227432405⟩. ⟨hal-03192516⟩
  • Stéphane Demri. A Class of Decidable Information Logics. Theoretical Computer Science, Elsevier, 1998, 195 (1), pp.33-60. ⟨10.1016/S0304-3975(97)00157-6⟩. ⟨hal-03192782⟩
  • Stéphane Demri. Extensions of modal logic S5 preserving NP-completeness. Bulletin of the Section of Logic of the Polish Academy of Sciences, 1997, 26 (2), pp.73--84. ⟨hal-03193470⟩
  • Stéphane Demri. A Completeness Proof for a Logic with an Alternative Necessity Operator. Studia Logica, Springer Verlag (Germany), 1997, 58 (1), pp.99-112. ⟨10.1023/A:1004944015811⟩. ⟨hal-03193865⟩
  • Stéphane Demri. The validity problem for the logic DALLA is decidable. Bulletin of the Polish Academy of Sciences - Mathematics, Polskiej Akademii Nauk, Instytut Matematyczny, 1996, 4 (1), pp.79--86. ⟨hal-03193468⟩
  • Stéphane Demri, Ewa Orlowska. Logical Analysis of Demonic NonDeterministic Programs. Theoretical Computer Science, Elsevier, 1996, 166 (1-2), pp.173-202. ⟨10.1016/0304-3975(95)00190-5⟩. ⟨hal-03193705⟩
  • Stéphane Demri. 3-SAT = SAT for a class of normal modal logics. Information Processing Letters, Elsevier, 1995, 54 (5), pp.281-287. ⟨10.1016/0020-0190(95)00060-P⟩. ⟨hal-03194860⟩
  • Stéphane Demri. Uniform and Non Uniform Strategies for Tableaux Calculi for Modal Logics. Journal of Applied Non-Classical Logics, Taylor & Francis, 1995, 5 (1), pp.77-96. ⟨10.1080/11663081.1995.10510844⟩. ⟨hal-03192776⟩
  • Stéphane Demri, Ewa Orlowska, Ingrid Rewitzky. Towards Reasoning about Hoare Relations. Annals of Mathematics and Artificial Intelligence, Springer Verlag, 1994, 12 (3-4), pp.265-289. ⟨10.1007/BF01530788⟩. ⟨hal-03193712⟩
  • Ricardo Caferra, Stéphane Demri, Michel Herment. A framework for the transfer of proofs, lemmas and strategies from classical to non classical logics. Studia Logica, Springer Verlag (Germany), 1993, 52 (2), pp.197--232. ⟨10.1007/BF01058389⟩. ⟨hal-03193873⟩

Conference papers30 documents

  • Francesco Belardinelli, Stéphane Demri. Reasoning with a Bounded Number of Resources in ATL+. 24th European Conference on Artificial Intelligence, Aug 2020, Santiago de Compostela, Spain. ⟨10.3233/FAIA200147⟩. ⟨hal-03005853⟩
  • Bartosz Bednarczyk, Stéphane Demri, Alessio Mansutti. A Framework for Reasoning about Dynamic Axioms in Description Logics. Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020, Jul 2020, Yokohama, Japan. ⟨hal-03005848⟩
  • Natasha Alechina, Stéphane Demri, Brian Logan. Parameterised Resource-Bounded ATL. The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, Feb 2020, New York, United States. ⟨hal-03005859⟩
  • Stéphane Demri, Etienne Lozes, Alessio Mansutti. Internal Calculi for Separation Logic. Computer Science Logic, Jan 2020, Barcelona, Spain. ⟨10.4230/LIPIcs.CSL.2020.19⟩. ⟨hal-02883558⟩
  • Bartosz Bednarczyk, Stéphane Demri, Raul Fervari, Alessio Mansutti. Modal Logics with Composition on Finite Forests. 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Jul 2020, Saarbruecken, Germany. ⟨10.1145/3373718.3394787⟩. ⟨hal-03005865⟩
  • Stephane Demri, Raul Fervari, Alessio Mansutti. Axiomatising logics with separating conjunctions and modalities. 16th European Conference on Logics in Artificial Intelligence (JELIA'19), May 2019, Rende, Italy. ⟨10.1007/978-3-030-19570-0_45⟩. ⟨hal-02362648⟩
  • Francesco Belardinelli, Stephane Demri. Resource-bounded ATL : the Quest for Tractable Fragments En quête de fragments mécanisables pour ATL avec ressources Keywords Logics for agents and multi-agent systems, verification techniques for multi-agent systems, model-checking, vec- tor addition systems with states. Conférence Nationale en Intelligence Artificielle, Jul 2019, Toulouse, France. ⟨hal-02328812⟩
  • Bartosz Bednarczyk, Stéphane Demri. Why Propositional Quantification Makes Modal Logics on Trees Robustly Hard?. 34th Annual ACM/IEEE Symposium on Logic In Computer Science (LICS'19), Jun 2019, Vancouver, France. ⟨10.1109/LICS.2019.8785656⟩. ⟨hal-02350328⟩
  • Francesco Belardinelli, Stephane Demri. Resource-bounded ATL: the Quest for Tractable Fragments. 18th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2019, May 2019, Montreal, Canada. pp.206--214. ⟨hal-02362636⟩
  • S Demri, Etienne Lozes, A Mansutti. The Effects of Adding Reachability Predicates in Propositional Separation Logic. 22nd International Conference on Foundations of Software Science and Computation Structures FOSSACS, 2018, Thessaloniki, Greece. ⟨hal-01920563⟩
  • Stephane Demri, Raul Fervari. On the Complexity of Modal Separation Logics. Advances in Modal Logic, Bern, 2018, Aug 2018, Bern, Switzerland. ⟨hal-02366671⟩
  • Stephane Demri, Etienne Lozes, Alessio Mansutti. The Effects of Adding Reachability Predicates in Propositional Separation Logic. 21st International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'18), Apr 2018, Thessalonikis, Greece. ⟨hal-02366664⟩
  • Stephane Demri. On Temporal and Separation Logics. 25th International Symposium on Temporal Representation and Reasoning, TIME 2018, Warsaw, Poland., Oct 2018, Warsaw, Poland. ⟨10.4230/LIPIcs.TIME.2018.1⟩. ⟨hal-02366656⟩
  • S Demri, E Lozes, D Lugiez. On Symbolic Heaps Modulo Permission Theories. 37th IARCS Foundation on Software Technology and Theoretical Computer Science, Dec 2017, Kanpur, India. ⟨10.4230/LIPIcs.FSTTCS.2017.25⟩. ⟨hal-01788798⟩
  • Stephane Demri, Didier Galmiche, Dominique Larchey-Wendling, Daniel Mery. Separation Logic with One Quantified Variable. CSR 2014, Jun 2014, Moscou, Russia. ⟨10.1007/978-3-319-06686-8_10⟩. ⟨hal-01258802⟩
  • Clark Barrett, Stéphane Demri, Morgan Deters. Witness Runs for Counter Machines. 9th International Symposium on Frontiers of Combining Systems (FroCoS'13), Pascal Fontaine; Christophe Ringeissen; Renate Schmidt, Sep 2013, Nancy, France. pp.120-150, ⟨10.1007/978-3-642-40885-4_9⟩. ⟨hal-03194728⟩
  • Kshitij Bansal, Stéphane Demri. Model-Checking Bounded Multi-Pushdown Systems. 8th International Computer Science Symposium in Russia, CSR 2013, Jun 2013, Ekaterinburg, Russia. pp.405-417, ⟨10.1007/978-3-642-38536-0_35⟩. ⟨hal-03195088⟩
  • Stéphane Demri, Diego Figueira, M. Praveen. Reasoning about Data Repetitions with Counter Systems. Annual IEEE/ACM Symposium on Logic in Computer Science (LICS), Jun 2013, New Orleans, United States. ⟨10.1109/LICS.2013.8⟩. ⟨hal-01795130⟩
  • Facundo Carreiro, Stéphane Demri. Beyond Regularity for Presburger Modal Logics. 9th Workshop on Advances in Modal Logics (AiML'12), Thomas Bolander; Torben Brauner; Silvio Ghilardi; Lawrence Moss, Aug 2012, Copenhagen, Denmark. pp.161-182. ⟨hal-03194913⟩
  • Philippe Darondeau, Stephane Demri, Roland Meyer, Christophe Morvan. Petri Net Reachability Graphs: Decidability Status of FO Properties. IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, IARCS, Dec 2011, Bombay, India. ⟨inria-00627657⟩
  • Pedro Cabalar, Stéphane Demri. Automata-Based Computation of Temporal Equilibrium Models. 21st International Workshop on Logic Program Synthesis and Transformation (LOPSTR'11), German Vidal, Jun 2011, Odense, Denmark. pp.57-72, ⟨10.1007/978-3-642-32211-2_5⟩. ⟨hal-03195219⟩
  • Marcello Bersani, Stéphane Demri. The Complexity of Reversal-Bounded Model-Checking. 8th International Symposium on Frontiers of Combining Systems (FroCoS'11), Viorica Sofronie-Stokkermans; Cesare Tinelli, Oct 2011, Saarbruecken, Germany. pp.71-86, ⟨10.1007/978-3-642-24364-6_6⟩. ⟨hal-03195045⟩
  • Stéphane Demri. On Selective Unboundedness of VASS. 12th International Workshops on Verification of Infinite State Systems (INFINITY'10), Oct 2010, Singapore, Singapore. pp.1-15, ⟨10.4204/EPTCS.39.1⟩. ⟨hal-03195047⟩
  • Stéphane Demri. Sequent Calculi for Nominal Tense Logics: A Step Towards Mechanization?. International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX'99), Jun 1999, Saratoga Springs, United States. pp.140-155, ⟨10.1007/3-540-48754-9_15⟩. ⟨hal-03195331⟩
  • Stéphane Demri, Rajeev Goré. An O((n.log n) 3 )-time transformation from Grz into decidable fragments of classical first-order logic. International Workshop on First order Theorem Proving (FTP'98), Ricardo Caferra; Gernot Salzer, Nov 1998, Vienna, Austria. pp.153-167. ⟨hal-03195009⟩
  • Stéphane Demri, Beata Konikowska. Relative Similarity Logics are Decidable: Reduction to FO2 with Equality. European Workshop on Logics in Artificial Intelligence (JELIA'98), Jurgen Dix; Luis Farinas del Cerro; Ulrich Furbach, Oct 1998, Dagstuhl, Germany. pp.279-293, ⟨10.1007/3-540-49545-2_19⟩. ⟨hal-03195324⟩
  • Philippe Balbiani, Stéphane Demri. Prefixed Tableaux Systems for Modal Logics with Enriched Languages. 15th International Joint Conference on Artificial Intelligence (IJCAI'97), Aug 1997, Nagoya, Japan. pp.190-195. ⟨hal-03195295⟩
  • Stéphane Demri. A simple tableau system for the logic of elsewhere. 5th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods (TABLEAUX '96), May 1996, Palerme, Italy. pp.177-192, ⟨10.1007/3-540-61208-4_12⟩. ⟨hal-03195223⟩
  • Stéphane Demri. A Hierarchy of Backward Translations: Applications to Modal Logics. Proceedings of the Second World Conference on the Fundamentals of Artificial Intelligence, WOCFAI 1995,, Michel De Glas; Zdzislaw Pawlak, Jul 1995, Paris, France. pp.121-132. ⟨hal-03195010⟩
  • Thierry Boy de la Tour, Stéphane Demri. On the Complexity of Extending Ground Resolution with Symmetry Rules. Fourteenth International Joint Conference on Artificial Intelligence, (IJCAI'95), Aug 1995, Montreal, Canada. pp.289-295. ⟨hal-03195326⟩

Books3 documents

  • Stéphane Demri, Valentin Goranko, Martin Lange. Temporal Logics in Computer Science: Finite-State Systems. Cambridge University Press, 2016, 9781139236119. ⟨hal-03189977⟩
  • Carlos Areces, Stephane Demri. Methods for Modalities 2007. Electronic Notes in Computer Science, pp.1, 2008. ⟨inria-00323836⟩
  • Stéphane Demri, Ewa Orlowska. Incomplete Information: Structure, Inference, Complexity. Springer, 2002, 978-3-662-04997-6. ⟨hal-03190271⟩

Book sections9 documents

  • Stephane Demri. Reasoning about reversal-bounded counter machines. Ewa Orlowska on Relational Methods in Logic and Computer Science, volume 17 of Outstanding Contributions to Logic, Springer, 2018., pp.441--479, 2018, ⟨10.1007/978-3-319-97879-6_17⟩. ⟨hal-02366668⟩
  • Stéphane Demri, Paul Gastin. Specification and Verification using Temporal Logics. D'Souza, Deepak and Shankar, Priti. Modern applications of automata theory, 2, World Scientific, pp.457-494, 2012. ⟨hal-00776601⟩
  • Stéphane Demri, Denis Poitrenaud. Verification of Infinite-State Systems. Models and Analysis in Distributed Systems, Wiley, pp.221-269, 2011, 9781848213142. ⟨hal-01288079⟩
  • Stéphane Demri. Modal Logics with Weak Forms of Recursion: PSPACE Specimens. Advances in Modal Logic (AIML'00), WORLD SCIENTIFIC, pp.113-138, 2002, 979-981-238-179-8. ⟨10.1142/9789812776471_0007⟩. ⟨hal-03194865⟩
  • Stéphane Demri. Coping with Semilattices of Relations in Logics with Relative Accessibility Relations. Ewa Orlowska; Andrzej Szalas. Relational Methods for Computer Science Applications. Selected Papers from 4th International Seminar on Relational Methods in Logic, Algebra and Computer Science ('98), pp.163-181, 2001, 978-3-7908-1828-4. ⟨10.1007/978-3-7908-1828-4_10⟩. ⟨hal-03194796⟩
  • Stéphane Demri, Ewa Orlowska. Informational representability of models for information logics. Ewa Orlowska. Logic at Work. Essays Dedicated to the Memory of Helena Rasiowa, Physica Verlag, pp.383-409, 1999, 978-3-7908-1864-2. ⟨hal-03195297⟩
  • Stéphane Demri, Ewa Orlowska, Dimiter Vakarelov. Indiscernibility and complementarity relations in information systems. Jelle Gerbrandy; Maarten Marx; Maarten de Rijke; Yde Venema. JFAK: Essays Dedicated to Johan van Benthem on the Occasion of his 50th Birthday, 1999. ⟨hal-03192504⟩
  • Stéphane Demri, Ewa Orlowska. Logical analysis of indiscernibility. Ewa Orlowska. Incomplete Information: Rough Set Analysis, pp.347-380, 1998, 78-3-7908-1888-8. ⟨hal-03193466⟩
  • Stéphane Demri, Ewa Orlowska. Complementarity Relations: Reduction of Decision Rules and Informational Representability. Lech Polkowski; Andrzej Skowron. Rough Sets in Knowledge Discovery 1 -- Methodology and Applications, pp.99-106, 1998, 978-3-7908-1884-0. ⟨hal-03195328⟩

Directions of work or proceedings4 documents

  • Stéphane Demri, Deepak Kapur, Christoph Weidenbach. Special Issue of Selected Extended Papers of IJCAR 2014. Journal of Automated Reasoning, 58 (1), 2017. ⟨hal-03192247⟩
  • Lev Dmitrievich Beklemishev, Stéphane Demri, Andras Maté. Proceedings of the 11th Conference on Advances in Modal Logic (AiML'16). Aug 2016, Budapest, Hungary. 2016, 978-1-84890-201-5. ⟨hal-03191063⟩
  • Stéphane Demri, Deepak Kapur, Christoph Weidenbach. Automated Reasoning – Seventh International Joint Conference (IJCAR 2014). Stéphane Demri; Deepak Kapur; Christoph Weidenbach. 7th International Joint Conference - IJCAR 2014, Jun 2014, Vienna, Austria. 8562, Springer, 2014, LNCS - Lecture Notes in Computer Science, 978-3-319-08586-9. ⟨10.1007/978-3-319-08587-6⟩. ⟨hal-01098072⟩
  • Stéphane Demri, Christian Jensen. Proceedings of the 15th International Symposium on Temporal Representation and Reasoning (TIME 2008), Montréal, Canada. Jun 2008, 2008, 978-0-7695-3181-6. ⟨hal-03191892⟩

Preprints, Working Papers, ...1 document

  • Stéphane Demri, Etienne Lozes, Alessio Mansutti. A Complete Axiomatisation for Quantifier-Free Separation Logic. 2020. ⟨hal-03005864⟩

Habilitation à diriger des recherches1 document

  • Stéphane Demri. Logiques pour la spécification et vérification. Logique en informatique [cs.LO]. Université Denis Diderot Paris 7, 2007. ⟨tel-03189929⟩

Lectures2 documents

  • Stéphane Demri. Rudiments of Presburger Arithmetic. Master. Paris, France. 2016, pp.44. ⟨hal-03188114⟩
  • Stéphane Demri, Morgan Deters. Logical Investigations on Separation Logics (ESSLLI 2015). Doctoral. Barcelona, Spain. 2015, pp.195. ⟨hal-03187866⟩