Difference between revisions of "Recent publications"

From Numerical Transition Systems
Jump to: navigation, search
Line 3: Line 3:
 
==== Pending ====
 
==== Pending ====
  
* A. Reynolds, R. Iosif and C. Serban. Reasoning in the Bernays-Schoenfinkel-Ramsey Fragment of Separation Logic [https://arxiv.org/abs/1610.04707 arXiv:1610.04707]
 
 
* 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]
  
Line 22: Line 21:
 
==== Conferences ====
 
==== Conferences ====
  
* R. Iosif, A. Sangnier. [[Media:Atva2016-1.pdf|How hard is it to verify flat affine counter systems with the finite monoid property ?]] ATVA 2016, to appear
+
* A. Reynolds, R. Iosif and C. Serban. [[Reasoning in the Bernays-Schoenfinkel-Ramsey Fragment of Separation Logic]] VMCAI 2017, to appear
* A. Reynolds, R. Iosif and T. King. [[Media:Atva2016-2.pdf|A Decision Procedure for Separation Logic in SMT]] ATVA 2016, to appear
+
* R. Iosif, A. Sangnier. [[Media:Atva2016-1.pdf|How hard is it to verify flat affine counter systems with the finite monoid property ?]] ATVA 2016, pp 89-105
 +
* A. Reynolds, R. Iosif and T. King. [[Media:Atva2016-2.pdf|A Decision Procedure for Separation Logic in SMT]] ATVA 2016, pp 244-261
 
* R. Iosif, A. Rogalewicz and T. Vojnar. [http://arxiv.org/pdf/1410.5056.pdf Abstraction Refinement and Antichains for Trace Inclusion of Infinite State Systems] TACAS 2016 pp 71-89
 
* R. Iosif, A. Rogalewicz and T. Vojnar. [http://arxiv.org/pdf/1410.5056.pdf Abstraction Refinement and Antichains for Trace Inclusion of Infinite State Systems] TACAS 2016 pp 71-89
 
* P. Ganty and R. Iosif. [http://arxiv.org/abs/1405.3069 Interprocedural Reachability for Flat Integer Programs] FCT 2015, pp 133-145.  
 
* P. Ganty and R. Iosif. [http://arxiv.org/abs/1405.3069 Interprocedural Reachability for Flat Integer Programs] FCT 2015, pp 133-145.  

Revision as of 11:41, 23 November 2016

Newspapers-stacked.jpg

Pending

  • M. Bozga, R. Iosif and F. Konecny. The Complexity of Reachability Problems for Flat Counter Machines with Periodic Loops arXiv:1307.5321

Journals

Conferences