Publications : Stéphane DEMRI

[BD20]
F. Belardinelli and S. Demri. Reasoning with a Bounded Number of Resources in ATL+. In Proceedings of the 24th European Conference on Artificial Intelligence (ECAI'20), Santiago de Compostela, Spain, September 2020. IOS Press. To appear.
BibTex | PDF ]
[BDFM20]
B. Bednarczyk, S. Demri, R. Fervari, and A. Mansutti. Modal Logics with Composition on Finite Forests: Expressivity and Complexity. In Proceedings of the 35th Annual ACM/IEEE Symposium on Logic In Computer Science (LICS'20), pages 167--180, Saarbrucken, Germany, July 2020. IEEE Press.
doi: https://dl.acm.org/doi/10.1145/3373718.3394787.
BibTex | DOI | PDF ]
[BDM20]
B. Bednarczyk, S. Demri, and A. Mansutti. A Framework for Reasoning about Dynamic Axioms in Description Logics. In Proceedings of the 29th International Joint Conference on Artificial Intelligence (IJCAI'20). IJCAI organization, July 2020. To appear.
BibTex ]
[DLM20]
S. Demri, É. Lozes, and A. Mansutti. Internal Calculi for Separation Logics. In Proceedings of the 28th Annual EACSL Conference on Computer Science Logic (CSL'20), Leibniz International Proceedings in Informatics, Barcelona, Spain, January 2020. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CSL.2020.19.
BibTex | DOI | Web page ]
[BD19b]
F. Belardinelli and S. Demri. Resource-bounded ATL: the Quest for Tractable Fragments. In Proceedings of the 18th International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS'19), pages 206--214, Montreal, Canada, June 2019. ACM Press.
BibTex | Web page | PDF ]
[DFM19]
S. Demri, R. Fervari, and A. Mansutti. Axiomatising logics with separating conjunctions and modalities. In Proceedings of the 16th European Conference on Logics in Artificial Intelligence (JELIA'19), volume 11468 of Lecture Notes in Artificial Intelligence, pages 692--708, Rende, Italy, June 2019. Springer.
doi: 10.1007/978-3-030-19570-0_45.
BibTex | DOI | Web page | PDF ]
[BD19a]
B. Bednarczyk and S. Demri. Why propositional quantification makes modal logics on trees robustly hard ? In Proceedings of the 34th Annual ACM/IEEE Symposium on Logic In Computer Science (LICS'19), pages 1--13, Vancouver, Canada, June 2019. IEEE Press.
doi: 10.1109/LICS.2019.8785656.
BibTex | DOI | PDF ]
[DF19]
S. Demri and R. Fervari. The power of modal separation logics. Journal of Logic and Computation, 29(8):1139--1184, 2019.
BibTex | PDF ]
[Dem18a]
S. Demri. On temporal and separation logics. In Proceedings of the 25th International Symposium on Temporal Representation and Reasoning (TIME'18), Leibniz International Proceedings in Informatics, pages 1:1--1:4, Warsaw, Poland, October 2018. Leibniz-Zentrum für Informatik.
BibTex | Web page ]
[DF18]
S. Demri and R. Fervari. On the complexity of modal separation logics. In Proceedings of the 10th Conference on Advances in Modal Logics (AiML'18), pages 179--198, Bern, Switzerland, August 2018. College Publications.
BibTex | Web page | PDF ]
[DLM18]
S. Demri, É. Lozes, and A. Mansutti. The Effects of Adding Reachability Predicates in Propositional Separation Logic. In Proceedings of the 21st International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'18), volume 10803 of Lecture Notes in Computer Science, pages 476--493, Thessaloniki, Greece, April 2018. Springer.
BibTex | PDF ]
[Dem18b]
S. Demri. Reasoning about reversal-bounded counter machines. In Ewa Orlowska on Relational Methods in Logic and Computer Science, volume 17 of Outstanding Contributions to Logic, pages 441--479. Springer, 2018.
BibTex | Web page | PDF ]
[ABDL18]
N. Alechina, N. Bulling, S. Demri, and B. Logan. On the Complexity of Resource-Bounded Logics. Theoretical Computer Science, 750:69--100, 2018.
doi: 10.1016/j.tcs.2018.01.019.
BibTex | DOI | PDF ]
[DLL17]
S. Demri, É. Lozes, and D. Lugiez. On Symbolic Heaps Modulo Permission Theories. In Proceedings of the 37th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'17), volume 93 of Leibniz International Proceedings in Informatics, pages 25:1--25:14, Kanpur, India, December 2017. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2017.25.
BibTex | DOI | Web page | PDF ]
[DGLWM17]
S. Demri, D. Galmiche, D. Larchey-Wendling, and D. Mery. Separation Logic with One Quantified Variable. Theory of Computing Systems, 61(2):371--461, 2017.
doi: 10.1007/s00224-016-9713-1.
BibTex | DOI | Web page | PDF ]
[DDS17]
S. Demri, A. Dhar, and A. Sangnier. Equivalence Between Model-Checking Flat Counter Systems and Presburger Arithmetic. Theoretical Computer Science, 735:2--23, 2017.
BibTex | PDF ]
[DKW17]
S. Demri, D. Kapur, and C. Weidenbach. Special Issue of Selected Extended Papers of IJCAR 2014. Journal of Automated Reasoning, 58(1), 2017.
BibTex | Web page ]
[DGL16]
S. Demri, V. Goranko, and M. Lange. Temporal Logics in Computer Science, volume 58 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, October 2016.
BibTex | Web page ]
[ABDL16]
N. Alechina, N. Bulling, S. Demri, and B. Logan. On the Complexity of Resource-Bounded Logics. In Proceedings of the 10th Workshop on Reachability Problems in Computational Models (RP'16), volume 9899 of Lecture Notes in Computer Science, pages 36--50, Aalborg, Denmark, September 2016. Springer.
doi: 10.1007/978-3-319-45994-3_3.
BibTex | DOI | Web page | PDF ]
[DFP16]
S. Demri, D. Figueira, and M. Praveen. Reasoning about Data Repetitions with Counter Systems. Logical Methods in Computer Science, 12(3):1:1--1:55, August 2016.
doi: 10.2168/LMCS-12(3:1)2016.
BibTex | DOI | Web page | PDF ]
[DD16a]
S. Demri and M. Deters. Expressive Completeness of Separation Logic With Two Variables and No Separating Conjunction. ACM Transactions on Computational Logic, 17(2):12:1--12:44, March 2016.
doi: 10.1145/2835490.
BibTex | DOI | Web page | PDF ]
[DD16b]
S. Demri and M. Deters. Temporal Logics on Strings with Prefix Relation. Journal of Logic and Computation, 26(3):989--1017, 2016.
doi: 10.1093/logcom/exv028.
BibTex | DOI | Web page | PDF ]
[ADF+16]
P. A. Abdulla, S. Demri, A. Finkel, J. Leroux, and I. Potapov. Selected papers of Reachability Problems Workshop 2012 (Bordeaux) and 2013 (Uppsala). Fundamenta Informaticae, 143(3--4), 2016.
BibTex | Web page ]
[DD15a]
S. Demri and M. Deters. Logical Investigations on Separation Logics. Lecture Notes, European Summer School on Logic, Language and Information (ESSLLI'15), August 2015.
BibTex | Web page | PDF ]
[DDS15]
S. Demri, A. K. Dhar, and A. Sangnier. Taming Past LTL and Flat Counter Systems. Information and Computation, 242:306--339, June 2015.
doi: 10.1016/j.ic.2015.03.007.
BibTex | DOI | Web page | PDF ]
[DD15c]
S. Demri and M. Deters. Two-variable separation logic and its inner circle. ACM Transactions on Computational Logic, 16(2:15), March 2015.
doi: 10.1145/2724711.
BibTex | DOI | Web page | PDF ]
[DD15b]
S. Demri and M. Deters. Separation Logics and Modalities: A Survey. Journal of Applied Non-Classical Logics, 25(1):50--99, 2015.
doi: 10.1080/11663081.2015.1018801.
BibTex | DOI | Web page | PDF ]
[DDS14]
S. Demri, A. K. Dhar, and A. Sangnier. Equivalence Between Model-Checking Flat Counter Systems and Presburger Arithmetic. In Proceedings of the 8th Workshop on Reachability Problems in Computational Models (RP'14), volume 8762 of Lecture Notes in Computer Science, pages 85--97, Oxford, UK, September 2014. Springer.
doi: 10.1007/978-3-319-11439-2_7.
BibTex | DOI | Web page | PDF ]
[DD14a]
S. Demri and M. Deters. The effects of modalities in separation logics (extended abstract). In Proceedings of the 10th Conference on Advances in Modal Logics (AiML'14), pages 134--138, Groningen, The Netherlands, August 2014. College Publications.
BibTex | Web page | PDF ]
[DD14b]
S. Demri and M. Deters. Expressive Completeness of Separation Logic With Two Variables and No Separating Conjunction. In Proceedings of the Joint Meeting of the 23rd EACSL Annual Conference on Computer Science Logic and the 29th Annual ACM/ IEEE Symposium on Logic In Computer Science (CSL/LICS'14), Vienna, Austria, July 2014. ACM Press.
doi: 10.1145/2603088.2603142.
BibTex | DOI | Web page | PDF ]
[DGLWM14]
S. Demri, D. Galmiche, D. Larchey-Wendling, and D. Méry. Separation Logic with One Quantified Variable. In Proceedings of the 9th International Computer Science Symposium in Russia (CSR'14), volume 8476 of Lecture Notes in Computer Science, pages 125--138, Moscow, Russia, June 2014. Springer.
doi: 10.1007/978-3-319-06686-8_10.
BibTex | DOI | Web page | PDF ]
[BDD13]
C. Barrett, S. Demri, and M. Deters. Witness runs for counter machines. In Proceedings of the 9th International Symposium on Frontiers of Combining Systems (FroCoS'13), volume 8152 of Lecture Notes in Artificial Intelligence, pages 120--150, Nancy, France, September 2013. Springer.
doi: 10.1007/978-3-642-40885-4_9.
BibTex | DOI | Web page | PDF ]
[Dem13]
S. Demri. On selective unboundedness of VASS. Journal of Computer and System Sciences, 79(5):689--713, August 2013.
doi: 10.1016/j.jcss.2013.01.014.
BibTex | DOI | Web page | PDF ]
[DDS13]
S. Demri, A. K. Dhar, and A. Sangnier. On the Complexity of Verifying Regular Properties on Flat Counter Systems. In Proceedings of the 40th International Colloquium on Automata, Languages and Programming (ICALP'13) -- Part II, volume 7966 of Lecture Notes in Computer Science, pages 162--173, Riga, Latvia, July 2013. Springer.
doi: 10.1007/978-3-642-39212-2_17.
BibTex | DOI | Web page | PDF ]
[BD13]
K. Bansal and S. Demri. Model-checking bounded multi-pushdown systems. In Proceedings of the 8th International Computer Science Symposium in Russia (CSR'13), volume 7913 of Lecture Notes in Computer Science, pages 405--417, Ekaterinburg, Russia, June 2013. Springer.
doi: 10.1007/978-3-642-38536-0_35.
BibTex | DOI | Web page | PDF ]
[DFP13]
S. Demri, D. Figueira, and M. Praveen. Reasoning about Data Repetitions with Counter Systems. In Proceedings of the 28th Annual IEEE Symposium on Logic in Computer Science (LICS'13), pages 33--42, New-Orleans, Louisiana, USA, June 2013. IEEE Computer Society Press.
doi: 10.1109/LICS.2013.8.
BibTex | DOI | Web page | PDF ]
[DDG12]
S. Demri, D. D'Souza, and R. Gascon. Temporal Logics of Repeating Values. Journal of Logic and Computation, 22(5):1059--1096, October 2012.
doi: 10.1093/logcom/exr013.
BibTex | DOI | Web page | PDF ]
[DDMM12]
Ph. Darondeau, S. Demri, R. Meyer, and Ch. Morvan. Petri Net Reachability Graphs: Decidability Status of FO Properties. Logical Methods in Computer Science, 8(4:9), October 2012.
doi: 10.2168/LMCS-8(4:9)2012.
BibTex | DOI | Web page | PDF ]
[CD12b]
F. Carreiro and S. Demri. Beyond Regularity for Presburger Modal Logics. In Selected Papers from the 9th Workshop on Advances in Modal Logics (AiML'12), pages 161--182, Copenhagen, Denmark, August 2012. College Publications.
BibTex | Web page | PDF ]
[DG12]
S. Demri and P. Gastin. Specification and Verification using Temporal Logics. In Modern applications of automata theory, volume 2 of IISc Research Monographs, chapter 15, pages 457--494. World Scientific, July 2012.
BibTex | Web page | PDF ]
[DDS12]
S. Demri, A. K. Dhar, and A. Sangnier. Taming Past LTL and Flat Counter Systems. In Proceedings of the 6th International Joint Conference on Automated Reasoning (IJCAR'12), volume 7364 of Lecture Notes in Artificial Intelligence, pages 179--193, Manchester, UK, June 2012. Springer-Verlag.
doi: 10.1007/978-3-642-31365-3_16.
BibTex | DOI | Web page | PDF ]
[DJLL12]
S. Demri, M. Jurdziński, O. Lachish, and R. Lazić. The covering and boundedness problems for branching vector addition systems. Journal of Computer and System Sciences, 79(1):23--38, February 2012.
doi: 10.1016/j.jcss.2012.04.002.
BibTex | DOI | Web page | PDF ]
[BDL12]
R. Brochenin, S. Demri, and É. Lozes. On the Almighty Wand. Information and Computation, 211:106--137, February 2012.
doi: 10.1016/j.ic.2011.12.003.
BibTex | DOI | Web page | PDF ]
[CD12a]
P. Cabalar and S. Demri. Automata-Based Computation of Temporal Equilibrium Models. In Proceedings of the 21st International Workshop on Logic Program Synthesis and Transformation (LOPSTR'11), volume 7225 of Lecture Notes in Computer Science, pages 57--72, Odense, Denmark, 2012. Springer.
doi: 10.1007/978-3-642-32211-2_5.
BibTex | DOI | Web page | PDF ]
[DDMM11]
Ph. Darondeau, S. Demri, R. Meyer, and Ch. Morvan. Petri Net Reachability Graphs: Decidability Status of FO Properties. In Proceedings of the 31st Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'11), volume 13 of Leibniz International Proceedings in Informatics, pages 140--151, Mumbai, India, December 2011. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2011.140.
BibTex | DOI | Web page | PDF ]
[BD11]
M. Bersani and S. Demri. The complexity of reversal-bounded model-checking. In Proceedings of the 8th International Symposium on Frontiers of Combining Systems (FroCoS'11), volume 6989 of Lecture Notes in Artificial Intelligence, pages 71--86, Saarbrücken, Germany, October 2011. Springer.
doi: 10.1007/978-3-642-24364-6_6.
BibTex | DOI | Web page | PDF ]
[DP11]
S. Demri and D. Poitrenaud. Verification of Infinite-State Systems. In Models and Analysis in Distributed Systems, chapter 8, pages 221--269. John Wiley & Sons, Ltd., 2011.
BibTex | Web page | PDF ]
[DR10]
S. Demri and A. Rabinovich. The Complexity of Linear-time Temporal Logic over the Class of Ordinals. Logical Methods in Computer Science, 6(4), December 2010.
doi: 10.2168/LMCS-6(4:9)2010.
BibTex | DOI | Web page | PDF ]
[Dem10a]
S. Demri. Counter Systems for Data Logics. In Proceedings of the 12th European Conference on Logics in Artificial Intelligence (JELIA'10), volume 6431 of Lecture Notes in Artificial Intelligence, page 10, Helsinki, Finland, September 2010. Springer.
doi: 10.1007/978-3-642-15675-5_3.
BibTex | DOI | Web page | PDF ]
[Dem10b]
S. Demri. On Selective Unboundedness of VASS. In Proceedings of the 12th International Workshops on Verification of Infinite State Systems (INFINITY'10), volume 39 of Electronic Proceedings in Theoretical Computer Science, pages 1--15, Singapore, September 2010.
doi: 10.4204/EPTCS.39.1.
BibTex | DOI | Web page | PDF ]
[DL10]
S. Demri and D. Lugiez. Complexity of Modal Logics with Presburger Constraints. Journal of Applied Logic, 8(3):233--252, September 2010.
doi: 10.1016/j.jal.2010.03.001.
BibTex | DOI | Web page | PDF ]
[DLS10]
S. Demri, R. Lazić, and A. Sangnier. Model checking memoryful linear-time logics over one-counter automata. Theoretical Computer Science, 411(22-24):2298--2316, May 2010.
doi: 10.1016/j.tcs.2010.02.021.
BibTex | DOI | Web page | PDF ]
[DS10]
S. Demri and A. Sangnier. When Model-Checking Freeze LTL over Counter Machines Becomes Decidable. In Proceedings of the 13th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'10), volume 6014 of Lecture Notes in Computer Science, pages 176--190, Paphos, Cyprus, March 2010. Springer.
doi: 10.1007/978-3-642-12032-9_13.
BibTex | DOI | Web page | PDF ]
[DFGvD10]
S. Demri, A. Finkel, V. Goranko, and G. van Drimmelen. Model-checking CTL^* over Flat Presburger Counter Systems. Journal of Applied Non-Classical Logics, 20(4):313--344, 2010.
doi: 10.3166/jancl.20.313-344.
BibTex | DOI | Web page | PDF ]
[DJLL09]
S. Demri, M. Jurdziński, O. Lachish, and R. Lazić. The covering and boundedness problems for branching vector addition systems. In Proceedings of the 29th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'09), volume 4 of Leibniz International Proceedings in Informatics, pages 181--192, Kanpur, India, December 2009. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2009.2317.
BibTex | DOI | Web page | PDF ]
[BDL09]
R. Brochenin, S. Demri, and É. Lozes. Reasoning about sequences of memory states. Annals of Pure and Applied Logics, 161(3):305--323, December 2009.
doi: 10.1016/j.apal.2009.07.004.
BibTex | DOI | Web page | PDF ]
[DG09]
S. Demri and R. Gascon. The Effects of Bounding Syntactic Resources on Presburger LTL. Journal of Logic and Computation, 19(6):1541--1575, December 2009.
doi: 10.1093/logcom/exp037.
BibTex | DOI | Web page | PDF ]
[DL09]
S. Demri and R. Lazić. LTL with the freeze quantifier and register automata. ACM Transactions on Computational Logic, 10(3), April 2009.
doi: 10.1145/1507244.1507246.
BibTex | DOI | Web page | PDF ]
[DG08]
S. Demri and R. Gascon. Verification of Qualitative Z constraints. Theoretical Computer Science, 409(1):24--40, December 2008.
doi: 10.1016/j.tcs.2008.07.023.
BibTex | DOI | Web page | PDF ]
[BDL08]
R. Brochenin, S. Demri, and É. Lozes. On the Almighty Wand. In Proceedings of the 17th Annual EACSL Conference on Computer Science Logic (CSL'08), volume 5213 of Lecture Notes in Computer Science, pages 323--338, Bertinoro, Italy, September 2008. Springer.
doi: 10.1007/978-3-540-87531-4_24.
BibTex | DOI | Web page | PDF ]
[DLS08]
S. Demri, R. Lazić, and A. Sangnier. Model checking freeze LTL over one-counter automata. In Proceedings of the 11th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'08), volume 4962 of Lecture Notes in Computer Science, pages 490--504, Budapest, Hungary, March-April 2008. Springer.
doi: 10.1007/978-3-540-78499-9_34.
BibTex | DOI | Web page | PS | PDF ]
[DR07]
S. Demri and A. Rabinovich. The complexity of temporal logic with until and since over ordinals. In Proceedings of the 14th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'07), volume 4790 of Lecture Notes in Artificial Intelligence, pages 531--545, Yerevan, Armenia, October 2007. Springer.
doi: 10.1007/978-3-540-75560-9_38.
BibTex | DOI | Web page | PDF ]
[Dem07]
S. Demri. Logiques pour la spécification et vérification. Mémoire d'habilitation, Université Paris 7, Paris, France, June 2007.
BibTex | Web page | PDF ]
[DG07]
S. Demri and R. Gascon. The Effects of Bounding Syntactic Resources on Presburger LTL (Extended Abstract). In Proceedings of the 14th International Symposium on Temporal Representation and Reasoning (TIME'07), pages 94--104, Alicante, Spain, June 2007. IEEE Computer Society Press.
doi: 10.1109/TIME.2007.63.
BibTex | DOI | Web page | PDF ]
[BDL07b]
R. Brochenin, S. Demri, and É. Lozes. Reasoning about sequences of memory states. In Proceedings of the Symposium on Logical Foundations of Computer Science (LFCS'07), volume 4514 of Lecture Notes in Computer Science, pages 100--114, New York, New York, USA, June 2007. Springer.
doi: 10.1007/978-3-540-72734-7_8.
BibTex | DOI | Web page | PDF ]
[DDG07]
S. Demri, D. D'Souza, and R. Gascon. Decidable Temporal Logic with Repeating Values. In Proceedings of the Symposium on Logical Foundations of Computer Science (LFCS'07), volume 4514 of Lecture Notes in Computer Science, pages 180--194, New York, New York, USA, June 2007. Springer.
doi: 10.1007/978-3-540-72734-7_13.
BibTex | DOI | Web page | PDF ]
[BDL07a]
R. Brochenin, S. Demri, and É. Lozes. Reasoning about Sequences of Memory States. In Proceedings of the 1st Workshop on Heap Analysis and Verification (HAV'07), Braga, Portugal, March 2007.
BibTex | Web page | PDF ]
[DD07]
S. Demri and D. D'Souza. An automata-theoretic approach to constraint LTL. Information and Computation, 205(3):380--415, March 2007.
doi: 10.1016/j.ic.2006.09.006.
BibTex | DOI | Web page | PDF ]
[DN07]
S. Demri and D. Nowak. Reasoning about transfinite sequences. International Journal of Foundations of Computer Science, 18(1):87--112, February 2007.
doi: 10.1142/S0129054107004589.
BibTex | DOI | Web page | PS | PDF ]
[DO07]
S. Demri and E. Orlowska. Relative Nondeterministic Information Logic is EXPTIME-complete. Fundamenta Informaticae, 75(1-4):163--178, 2007.
BibTex | Web page | PDF ]
[DLN07]
S. Demri, R. Lazić, and D. Nowak. On the freeze quantifier in constraint LTL: Decidability and complexity. Information and Computation, 205(1):2--24, January 2007.
doi: 10.1016/j.ic.2006.08.003.
BibTex | DOI | Web page | PDF ]
[DFGvD06]
S. Demri, A. Finkel, V. Goranko, and G. van Drimmelen. Towards a model-checker for counter systems. In Proceedings of the 4th International Symposium on Automated Technology for Verification and Analysis (ATVA'06), volume 4218 of Lecture Notes in Computer Science, pages 493--507, Beijing, China, October 2006. Springer.
doi: 10.1007/11901914_36.
BibTex | DOI | Web page | PDF ]
[DL06a]
S. Demri and R. Lazić. LTL with the freeze quantifier and register automata. In Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06), pages 17--26, Seattle, Washington, USA, August 2006. IEEE Computer Society Press.
doi: 10.1109/LICS.2006.31.
BibTex | DOI | Web page | PDF ]
[DL06b]
S. Demri and D. Lugiez. Presburger Modal Logic is Only PSPACE-complete. In Proceedings of the 3rd International Joint Conference on Automated Reasoning (IJCAR'06), volume 4130 of Lecture Notes in Artificial Intelligence, pages 541--556, Seattle, Washington, USA, August 2006. Springer-Verlag.
doi: 10.1007/11814771_44.
BibTex | DOI | Web page ]
[Dem06b]
S. Demri. LTL over integer periodicity constraints. Theoretical Computer Science, 360(1-3):96--123, August 2006.
doi: 10.1016/j.tcs.2006.02.019.
BibTex | DOI | Web page | PDF ]
[DLS06]
S. Demri, F. Laroussinie, and Ph. Schnoebelen. A Parametric Analysis of the State Explosion Problem in Model Checking. Journal of Computer and System Sciences, 72(4):547--575, June 2006.
doi: 10.1016/j.jcss.2005.11.003.
BibTex | DOI | Web page | PS | PDF ]
[Dem06a]
S. Demri. Linear-Time Temporal Logics with Presburger Constraints: An Overview. Journal of Applied Non-Classical Logics, 16(3-4):311--347, 2006.
BibTex | Web page | PDF ]
[Dem05b]
S. Demri. A reduction from DLP to PDL. Journal of Logic and Computation, 15(5):767--785, October 2005.
doi: 10.1093/logcom/exi043.
BibTex | DOI | Web page | PDF ]
[DN05]
S. Demri and D. Nowak. Reasoning about transfinite sequences (extended abstract). In Proceedings of the 3rd International Symposium on Automated Technology for Verification and Analysis (ATVA'05), volume 3707 of Lecture Notes in Computer Science, pages 248--262, Taipei, Taiwan, October 2005. Springer.
doi: 10.1007/11562948_20.
BibTex | DOI | Web page | PS | PDF ]
[Dem05a]
S. Demri. On the complexity of information logics. Invited talk, Workshop on Logical and Algebraic Foundations of Rough Sets, Regina, Canada, August 2005.
BibTex ]
[DG05]
S. Demri and R. Gascon. Verification of Qualitative Z-Constraints. In Proceedings of the 16th International Conference on Concurrency Theory (CONCUR'05), volume 3653 of Lecture Notes in Computer Science, pages 518--532, San Francisco, California, USA, August 2005. Springer.
doi: 10.1007/11539452_39.
BibTex | DOI | Web page | PDF ]
[DdN05]
S. Demri and H. de Nivelle. Deciding Regular Grammar Logics with Converse through First-Order Logic. Journal of Logic, Language and Information, 14(3):289--319, June 2005.
doi: 10.1007/s10849-005-5788-9.
BibTex | DOI | Web page | PDF ]
[DLN05]
S. Demri, R. Lazić, and D. Nowak. On the Freeze Quantifier in Constraint LTL: Decidability and Complexity. In Proceedings of the 12th International Symposium on Temporal Representation and Reasoning (TIME'05), pages 113--121, Burlington, Vermont, USA, June 2005. IEEE Computer Society Press.
doi: 10.1109/TIME.2005.28.
BibTex | DOI | Web page | PS | PDF ]
[Dem05c]
S. Demri. Temporal logics, 2005. Course notes, Master Parisien de Recherche en Informatique, Paris, France.
BibTex | Web page | PDF ]
[Dem04b]
S. Demri. LTL over Integer Periodicity Constraints. In Proceedings of the 7th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'04), volume 2987 of Lecture Notes in Computer Science, pages 121--135, Barcelona, Spain, March 2004. Springer.
BibTex | Web page | PS | PDF ]
[Dem04a]
S. Demri. Complexité algorithmique de variantes de LTL pour la vérification, 2004. Course notes, DEA Algorithmique, Paris, France.
BibTex | Web page | PDF ]
[DDG+03]
S. Demri, M. Ducassé, J. Goubault-Larrecq, L. Mé, J. Olivain, C. Picaronny, J.-Ph. Pouzol, É. Totel, and B. Vivinis. Algorithmes de détection et langages de signatures. Contract Report (Sous-projet 3, livrable 3), projet RNTL DICO, October 2003. 72 pages.
BibTex ]
[Dem03a]
S. Demri. (Modal) Logics for Semistructured Data (Bis). Invited talk, 3rd Workshop on Methods for Modalities (M4M'03), Nancy, France, September 2003.
BibTex ]
[DdN03]
S. Demri and H. de Nivelle. Relational Translations into GF2. In Proceedings of the 3rd Workshop on Methods for Modalities (M4M-3), pages 93--108, Nancy, France, September 2003.
BibTex ]
[Dem03b]
S. Demri. A Polynomial-Space Construction of Tree-Like Models for Logics with Local Chains of Modal Connectives. Theoretical Computer Science, 300(1-3):235--258, May 2003.
doi: 10.1016/S0304-3975(02)00082-8.
BibTex | DOI | Web page | PS | PDF ]
[ADdR03]
N. Alechina, S. Demri, and M. de Rijke. A Modal Perspective on Path Constraints. Journal of Logic and Computation, 13(6):939--956, 2003.
BibTex | Web page | PS | PDF ]
[DD02]
S. Demri and D. D'Souza. An Automata-Theoretic Approach to Constraint LTL. In Proceedings of the 22nd Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'02), volume 2556 of Lecture Notes in Computer Science, pages 121--132, Kanpur, India, December 2002. Springer.
BibTex | Web page | PS ]
[DG02a]
S. Demri and R. P. Goré. Display Calculi for Nominal Tense Logics. Journal of Logic and Computation, 12(6):993--1016, December 2002.
BibTex | Web page | PS ]
[DG02b]
S. Demri and R. P. Goré. Theoremhood Preserving Maps Characterising Cut Elimination for Modal Provability Logics. Journal of Logic and Computation, 12(5):861--884, October 2002.
BibTex | Web page | PS ]
[GPD+02]
J. Goubault-Larrecq, J.-Ph. Pouzol, S. Demri, L. Mé, and P. Carle. Langages de détection d'attaques par signatures. Contract Report (Sous-projet 3, livrable 1), Projet RNTL DICO, June 2002. 30 pages.
BibTex ]
[DS02b]
S. Demri and Ph. Schnoebelen. The Complexity of Propositional Linear Temporal Logics in Simple Cases. Information and Computation, 174(1):84--103, April 2002.
doi: 10.1006/inco.2001.3094.
BibTex | DOI | Web page | PS | PDF ]
[DLS02]
S. Demri, F. Laroussinie, and Ph. Schnoebelen. A Parametric Analysis of the State Explosion Problem in Model Checking (Extended Abstract). In Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science (STACS'02), volume 2285 of Lecture Notes in Computer Science, pages 620--631, Antibes Juan-les-Pins, France, March 2002. Springer.
BibTex | Web page | PS | PDF ]
[Dem02]
S. Demri. Modal Logics with Weak Forms of Recursion: PSPACE Specimens. In Selected Papers from the 3rd Workshop on Advances in Modal Logics (AiML 2000), pages 113--138, Leipzig, Germany, 2002. World Scientific. Invited paper.
BibTex | Web page | PS | PDF ]
[DO02]
S. Demri and E. Orlowska. Incomplete Information: Structure, Inference, Complexity. EATCS Monographs. Springer, 2002.
BibTex | Web page ]
[DS02a]
S. Demri and U. Sattler. Automata-Theoretic Decision Procedures for Information Logics. Fundamenta Informaticae, 53(1):1--22, 2002.
BibTex | Web page | PS | PDF ]
[ADdR01]
N. Alechina, S. Demri, and M. de Rijke. Path Constraints from a Modal Logic Point of View (Extended Abstract). In Proceedings of the 8th International Workshop on Knowledge Representation meets Databases (KRDB'01), volume 45 of CEUR Workshop Proceedings, Rome, Italy, September 2001. RWTH Aachen, Germany.
BibTex | Web page | PS ]
[Dem01b]
S. Demri. Coping with Semilattices of Relations in Logics with Relative Accessibility Relations. In Relational Methods for Computer Science Applications. Selected Papers from 4th International Seminar on Relational Methods in Logic, Algebra and Computer Science (RelMiCS'98), volume 65 of Studies in Fuzziness and Soft Computing, pages 163--181, Warsaw, Poland, 2001. Springer.
BibTex | Web page | PDF ]
[Dem01a]
S. Demri. The Complexity of Regularity in Grammar Logics and Related Modal Logics. Journal of Logic and Computation, 11(6):933--960, 2001.
BibTex | Web page | PS | PDF ]
[DG00b]
S. Demri and D. M. Gabbay. On Modal Logics Characterized by Models with Relative Accessibility Relations: Part II. Studia Logica, 66(3):349--384, December 2000.
BibTex | Web page | PS ]
[DS00]
S. Demri and J. Stepaniuk. Computational Complexity of Multimodal Logics Based on Rough Sets. Fundamenta Informaticae, 44(4):373--396, November-December 2000.
BibTex | Web page | PS ]
[DG00a]
S. Demri and D. M. Gabbay. On Modal Logics Characterized by Models with Relative Accessibility Relations: Part I. Studia Logica, 65(3):323--353, August 2000.
BibTex | Web page | PS ]
[Dem00a]
S. Demri. Complexity of Simple Dependent Bimodal Logics. In Proceedings of the 9th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods (TABLEAUX 2000), volume 1847 of Lecture Notes in Artificial Intelligence, pages 190--204, St Andrews, Scotland, UK, July 2000. Springer.
BibTex | Web page | PS ]
[Dem00b]
S. Demri. The Nondeterministic Information Logic NIL is PSPACE-complete. Fundamenta Informaticae, 42(3-4):211--234, April-May 2000.
BibTex | Web page | PS | PDF ]
[DG00c]
S. Demri and R. P. Goré. Display Calculi for Logics with Relative Accessibility Relations. Journal of Logic, Language and Information, 9(2):213--236, April 2000.
BibTex | Web page | PDF ]
[Dem00c]
S. Demri. A Simple Modal Encoding of Propositional Finite Many-Valued Logics. Multiple-Valued Logic, 6:443--461, 2000.
BibTex | Web page | PS | PDF ]
[DG00d]
S. Demri and R. P. Goré. An O((n·log n)^3)-Time Transformation from Grz into Decidable Fragments of Classical First-Order Logic. In Selected Papers in Automated Deduction in Classical and Non-Classical Logics (FTP'98), volume 1761 of Lecture Notes in Artificial Intelligence, pages 153--167, Schloss Wilhelminenberg, Vienna, Austria, 2000. Springer.
BibTex | Web page | PDF ]
[DG99b]
S. Demri and R. P. Goré. Tractable Transformations from Modal Provability Logics into First-Order Logic. In Proceedings of the 16th International Conference on Automated Deduction (CADE'99), volume 1632 of Lecture Notes in Computer Science, pages 16--30, Trento, Italy, July 1999. Springer.
BibTex | Web page | PS ]
[Dem99b]
S. Demri. Sequent Calculi for Nominal Tense Logics: A Step towards Mechanization? In Proceedings of the 8th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods (TABLEAUX'99), volume 1617 of Lecture Notes in Artificial Intelligence, pages 140--154, Saratoga Springs, New York, USA, June 1999. Springer.
BibTex | Web page | PDF ]
[DG99a]
S. Demri and R. P. Goré. Cut-Free Display Calculi for Nominal Tense Logics. In Proceedings of the 8th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods (TABLEAUX'99), volume 1617 of Lecture Notes in Artificial Intelligence, pages 155--170, Saratoga Springs, New York, USA, June 1999. Springer.
BibTex ]
[DOV99]
S. Demri, E. Orlowska, and D. Vakarelov. Indiscernibility and Complementarity Relations in Pawlak's Information Systems. In JFAK: Essays Dedicated to Johan van Benthem on the Occasion of his 50th Birthday, June 1999.
BibTex | Web page | PDF ]
[DO99c]
S. Demri and E. Orlowska. Informational representability of models for information logics. In Logic at Work. Essays Dedicated to the Memory of Helena Rasiowa, volume 24 of Studies in Fuzziness and Soft Computing, chapter 22, pages 383--409. Physica Verlag, May 1999.
BibTex ]
[DO99a]
S. Demri and E. Orlowska. Every Finitely Reducible Logic has the Finite Model Property with Respect to the Class of -Formulae. Studia Logica, 62(2):177--200, March 1999.
BibTex | Web page | PS ]
[Dem99a]
S. Demri. A Logic with Relative Knowledge Operators. Journal of Logic, Language and Information, 8(2):167--185, January 1999.
BibTex | Web page | PS ]
[DO99b]
S. Demri and E. Orlowska. Informational Representability: Abstract Models versus Concrete Models. In Fuzzy sets, Logics and Reasoning about Knowledge, pages 301--314. Kluwer Academic Publishers, 1999.
BibTex ]
[DK98]
S. Demri and B. Konikowska. Relative Similarity Logics are Decidable: Reduction to FO^2 with Equality. In Proceedings of the European Workshop on Logics in Artificial Intelligence (JELIA'98), volume 1489 of Lecture Notes in Artificial Intelligence, pages 279--293, Dagstuhl, Germany, October 1998. Springer.
BibTex | Web page | PS ]
[DO98a]
S. Demri and E. Orlowska. Complementarity Relations: Reduction of Decision Rules and Informational Representability. In Rough Sets in Knowledge Discovery --- 1. Methodology and Applications, volume 18 of Studies in Fuzziness and Soft Computing, chapter 5, pages 99--106. Physica Verlag, October 1998.
BibTex ]
[Dem98]
S. Demri. A Class of Decidable Information Logics. Theoretical Computer Science, 195(1):33--60, March 1998.
BibTex | Web page | PDF ]
[DS98]
S. Demri and Ph. Schnoebelen. The Complexity of Propositional Linear Temporal Logics in Simple Cases (Extended Abstract). In Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS'98), volume 1373 of Lecture Notes in Computer Science, pages 61--72, Paris, France, February 1998. Springer.
doi: 10.1007/BFb0028549.
BibTex | DOI | Web page | PS ]
[DO98b]
S. Demri and E. Orlowska. Logical analysis of indiscernibility. In Incomplete Information: Rough Set Analysis, volume 13 of Studies in Fuzziness and Soft Computing, chapter 11, pages 347--380. Physica Verlag, January 1998.
BibTex ]
[BD97]
Ph. Balbiani and S. Demri. Prefixed Tableaux Systems for Modal Logics with Enriched Languages. In Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI'97), pages 190--195, Nagoya, Japan, August 1997. Morgan Kaufmann.
BibTex | Web page | PS | PDF ]
[Dem97]
S. Demri. A Completeness Proof for a Logic with an Alternative Necessity Operator. Studia Logica, 58(1):99--112, January 1997.
BibTex ]
[DO96]
S. Demri and E. Orlowska. Logical Analysis of Demonic Nondeterministic Programs. Theoretical Computer Science, 166(1-2):173--202, October 1996.
BibTex | Web page | PDF ]
[Dem96a]
S. Demri. A Class of Information Logics with a Decidable Validity Problem. In Proceedings of the 21st International Symposium on Mathematical Foundations of Computer Science (MFCS'96), volume 1113 of Lecture Notes in Computer Science, pages 291--302, Cracow, Poland, September 1996. Springer.
BibTex ]
[Dem96b]
S. Demri. A Simple Tableau System for the Logic of Elsewhere. In Proceedings of the 5th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods (TABLEAUX'96), volume 1071 of Lecture Notes in Artificial Intelligence, pages 177--192, Terrasini, Palermo, Italy, May 1996. Springer.
BibTex | Web page | PDF ]
[BdlTD95]
Th. Boy de la Tour and S. Demri. On the Complexity of Extending Ground Resolution with Symmetry Rules. In Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI'85), pages 289--295, Montréal, Québec, Canada, August 1995. Morgan Kaufmann.
BibTex | Web page | PS ]
[Dem95a]
S. Demri. A Hierarchy of Backward Translations: Applications to Modal Logics. In Proceedings of the 2nd World Conference on the Foundamentals of Artificial Intelligence (WOCFAI'95), pages 121--132, Paris, France, July 1995. Angkor.
BibTex ]
[Dem95b]
S. Demri. SAT = 3-SAT for a Class of Normal Modal Logics. Information Processing Letters, 54(5):281--287, June 1995.
BibTex ]
[Dem95c]
S. Demri. Uniform and Non Uniform Strategies for Tableaux Calculi for Modal Logics. Journal of Applied Non-Classical Logics, 5(1):77--96, 1995.
BibTex ]
[Dem94]
S. Demri. Resolution for Weak Modal Logics. In Proceedings of the 6th International Conference on Artificial Intelligence: Methodology, Systems, Applications, pages 131--140, Sofia, Bulgaria, September 1994. World Scientific.
BibTex | Web page | PS ]

This file was generated by bibtex2html 1.98.

About LSV