Difference between revisions of "Recent publications"

From Numerical Transition Systems
Jump to: navigation, search
 
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. Unifying Decidable Entailments in Separation Logic with Inductive
+
* M. Echenim, R. Iosif, N. Peltier. Unifying Decidable Entailments in Separation Logic with Inductive Definitions [https://arxiv.org/abs/2012.14361 arXiv:2012.14361]
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]

Latest revision as of 11: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