Prix du meilleur article pour "The Tree Width of Separation Logic with Recursive Definitions" par Radu Iosif, Adam Rogalewicz, and Jirí Simácek, à CADE 2013 [1].
Browsing
News
Seminars
- Seminars
- 12 November 2026 David Monniaux: The existence of polyhedral invariants is undecidable for linear systems
- 19 November 2026 Clement Chavanon: Barocq: a high-level programming language for efficient and verifiable embedded system (…)
- 26 November 2026 Basile Gros: Proxy-based small inversions for the rocq prover (Phd)
New publications
- Some Recent Publications
- Marius Bozga, Radu Iosif, Florian Zuleger: Iterating Non-Aggregative Structure Compositions
- Oussama Oulkaid, Bruno Ferres, Matthieu Moy, Pascal Raymond, Mehdi Khosravian: Modeling Techniques for the Formal Verification of Integrated Circuits at Transistor-Level: Performance vs. Precision Trade-offs
- Marius Bozga, Radu Iosif, Florian Zuleger: Regular Grammars for Sets of Graphs of Tree-Width 2
- Marius Bozga, Radu Iosif, Arnaud Sangnier, Neven Villani: Counting Abstraction and Decidability for the Verification of Structured Parameterized Networks
