Difference between revisions of "Recent publications"

From Numerical Transition Systems
Jump to: navigation, search
(3 intermediate revisions by the same user not shown)
Line 4: Line 4:
  
 
* M. Echenim, R. Iosif, N. Peltier. Entailment is Undecidable for Symbolic Heap Separation Logic Formulae with Non-Established Inductive Rules [https://hal.archives-ouvertes.fr/hal-02951859 hal-02951859]
 
* M. Echenim, R. Iosif, N. Peltier. Entailment is Undecidable for Symbolic Heap Separation Logic Formulae with Non-Established Inductive Rules [https://hal.archives-ouvertes.fr/hal-02951859 hal-02951859]
* M. Echenim, R. Iosif, N. Peltier. Checking Entailment Between Separation Logic Symbolic Heaps: Beyond Connected and Established Systems [https://arxiv.org/abs/2012.14361 arXiv:2012.14361]
+
* M. Echenim, R. Iosif, N. Peltier. Unifying Decidable Entailments in Separation Logic with Inductive Definitions [https://arxiv.org/abs/2012.14361 arXiv:2012.14361]
 
* M. Bozga, R. Iosif. Verifying Safety Properties of Inductively Defined Parameterized Systems. [https://arxiv.org/abs/2008.04160  arXiv:2008.04160]
 
* M. Bozga, R. Iosif. Verifying Safety Properties of Inductively Defined Parameterized Systems. [https://arxiv.org/abs/2008.04160  arXiv:2008.04160]
 
* M. Bozga, R. Iosif and J. Sifakis. Local Reasoning about Parametric and Reconfigurable Component-based Systems. [https://arxiv.org/abs/1908.11345 arXiv:1908.11345]
 
* M. Bozga, R. Iosif and J. Sifakis. Local Reasoning about Parametric and Reconfigurable Component-based Systems. [https://arxiv.org/abs/1908.11345 arXiv:1908.11345]
Line 28: Line 28:
 
==== Conferences ====
 
==== Conferences ====
  
* M. Echenim, R. Iosif, N. Peltier. [https://drops.dagstuhl.de/opus/volltexte/2021/13454/ Decidable Entailments in Separation Logic with Inductive Definitions: Beyond Established Systems.] CSL 2021: 1-18
+
* M. Echenim, R. Iosif, N. Peltier. [https://drops.dagstuhl.de/opus/volltexte/2021/13454/ Decidable Entailments in Separation Logic with Inductive Definitions: Beyond Established Systems.] CSL 2021, pp 1--18
* M. Echenim, R. Iosif, N. Peltier. [https://easychair.org/publications/paper/DdNg Entailment Checking in Separation Logic with Inductive Definitions is 2-EXPTIME hard.] LPAR 2020 191-211
+
* M. Echenim, R. Iosif, N. Peltier. [https://easychair.org/publications/paper/DdNg Entailment Checking in Separation Logic with Inductive Definitions is 2-EXPTIME hard.] LPAR 2020, pp 191--211
* M. Bozga, J. Esparza, R. Iosif, J. Sifakis and C. Welzel. [https://arxiv.org/abs/2002.07672 Structural Invariants for the Verification of Systems with Parameterized Architectures.] TACAS (1) 2020: 228-246
+
* M. Bozga, J. Esparza, R. Iosif, J. Sifakis and C. Welzel. [https://arxiv.org/abs/2002.07672 Structural Invariants for the Verification of Systems with Parameterized Architectures.] TACAS (1) 2020, pp 228--246
 
* R. Iosif and X. Xu. [[Media:Cav2019.pdf|Alternating Automata Modulo First Order Theories]], CAV 2019, Part II, pp 43--63
 
* R. Iosif and X. Xu. [[Media:Cav2019.pdf|Alternating Automata Modulo First Order Theories]], CAV 2019, Part II, pp 43--63
 
* M. Echenim, R. Iosif and N. Peltier. [[Media:Fossacs2019.pdf|The Bernays-Schoenfinkel-Ramsey Class of Separation Logic on Arbitrary Domains]], FOSSACS 2019, pp 242--259
 
* M. Echenim, R. Iosif and N. Peltier. [[Media:Fossacs2019.pdf|The Bernays-Schoenfinkel-Ramsey Class of Separation Logic on Arbitrary Domains]], FOSSACS 2019, pp 242--259

Revision as of 10:37, 16 February 2021

Newspapers-stacked.jpg

Pending

  • M. Echenim, R. Iosif, N. Peltier. Entailment is Undecidable for Symbolic Heap Separation Logic Formulae with Non-Established Inductive Rules hal-02951859
  • M. Echenim, R. Iosif, N. Peltier. Unifying Decidable Entailments in Separation Logic with Inductive Definitions arXiv:2012.14361
  • M. Bozga, R. Iosif. Verifying Safety Properties of Inductively Defined Parameterized Systems. arXiv:2008.04160
  • M. Bozga, R. Iosif and J. Sifakis. Local Reasoning about Parametric and Reconfigurable Component-based Systems. arXiv:1908.11345
  • M. Bozga, R. Iosif and F. Konecny. The Complexity of Reachability Problems for Flat Counter Machines with Periodic Loops arXiv:1307.5321

Journals

Conferences