Bibliography

AJMd02

Parosh Aziz Abdulla, Bengt Jonsson, Pritha Mahata, and Julien d'Orso.
Regular tree model checking.
In Proc. Int. Conf. on Computer Aided Verification (CAV'02), volume 2404 of Lecture Notes in Computer Science, 2002.
postscript

AJNd02

Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, and Julien d'Orso.
Regular model checking made simple and efficient.
In Proc. Int. Conf. on Concurrency Theory (CONCUR'02), volume 2421 of Lecture Notes in Computer Science, 2002.
postscript

AMN02

P. A. Abdulla, P. Mahata, and A. Nylén.
Downward closed language generators.
Technical report, Uppsala University, Sweden, 2002.
postscript

AN02

P. A. Abdulla and A. Nylén.
Undecidability of ltl for timed petri nets.
In Proceedings of 4th International Workshop on Verification of Infinite-State Systems, 2002.
postscript

BET03

Ahmed Bouajjani, Javier Esparza, and Tayssir Touili.
A Generic Approach to the Static Analysis of Concurrent Programs with Procedures.
In 30th Symp. on Principles of Programming Languages (POPL'03), New Orleans, USA, January 2003. ACM.
postscript

BGM02

M. Bozga, S. Graf, and L. Mounier.
IF-2.0: A Validation Environment for Component-Based Real-Time Systems.
In K.G. Larsen Ed Brinksma, editor, Proceedings of CAV'02 (Copenhagen, Denmark), volume 2404 of LNCS, pages 343-348. Springer, July 2002.
postscript

BLP02

L. Bozga, Y. Lakhnech, and M. Périn.
Pattern-based Abstraction for Verifying Secrecy in Protocols.
Technical report, Verimag, University of Grenoble, 2002.
postscript

BM02

Ahmed Bouajjani and Agathe Merceron.
Parametric Verification of a Group Membership Algorithm.
In 7th Intern. Symp. on Formal Techniques in Real-Time and Fault Tolerant Systems (FTRTFT'02), Oldenburg, Germany, September 2002. Lecture Notes in Computer Science, Springer.
postscript

BT02

Ahmed Bouajjani and Tayssir Touili.
Extrapolating Tree Transformations.
In Proc. Int. Conf. on Computer Aided Verification (CAV'02), volume 2404 of Lecture Notes in Computer Science, 2002.
postscript

KPSZ02

Y. Kesten, A. Pnueli, E. Shahar, and L. Zuck.
Network invariants in action.
In Proc. Int. Conf. on Concurrency Theory (CONCUR'02), volume 2421 of Lecture Notes in Computer Science, 2002.
postscript

KPV02a

O. Kupferman, N. Piterman, and M. Vardi.
Model checking linear properties of prefix-recognizable systems.
In Proceedings of 14th International Conference on Computer-Aided Verification, 2002.
postscript

KPV02b

O. Kupferman, N. Piterman, and M. Vardi.
Pushdown specifications.
In Proceedings of 9th International Conference on Logic for Programming Artificial Inteligence and Reasoning, 2002.
postscript

PXZ02

A. Pnueli, J. Xu, and L. Zuck.
Liveness with (0,1,infinity)-counter abstraction.
In Proc. Int. Conf. on Computer Aided Verification (CAV'02), volume 2404 of Lecture Notes in Computer Science, 2002.
postscript

ZPK03

L. Zuck, A. Pnueli, and Y. Kesten.
Automatic verification of free choice.
In 3th Intern. Workshop on Verification, Model Checking, and Abstract Interpretation, Lecture Notes in Computer Science, 2003.
postscript