Difference between revisions of "Recent publications"

From Numerical Transition Systems
Jump to: navigation, search
Line 3: Line 3:
 
==== Pending ====
 
==== Pending ====
  
* R. Iosif, A. Sangnier. How hard is it to verify flat affine counter systems with the finite monoid property ?  
+
* R. Iosif, A. Sangnier. How hard is it to verify flat affine counter systems with the finite monoid property ? [http://arxiv.org/abs/1605.05836 arXiv:1605.05836]
 
* A. Reynolds, R. Iosif and T. King. A Decision Procedure for Separation Logic in SMT [http://arxiv.org/abs/1603.06844 arXiv:1603.06844]
 
* A. Reynolds, R. Iosif and T. King. A Decision Procedure for Separation Logic in SMT [http://arxiv.org/abs/1603.06844 arXiv:1603.06844]
 
* M. Bozga, R. Iosif and F. Konecny. The Complexity of Reachability Problems for Flat Counter Machines with Periodic Loops [http://arxiv.org/abs/1307.5321 arXiv:1307.5321]
 
* M. Bozga, R. Iosif and F. Konecny. The Complexity of Reachability Problems for Flat Counter Machines with Periodic Loops [http://arxiv.org/abs/1307.5321 arXiv:1307.5321]

Revision as of 09:51, 20 May 2016

Newspapers-stacked.jpg

Pending

  • R. Iosif, A. Sangnier. How hard is it to verify flat affine counter systems with the finite monoid property ? arXiv:1605.05836
  • A. Reynolds, R. Iosif and T. King. A Decision Procedure for Separation Logic in SMT arXiv:1603.06844
  • M. Bozga, R. Iosif and F. Konecny. The Complexity of Reachability Problems for Flat Counter Machines with Periodic Loops arXiv:1307.5321

Journals

Conferences