Liveness and acceleration in parameterized verification

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1855, Issue , 2000, Pages 328-343

  Pnueli, Amir ^a   Shahar, Elad ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Acceleration; Liveness; Parametric systems; Regular expressions; Symbolic model checking; WS1S

Indexed keywords

ACCELERATION; COMPUTER AIDED ANALYSIS; PARAMETERIZATION;

LIVENESS; PARAMETRIC SYSTEMS; REGULAR EXPRESSIONS; SYMBOLIC MODEL CHECKING; WS1S;

MODEL CHECKING;

EID: 35248874135     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10722167_26     Document Type: Conference Paper

References (21)

1. P.A. Abdulla, A. Bouajjani, and B. Jonsson. On-the-fly analysis of systems with unbounded, lossy FIFO channels. In A.J. Hu and M.Y. Vardi, editors, Proc. 10th Intl. Conference on Computer Aided Verification (CAV'98), volume 1427 of Lect. Notes in Comp. Sci., pages 305-318. Springer-Verlag, 1998.
2. P.A. Abdulla, A. Bouajjani, B. Jonsson, and M. Nilsson. Handling global conditions in parametrized system verification. In N. Halbwachs and D. Peled, editors, Proc. 11st Intl. Conference on Computer Aided Verification (CAV'99), volume 1633 of Lect. Notes in Comp. Sci., pages 134-145. Springer-Verlag, 1999
3. P.A. Abdulla and B. Jonsson. Verifying networks of timed processes. In B. Steffen, editor, 4th Intl. Conf. TACAS'98, volume 1384 of Lect. Notes in Comp. Sci., pages 298-312. Springer-Verlag, 1998.
4. K. R. Apt and D. Kozen. Limits for automatic program verification of finite -state concurrent systems. Information Processing Letters, 22(6), 1986.
5. J-P. Bodeveix and M. Filali. Experimenting acceleration methods for the validation of infinite state systems. In International Workshop on Distributed System Validation and Verification (DSVV'2000), Taipei, Taiwan, April 2000.
6. B. Boigelot and P. Godefroid. Symbolic verification of coomunication protocols with infinite state spaces using QDDs. In R. Alur and T. Henzinger, editors, Proc. 8th Intl. Conference on Computer Aided Verification (CAV'96), volume 1102 of Lect. Notes in Comp. Sci., pages 1-12. Springer-Verlag, 1996.
7. B. Boigelot, P. Godefroid, B. Willems, and P. Wolper. The power of QDDs. In Proc. of the Fourth International Static Analysis Symposium, Lect. Notes in Comp. Sci. Springer-Verlag, 1997.
8. A. Bouajjani and P. Habermehl. Symbolic reachability analysis of FIFOchannel systems with non-regular sets of configurations. In Proc. 24th Int. Colloq. Aut. Lang. Prog., volume 1256 of Lect. Notes in Comp. Sci. Springer-Verlag, 1997.
9. E.M. Clarke, O. Grumberg, and S. Jha. Verifying parametrized networks using abstraction and regular languages. In 6th International Conference on Concurrency Theory (CONCUR'95), pages 395-407, Philadelphia, PA, August 1995.
10. E.W. Dijkstra, W.H.J. Feijen, and A.J.M van Gasteren. Derivation of a termination detection algorithm for distributed computations. Info. Proc. Lett., 16(5):217-219, 1983.
11. E.P. Gribomont and G. Zenner. Automated verification of szymanski's algorithm. In B. Steffen, editor, 4th Intl. Conf. TACAS'98, volume 1384 of Lect. Notes in Comp. Sci., pages 424-438. Springer-Verlag, 1998.
12. J.G. Henriksen, J. Jensen, M. Jørgensen, N. Klarlund, B. Paige, T. Rauhe, and A. Sandholm. Mona: Monadic second-order logic in practice. In Tools and Algorithms for the Construction and Analysis of Systems, First International Workshop, TACAS '95, LNCS 1019, 1996. Also available through http://www.brics.dk/~klarlund/Mona/main.html.
13. E. Jensen and N.A. Lynch. A proof of burn's n-process mutual exclusion algorithm using abstraction. In B. Steffen, editor, 4th Intl. Conf. TACAS'98, volume 1384 of Lect. Notes in Comp. Sci., pages 409-423. Springer-Verlag, 1998.
14. B. Jonsson and M. Nilsson. Transitive closures of regular relations for verifying infinite -state systems. In S. Graf, editor, Proceedings of TACAS' 00, Lect. Notes in Comp. Sci., 2000. To Appear.
15. R.P. Kurshan and K. McMillan. A structural induction theorem for processes. In P. Rudnicki, editor, Proceedings of the 8th Annual Symposium on Principles of Distributed Computing, pages 239-248, Edmonton, AB, Canada, August 1989. ACM Press.
16. Y. Kesten, O. Maler, M. Marcus, A. Pnueli, and E. Shahar. Symbolic model checking with rich assertional languages. In O. Grumberg, editor, Proc. 9th Intl. Conference on Computer Aided Verification (CAV'97), Lect. Notes in Comp. Sci., pages 424-435. Springer-Verlag, 1997.
17. Z. Manna, A. Anuchitanukul, N. Bjørner, A. Browne, E. Chang, M. Colón, L. De Alfaro, H. Devarajan, H. Sipma, and T.E. Uribe. STeP: The Stanford Temporal Prover. Technical Report STAN-CS-TR-94-1518, Dept. of Comp. Sci., Stanford University, Stanford, California, 1994.
18. Z. Manna and A. Pnueli. An exercise in the verification of multiprocess programs. In W.H.J. Feijen, A.J.M van Gasteren, D. Gries, and J. Misra, editors, Beauty is Our Business, pages 289-301. Springer-Verlag, 1990.
19. A.P. Sistla and S.M. German: Reasoning about systems with many processes. J. ACM, 39:675-735, 1992.
20. W. Thomas. Automata on infinite objects. Handbook of theoretical computer science, pages 165-191, 1990.
21. P. Wolper and V. Lovinfosse. Verifying properties of large sets of processes with network invariants. In J. Sifakis, editor, Automatic Verification Methods for Finite State Systems, volume 407 of Lect. Notes in Comp. Sci., pages 68-80. Springer-Verlag, 1989.