| [1] |
Kshitij Bansal, Rémi Brochenin, and Étienne Lozes.
Beyond shapes: Lists with ordered data.
In Proceeedings of the 12th International Conference on
Foundations of Software Science and Computational Structures (FoSSACS'09),
volume 5504 of Lecture Notes in Computer Science, pages 425-439.
Springer, 2009. [ bib ] |
| [2] |
Ahmed Bouajjani, Cezara Dragoi, Constantin Enea, and Mihaela Sighireanu.
A logic-based framework for reasoning about composite data
structures.
In Proceedings of the 20th International Conference on
Concurrency Theory (CONCUR'09), volume 5710 of Lecture Notes in
Computer Science, pages 178-195. Springer, 2009. [ bib ] |
| [3] |
Marius Bozga, Codruta Gîrlea, and Radu Iosif.
Iterating octagons.
In Proceeedings of the 15th International Conference on Tools
and Algorithms for the Construction and Analysis of Systems (TACAS'09),
volume 5505 of Lecture Notes in Computer Science, pages 337-351.
Springer, 2009. [ bib ] |
| [4] |
Marius Bozga, Radu Iosif, and Yassine Lakhnech.
Flat parametric counter automata.
Fundamenta Informaticae, 91(2):275-303, 2009. [ bib ] |
| [5] |
Marius Bozga, Peter Habermehl, Radu Iosif, Filip Konecny, and Tomás
Vojnar.
Automatic verification of integer array programs.
In Proceedings of the 21st International Conference on Computer
Aided Verification (CAV'09), volume 5643 of Lecture Notes in Computer
Science, pages 157-172. Springer, 2009. [ bib ] |
| [6] |
Rémi Brochenin, Stéphane Demri, and Étienne Lozes.
Reasoning about sequences of memory states.
Annals of Pure and Applied Logics, 2009.
To appear. [ bib ] |
| [7] |
Peter Habermehl, Radu Iosif, and Tomáš Vojnar.
Automata-based verification of programs with tree updates.
Acta Informatica, 2009.
To appear. [ bib ] |
| [8] |
Radu Iosif and Adam Rogalewicz.
Automata-based termination proofs.
In Proceedings of the 14th International Conference on
Implementation and Application of Automata, volume 5642 of Lecture
Notes in Computer Science, pages 165-177. Springer, 2009. [ bib ] |
| [9] |
Parosh Aziz Abdulla, Ahmed Bouajjani, Jonathan Cederberg, Frédéric
Haziza, and Ahmed Rezine.
Monotonic abstraction for programs with dynamic memory heaps.
In Proceedings of the 20th International Conference on
Computer Aided Verification (CAV'08), volume 5123 of Lecture
Notes in Computer Science, pages 341-354. Springer, 2008. [ bib ] |
| [10] |
Rémi Brochenin, Stéphane Demri, and Étienne Lozes.
On the almighty wand.
In Proceedings of the 16th Annual EACSL Conference on
Computer Science Logic (CSL'08), volume 5213 of Lecture Notes
in Computer Science, pages 323-338. Springer, 2008. [ bib ] |
| [11] |
Marius Bozga, Radu Iosif, and Swann Perarnau.
Quantitative separation logic and programs with lists.
In Proceedings of the 4th International Joint Conference on
Automated Reasoning (IJCAR'08), volume 5195 of Lecture Notes in
Computer Science, pages 34-49. Springer, 2008. [ bib ] |
| [12] |
Peter Habermehl, Radu Iosif, and Tomás Vojnar.
What else is decidable about integer arrays?
In Proceedings of the 11th International Conference on
Foundations of Software Science and Computational Structures (FoSSACS'08,
volume 4962 of Lecture Notes in Computer Science, pages 474-489.
Springer, 2008. [ bib ] |
| [13] |
Peter Habermehl, Radu Iosif, and Tomás Vojnar.
A logic of singly indexed arrays.
In Proceedings of the 15th International Conference on Logic for
Programming, Artificial Intelligence and Reasonning (LPAR'08), volume 5330
of Lecture Notes in Artificial Intelligence, pages 558-573. Springer,
2008. [ bib ] |
| [14] |
A. Sangnier.
Vérification de systèmes avec compteurs et pointeurs.
Thèse de doctorat, LSV, ENS Cachan, France, 2008. [ bib ] |
| [15] |
R. Brochenin, S. Demri, and E. Lozes.
Reasoning about sequences of memory states.
In Proceedings of the International Symposium on Logical
Foundations of Computer Science (LFCS'07), volume 3634 of
Lecture Notes in Computer Science, pages 100-114. Springer, 2007. [ bib ] |
| [16] |
Ahmed Bouajjani, Peter Habermehl, Yan Jurski, and Mihaela Sighireanu.
Rewriting Systems with Data - A Framework for Reasoning About
Systems with Unbounded Structures over Infinite Data Domains.
In Proceedings of the 16th International Symposium on
Fundamentals of Computation Theory (FCT'07), volume 4639 of
Lecture Notes in Computer Science, pages 1-22. Springer, 2007.
invited paper. [ bib ] |
| [17] |
Ahmed Bouajjani, Severine Fratani, and Shaz Qadeer.
Context-bounded analysis of multithreaded programs with dynamic
linked structures.
In Proceedings of the 19th International Conference on
Computer Aided Verification (CAV'07), volume 4590 of Lecture
Notes in Computer Science, pages 207-220, Berlin, Germany, 2007. Springer. [ bib ] |
| [18] |
M. Bozga and R. Iosif.
On flat programs with lists.
In Proceedings of the 8th International Conference on
Verification, Model Checking, and Abstract Interpretation (VMCAI'07), volume
4349 of Lecture Notes in Computer Science, pages 122-136. Springer,
2007. [ bib ] |
| [19] |
Alain Finkel, Étienne Lozes, and Arnaud Sangnier.
Towards model checking pointer systems.
In Proceedings of the 1st International Conference on Infinity
in Logic & Computation (ILC'07), 2007. [ bib ] |
| [20] |
Peter Habermehl, Radu Iosif, Adam Rogalewicz, and Tomáš Vojnar.
Proving Termination of Tree Manipulating Programs.
In Proceedings of the 5th International Symposium on
Automated Technology for Verification and Analysis (ATVA'07),
volume 4762 of Lecture Notes in Computer Science, pages 145-161.
Springer, 2007. [ bib ] |
| [21] |
M. Bozga, R. Iosif, and Y. Lakhnech.
Flat parametric counter automata.
In Proceedings of the 33rd International Colloquium on
Automata, Languages and Programming (ICALP'06), volume 4052 of
Lecture Notes in Computer Science, pages 577-588. Springer, July 2006. [ bib ] |
| [22] |
Sébastien Bardin, Alain Finkel, Étienne Lozes, and Arnaud Sangnier.
From pointer systems to counter systems using shape analysis.
In Proceedings of the 5th International Workshop on
Automated Verification of Infinite-State Systems (AVIS'06),
2006. [ bib ] |
| [23] |
Ahmed Bouajjani, Marius Bozga, Peter Habermehl, Radu Iosif, Pierre Moro, and
Tomáš Vojnar.
Programs with lists are counter automata.
In Proceedings of the 18th International Conference on
Computer Aided Verification (CAV'06), volume 4144 of Lecture
Notes in Computer Science, pages 517-531. Springer, 2006. [ bib ] |
| [24] |
Ahmed Bouajjani, Peter Habermehl, Adam Rogalewicz, and Tomáš Vojnar.
Abstract regular tree model checking of complex dynamic data
structures.
In Proceedings of the 13th International Symposium
Static Analysis (SAS'06), volume 4134 of Lecture Notes in
Computer Science, pages 52-70. Springer, 2006. [ bib ] |
| [25] |
Peter Habermehl, Radu Iosif, and Tomáš Vojnar.
Automata-based verification of programs with tree updates.
In Proceedings of the 12th International Conference on
Tools and Algorithms for Construction and Analysis of Systems
(TACAS'06), volume 3920 of Lecture Notes in Computer Science, pages
350-364. Springer, 2006. [ bib ] |
| [26] |
Ahmed Bouajjani, Peter Habermehl, Adam Rogalewicz, and Tomáš Vojnar.
Abstract regular tree model checking.
149(1):37-48, 2006. [ bib ] |
This file has been generated by bibtex2html 1.78