( en | de | ru )

 

Disambiguation of "Demri, Stéphane"

Author of the publication

copydeleteadd this publication to your clipboard
Advances in Modal Logic 11, proceedings of the 11th conference on Ädvances in Modal Logic," held in Budapest, Hungary, August 30 - September 2, 2016

, , and (Eds.) College Publications, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Stéphane Müller

Stéphane Klein

Stéphane Haussler

Stéphane Aubry

Stéphane Audière

 

Other publications of authors with the same name

Relative Similarity Logics are Decidable: Reduction to FO2 with Equality., and . JELIA, volume 1489 of Lecture Notes in Computer Science, page 279-293. Springer, (1998)Axiomatising Logics with Separating Conjunction and Modalities., , and . JELIA, volume 11468 of Lecture Notes in Computer Science, page 692-708. Springer, (2019)Counter Systems for Data Logics.. JELIA, volume 6341 of Lecture Notes in Computer Science, page 10. Springer, (2010)Model-Checking Bounded Multi-Pushdown Systems., and . CSR, volume 7913 of Lecture Notes in Computer Science, page 405-417. Springer, (2013)Reasoning About Transfinite Sequences., and . ATVA, volume 3707 of Lecture Notes in Computer Science, page 248-262. Springer, (2005)Model checking memoryful linear-time logics over one-counter automata., , and . Theor. Comput. Sci., 411 (22-24): 2298-2316 (2010)A polynomial space construction of tree-like models for logics with local chains of modal connectives.. Theor. Comput. Sci., 300 (1-3): 235-258 (2003)Model checking memoryful linear-time logics over one-counter automata, , and . CoRR, (2008)A Complete Axiomatisation for Quantifier-Free Separation Logic., , and . Log. Methods Comput. Sci., (2021)Internal proof calculi for modal logics with separating conjunction., , and . J. Log. Comput., 31 (3): 832-891 (2021)