|
[1]
|
Marius Bozga, Radu Iosif, and Yassine Lakhnech. Storeless semantics and
alias logic. In Proc. ACM SIGPLAN 2003 Workshop on Partial
Evaluation and Semantics Based Program Manipulation, pages 55 -
65. ACM Press, 2003.
[ bib ]
|
|
[2]
|
Marius Bozga and Radu Iosif. On model checking generic topologies. In Proc.
LICS-ICALP Workshop on Logics for Resources, Processes and Programs
(LRPP04), pages 73 - 87, 2004.
[ bib ]
|
|
[3]
|
Marius Bozga, Radu Iosif, and Yassine Lakhnech. On logics of aliasing.
In Proc. 11th Intl. Static Analysis Symposium (SAS04), pages
344 - 360. LNCS, Springer-Verlag, 2004.
[ bib ]
|
|
[4]
|
Marius Bozga and Radu Iosif. On decidability with the arithmetic with
addition and divisibility. In Proc. Foundations of Software
Science and Computation Structures (FOSSACS 2005), pages 425 -
439. LNCS, Springer-Verlag, 2005.
[ bib ]
|
|
[5]
|
Marius Bozga and Radu Iosif. Quantitative verification of programs with
lists. In Proc. NATO Workshop on Verification of Infinite-state
Systems with Applications to Security (VISSAS 2005). IOS Press,
2005.
[ bib ]
|
|
[6]
|
Peter Habermehl, Radu Iosif, and Tomas Vojnar. Automata-based
verification of programs with tree updates. In Proc. Tools and
Algorithms for the Construction and Analysis of Systems, 12th
International Conference (TACAS 2006), volume 3920, pages 350-364.
LNCS, Springer-Verlag, 2006.
[ bib ]
|
|
[7]
|
Ahmed Bouajjani, Marius Bozga, Peter Habermehl, Radu Iosif, Tomas
Vojnar, and Pierre Moro. Programs with lists are counter automata. In Proc.
Computer Aided Verification (CAV 2006), volume 4144, pages
517-531. LNCS, Springer-Verlag, 2006.
[ bib ]
|
|
[8]
|
Marius Bozga, Radu Iosif, and Yassine Lakhnech. Flat parametric counter
automata. In Proc. Intl. Conference on Automata, Languages and
Programming (ICALP 2006), volume 4052, pages 577-588. LNCS,
Springer-Verlag, 2006.
[ bib ]
|
|
[9]
|
Ahmed Bouajjani, Peter Habermehl, Adam Rogalewicz, and Tomas Vojnar.
Abstract Regular Tree Model Checking of Complex Dynamic Data
Structures. In Proc. of Statis Analysis Symposium (SAS 2006),
volume 4134 of LNCS. Springer-Verlag, 2006.
[ bib ]
|
|
[10]
|
Marius Bozga and Radu Iosif. On flat programs with lists. In Proc.
Intl.Conference on Verification, Model Checking and Abstract
Interpretation (VMCAI 2007), volume 4349, pages 122-136. LNCS,
Springer-Verlag, 2007.
[ bib ]
|
|
[11]
|
Peter Habermehl, Radu Iosif, Adam Rogalewicz, and Tomas Vojnar. Proving
termination of tree manipulating programs. In Intl. Symposium on
Automated Technology for Verification and Analysis (ATVA 2007),
volume 4762 of LNCS, pages 145 - 161. Springer-Verlag, 2007.
[ bib ]
|
|
[12]
|
Marius Bozga, Radu Iosif, and Vassiliki Sfyrla. An efficient algorithm
for the computation of optimum paths in weighted graphs. In Proc.
Workshop on Mathematical and Engineering Methods in Computer Science
(MEMICS 2007), 2007.
[ bib ]
|
