Difference between revisions of "Recent publications"

From Numerical Transition Systems
Jump to: navigation, search
(45 intermediate revisions by the same user not shown)
Line 3: Line 3:
 
==== Pending ====
 
==== Pending ====
  
 +
* Lucas Bueri, Radu Iosif and Florian Zuleger. Effective MSO-Definability for Tree-width Bounded Models of an Inductive Separation Logic of Relations [https://arxiv.org/abs/2402.16150 arXiv:2402.16150]
 +
* Mark Chimes, Radu Iosif and Florian Zuleger. Tree-Verifiable Graph Grammars. [https://arxiv.org/abs/2402.17015 arXiv:2402.17015]
 +
* M. Bozga, L. Bueri, R. Iosif and F. Zuleger. The Treewidth Boundedness Problem for an Inductive Separation Logic of Relations. [https://arxiv.org/abs/2310.09542 arXiv:2310.09542]
 +
* R. Iosif and F. Zuleger. Characterizations of Definable Context-Free Graphs. [https://arxiv.org/abs/2310.04764 arXiv:2310.04764]
 
* 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]
* M. Bozga, R. Iosif and J. Sifakis. Structural Invariants for Parametric Verification of Systems with Almost Linear Architectures. [https://arxiv.org/abs/1902.02696 arXiv:1902.02696]
 
* R. Iosif and X. Xu. First Order Alternation. [https://arxiv.org/abs/1811.02398 arXiv:1811.02398]
 
* 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]
 
* R. Iosif and C. Serban. Complete Cyclic Proof Systems for Inductive Entailments [https://arxiv.org/abs/1707.02415 arXiv:1707.02415]
 
 
* 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]
  
 
==== 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. Bozga, R. Iosif, J. Sifakis. [https://doi.org/10.1016/j.tcs.2022.10.022 Verification of component-based systems with recursive architectures]. Theoretical Computer Science (TCS) Volume 940 pp 146-175 (2023)
* 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
+
* M. Echenim, R. Iosif, N. Peltier. [https://www.sciencedirect.com/science/article/pii/S0020019021000843?dgcid=coauthor Entailment is Undecidable for Symbolic Heap Separation Logic Formulae with Non-Established Inductive Rules]. Information Processing Letters (IPL) Volume 173 (2022)
 +
* M. Bozga, R. Iosif and J. Sifakis. [https://www.sciencedirect.com/science/article/pii/S2352220820301061 Checking Deadlock Freedom of Parametric Component-based Systems]. Journal of Logical and Algebraic Methods in Programming (JLAMP) Volume 119 (2021)
 +
* 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) 21(3): 19:1-19:46 (2020)
 +
* L. Holik, R. Iosif, A. Rogalewicz and T. Vojnar. [https://doi.org/10.1007/s10703-020-00345-1 Abstraction Refinement and Antichains for Trace Inclusion of Infinite State Systems]. Formal Methods in System Design (FMSD)  
 
* 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]]
 
* M. Bozga, R. Iosif and F. Konecny. [http://arxiv.org/abs/1302.2762 Deciding Conditional Termination] Logical Methods in Computer Science, Vol. 10(3:8) 2014 pp 1-61
 
* M. Bozga, R. Iosif and F. Konecny. [http://arxiv.org/abs/1302.2762 Deciding Conditional Termination] Logical Methods in Computer Science, Vol. 10(3:8) 2014 pp 1-61
Line 30: Line 31:
 
==== Conferences ====
 
==== Conferences ====
  
 +
* Radu Iosif, Florian Zuleger. [https://drops.dagstuhl.de/opus/volltexte/2023/19014/ Expressiveness Results for an Inductive Logic of Separated Relations]. CONCUR 2023, pp 20:1-20:20
 +
* Marius Bozga, Lucas Bueri, Radu Iosif. [https://drops.dagstuhl.de/opus/volltexte/2022/17087/ On an Invariance Problem for Parameterized Concurrent Systems]. CONCUR 2022, pp 24:1-24:16
 +
* Marius Bozga, Lucas Bueri, Radu Iosif. [https://arxiv.org/abs/2202.09637 Decision Problems in a Logic for Reasoning about Reconfigurable Distributed Systems].  IJCAR 2022, pp 691-711
 +
* Emma Ahrens, Marius Bozga, Radu Iosif, Joost-Pieter Katoen. [https://dl.acm.org/doi/10.1145/3563293 Reasoning about Distributed Reconfigurable Systems]. OOPSLA 2022, pp 145–174
 +
* M. Bozga, R. Iosif. [[Media:Facs21.pdf|Verifying Safety Properties of Inductively Defined Parameterized Systems]]. FACS 2021, pp 95-114
 +
* M. Echenim, R. Iosif, N. Peltier. [[Media:CADE_2021_final_version.pdf|Unifying Decidable Entailments in Separation Logic with Inductive Definitions]]. CADE 2021, pp 183-199
 +
* M. Echenim, R. Iosif, N. Peltier. [https://drops.dagstuhl.de/opus/volltexte/2021/13454/ Decidable Entailments in Separation Logic with Inductive Definitions: Beyond Established Systems.] CSL 2021, pp 1--18
 +
* M. Echenim, R. Iosif, N. Peltier. [https://easychair.org/publications/paper/DdNg Entailment Checking in Separation Logic with Inductive Definitions is 2-EXPTIME hard.] LPAR 2020, pp 191--211
 +
* M. Bozga, J. Esparza, R. Iosif, J. Sifakis and C. Welzel. [https://arxiv.org/abs/2002.07672 Structural Invariants for the Verification of Systems with Parameterized Architectures.] TACAS (1) 2020, pp 228--246
 +
* R. Iosif and X. Xu. [[Media:Cav2019.pdf|Alternating Automata Modulo First Order Theories]], CAV 2019, Part II, pp 43--63
 +
* M. Echenim, R. Iosif and N. Peltier. [[Media:Fossacs2019.pdf|The Bernays-Schoenfinkel-Ramsey Class of Separation Logic on Arbitrary Domains]], FOSSACS 2019, pp 242--259
 
* M. Echenim, R. Iosif, N. Peltier. [[Media:Tableaux2019.pdf|Prenex Separation Logic with One Selector Field]]. TABLEAUX 2019, pp 409--427
 
* M. Echenim, R. Iosif, N. Peltier. [[Media:Tableaux2019.pdf|Prenex Separation Logic with One Selector Field]]. TABLEAUX 2019, pp 409--427
 
* M. Bozga, R. Iosif and J. Sifakis. [[Media:Tacas2019.pdf|Checking Deadlock-Freedom of Parametric Component-Based Systems]]. TACAS 2019, Part II, pp 3-20
 
* M. Bozga, R. Iosif and J. Sifakis. [[Media:Tacas2019.pdf|Checking Deadlock-Freedom of Parametric Component-Based Systems]]. TACAS 2019, Part II, pp 3-20

Revision as of 15:34, 28 February 2024

Newspapers-stacked.jpg

Pending

  • Lucas Bueri, Radu Iosif and Florian Zuleger. Effective MSO-Definability for Tree-width Bounded Models of an Inductive Separation Logic of Relations arXiv:2402.16150
  • Mark Chimes, Radu Iosif and Florian Zuleger. Tree-Verifiable Graph Grammars. arXiv:2402.17015
  • M. Bozga, L. Bueri, R. Iosif and F. Zuleger. The Treewidth Boundedness Problem for an Inductive Separation Logic of Relations. arXiv:2310.09542
  • R. Iosif and F. Zuleger. Characterizations of Definable Context-Free Graphs. arXiv:2310.04764
  • 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