Difference between revisions of "Recent publications"

From Numerical Transition Systems
Jump to: navigation, search
(Pending)
Line 3: Line 3:
 
==== Pending ====
 
==== Pending ====
  
* M. Echenim, R. Iosif and N. Peltier.  The Complexity of Prenex Separation Logic with One Selector [https://arxiv.org/abs/1804.03556 arXiv:1804.03556]
+
* M. Bozga, R. Iosif and J. Sifakis. Checking Deadlock-Freedom of Parametric Component-Based Systems [https://arxiv.org/abs/1805.10073 arXiv:1805.10073]
 +
* M. Echenim, R. Iosif and N. Peltier.  The Complexity of Prenex Separation Logic with One Selector [https://arxiv.org/abs/1804.03556 arXiv:1804.03556]
 
* M. Echenim, R. Iosif and N. Peltier. On the Expressive Completeness of Bernays-Schönfinkel-Ramsey Separation Logic [https://arxiv.org/abs/1802.00195 arXiv:1802.00195]
 
* M. Echenim, R. Iosif and N. Peltier. On the Expressive Completeness of Bernays-Schönfinkel-Ramsey Separation Logic [https://arxiv.org/abs/1802.00195 arXiv:1802.00195]
 
* R. Iosif and C. Serban. Complete Cyclic Proof Systems for Inductive Entailments [https://arxiv.org/abs/1707.02415 arXiv:1707.02415]
 
* R. Iosif and C. Serban. Complete Cyclic Proof Systems for Inductive Entailments [https://arxiv.org/abs/1707.02415 arXiv:1707.02415]

Revision as of 15:14, 28 May 2018

Newspapers-stacked.jpg

Pending

  • M. Bozga, R. Iosif and J. Sifakis. Checking Deadlock-Freedom of Parametric Component-Based Systems arXiv:1805.10073
  • M. Echenim, R. Iosif and N. Peltier. The Complexity of Prenex Separation Logic with One Selector arXiv:1804.03556
  • M. Echenim, R. Iosif and N. Peltier. On the Expressive Completeness of Bernays-Schönfinkel-Ramsey Separation Logic arXiv:1802.00195
  • R. Iosif and C. Serban. Complete Cyclic Proof Systems for Inductive Entailments arXiv:1707.02415
  • M. Bozga, R. Iosif and F. Konecny. The Complexity of Reachability Problems for Flat Counter Machines with Periodic Loops arXiv:1307.5321

Journals

Conferences