Difference between revisions of "Recent publications"

From Numerical Transition Systems
Jump to: navigation, search
Line 14: Line 14:
 
==== Journals ====
 
==== Journals ====
  
* M. Echenim, R. Iosif and N. Peltier. [[https://hal.archives-ouvertes.fr/hal-02388326 The Bernays-Schoenfinkel-Ramsey Class of Separation Logic with Uninterpreted Predicates]]. ACM Transactions on Computational Logic (TOCL) 2020
+
* M. Echenim, R. Iosif and N. Peltier. [[https://hal.archives-ouvertes.fr/hal-02388326 The Bernays-Schoenfinkel-Ramsey Class of Separation Logic with Uninterpreted Predicates]]. ACM Transactions on Computational Logic (TOCL) 2020
 
* L. Holik, R. Iosif, A. Rogalewicz and T. Vojnar. [[https://hal.archives-ouvertes.fr/hal-02388322 Abstraction Refinement and Antichains for Trace Inclusion of Infinite State Systems]]. Formal Methods in System Design (FMSD) 2020
 
* L. Holik, R. Iosif, A. Rogalewicz and T. Vojnar. [[https://hal.archives-ouvertes.fr/hal-02388322 Abstraction Refinement and Antichains for Trace Inclusion of Infinite State Systems]]. Formal Methods in System Design (FMSD) 2020
 
* P. Ganty, R. Iosif and F. Konecny. [http://link.springer.com/article/10.1007%2Fs10009-016-0420-7 Underapproximation of Procedure Summaries for Integer Programs] Software Tools for Technology Transfer, pp 1-20 [[http://arxiv.org/abs/1210.4289 arXiv:1210.4289]]
 
* P. Ganty, R. Iosif and F. Konecny. [http://link.springer.com/article/10.1007%2Fs10009-016-0420-7 Underapproximation of Procedure Summaries for Integer Programs] Software Tools for Technology Transfer, pp 1-20 [[http://arxiv.org/abs/1210.4289 arXiv:1210.4289]]
Line 30: Line 30:
 
==== Conferences ====
 
==== Conferences ====
  
Marius Bozga, Radu Iosif, Joseph Sifakis. [[Media: Checking Deadlock-Freedom of Parametric Component-Based Systems]]. Tools and Algorithms for the Construction and Analysis of Systems - 25th International Conference (TACAS 2019), Part II, pp 3-20
+
* M. Bozga, R. Iosif and J. Sifakis. [[Media: Checking Deadlock-Freedom of Parametric Component-Based Systems]]. Tools and Algorithms for the Construction and Analysis of Systems - 25th International Conference (TACAS 2019), Part II, pp 3-20
* Radu Iosif, Cristina Serban. [[Media A Complete Cyclic Proof System for Inductive Entailments in First Order Logic]], 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR 2018), pp 435--453
+
* R. Iosif and C. Serban. [[Media: A Complete Cyclic Proof System for Inductive Entailments in First Order Logic]], 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR 2018), pp 435--453
 
* R. Iosif and X. Xu. [[Media:Tacas2018.pdf|Abstraction Refinement for Emptiness Checking of Alternating Data Automata]] TACAS 2018, pp 93-111
 
* R. Iosif and X. Xu. [[Media:Tacas2018.pdf|Abstraction Refinement for Emptiness Checking of Alternating Data Automata]] TACAS 2018, pp 93-111
 
* A. Reynolds, R. Iosif and C. Serban. [[Media:Vmcai2017.pdf|Reasoning in the Bernays-Schoenfinkel-Ramsey Fragment of Separation Logic]] VMCAI 2017, pp 462-482
 
* A. Reynolds, R. Iosif and C. Serban. [[Media:Vmcai2017.pdf|Reasoning in the Bernays-Schoenfinkel-Ramsey Fragment of Separation Logic]] VMCAI 2017, pp 462-482

Revision as of 09:03, 28 January 2020

Newspapers-stacked.jpg

Pending

  • M. Bozga, R. Iosif and J. Sifakis. Local Reasoning about Parametric and Reconfigurable Component-based Systems. arXiv:1908.11345
  • M. Bozga, R. Iosif and J. Sifakis. Structural Invariants for Parametric Verification of Systems with Almost Linear Architectures. arXiv:1902.02696
  • R. Iosif and X. Xu. First Order Alternation. arXiv:1811.02398
  • 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