Monotonic abstraction (on efficient verification of parameterized systems)

International Journal of Foundations of Computer Science

Volumn 20, Issue 5, 2009, Pages 779-801

  Abdulla, Parosh Aziz ^a   Delzanno, Giorgio ^b   Henda, Noomene Ben ^a   Rezine, Ahmed ^c  

^a UPPSALA UNIVERSITY   (Sweden)

^b UNIVERSITY OF GENOA   (Italy)

^c UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 70349558521     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054109006887     Document Type: Conference Paper

References (36)

1. P. A. Abdulla, K. Cerfians, B. Jonsson, and Y.-K. Tsay. General decidability theorems for in nite-state systems. In Proc. LICS '96, 11th IEEE Int. Symp. on Logic in Computer Science, pages 313-321, 1996.
2. P. A. Abdulla, G. Delzanno, F. Haziza, and A. Rezine. Parameterized tree systems. In Proc. FORTE '08, 28st International Conference on Formal Techniques for Net- worked and Distributed Systems, volume 5049 of Lecture Notes in Computer Science, pages 69-83. Springer Verlag, 2008.
3. P. A. Abdulla, G. Delzanno, and A. Rezine. Parameterized verification of infinite- state processes with global conditions. In Proc. 19th Int. Conf. on Computer Aided verification, volume 4590 of Lecture Notes in Computer Science, pages 145-157, 2007.
4. P. A. Abdulla, N. B. Henda, G. Delzanno, and A. Rezine. Regular model checking without transducers (on eficient verification of parameterized systems). In Proc. TACAS '07, 13th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems, volume 4424 of Lecture Notes in Computer Science, pages 721-736. Springer Verlag, 2007.
5. P. A. Abdulla, N. B. Henda, G. Delzanno, and A. Rezine. Handling parameterized systems with non-atomic global conditions. In Proc. VMCAI '08, 9th Int. Conf. on verification, Model Checking, and Abstract Interpretation, 2008.
6. P. A. Abdulla, B. Jonsson, M. Nilsson, and J. d'Orso. Regular model checking made simple and eficient. In Proc. CONCUR 2002, 13th Int. Conf. on Concurrency Theory, volume 2421 of Lecture Notes in Computer Science, pages 116-130, 2002.
7. O. Agesen, D. Detlefs, A. Garthwaite, R. Knippel, Y. S. Ramakrishna, and D. White. An eficient meta-lock for implementing ubiquitous synchronization. In OOPSLA 1999, pages 207-222, 1999.
8. T. Arons, A. Pnueli, S. Ruah, J. Xu, and L. Zuck. Parameterized verification with automatically computed inductive assertions. In Berry, Comon, and Finkel, editors, Proc. 13th Int. Conf. on Computer Aided verification, volume 2102 of Lecture Notes in Computer Science, pages 221-234, 2001.
9. K. Baukus, Y. Lakhnech, and K. Stahl. Parameterized verification of a cache coherence protocol: Safety and liveness. In Proc. VMCAI 2002, pages 317-330, 2002.
10. B. Boigelot, A. Legay, and P. Wolper. Iterating transducers in the large. In Proc. 15th Int. Conf. on Computer Aided verification, volume 2725 of Lecture Notes in Computer Science, pages 223-235, 2003.
11. A. Bouajjani, P. Habermehl, and T. Vojnar. Abstract regular model checking. In CAV04, Lecture Notes in Computer Science, pages 372-386, Boston, July 2004. Springer Verlag.
12. E. Clarke, M. Talupur, and H. Veith. Environment abstraction for parameterized verification. In Proc. VMCAI '06, 7th Int. Conf. on verification, Model Checking, and Abstract Interpretation, volume 3855 of Lecture Notes in Computer Science, pages 126-141, 2006.
13. D. Dams, Y. Lakhnech, and M. Stefen. Iterating transducers. In G. Berry, H. Comon, and A. Finkel, editors, Computer Aided verification, volume 2102 of Lecture Notes in Computer Science, 2001.
14. G. Delzanno. Automatic verification of cache coherence protocols. In Emerson and Sistla, editors, Proc. 12th Int. Conf. on Computer Aided verification, volume 1855 of Lecture Notes in Computer Science, pages 53-68. Springer Verlag, 2000.
15. G. Delzanno. verification of consistency protocols via in nite-state symbolic model checking. In Proc. FORTE/PSTV 2000, pages 171-186, 2000.
16. E. Emerson and V. Kahlon. Exact and eficient verification of parameterized cache coherence protocols. In CHARME 2003, pages 247-262, 2003.
17. E. Emerson and V. Kahlon. Model checking guarded protocols. In Proc. LICS '03, 19th IEEE Int. Symp. on Logic in Computer Science, Lecture Notes in Computer Science, 2003.
18. J. Esparza, A. Finkel, and R. Mayr. On the verification of broadcast protocols. In Proc. LICS '99, 14th IEEE Int. Symp. on Logic in Computer Science, 1999.
19. S. German. Personal communication, 2007.
20. S. M. German and A. P. Sistla. Reasoning about systems with many processes. Journal of the ACM, 39(3):675-735, 1992.
21. P. Godefroid and P. Wolper. Using partial orders for the eficient verification of dead- lock freedom and safety properties. Formal Methods in System Design, 2(2):149-164, 1993.
22. G. Higman. Ordering by divisibility in abstract algebras. Proc. London Math. Soc. (3), 2(7):326-336, 1952.
23. P. Kelb, T. Margaria, M. Mendler, and C. Gsottberger. MOSEL: A exible toolset for monadic second-order logic. In Proc. TACAS '97, 3th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems, volume 1217, pages 183- 202. Lecture Notes in Computer Science, 1997.
24. Y. Kesten, O. Maler, M. Marcus, A. Pnueli, and E. Shahar. Symbolic model checking with rich assertional languages. Theoretical Computer Science, 256:93-112, 2001.
25. S. K. Lahiri and R. E. Bryant. Indexed predicate discovery for unbounded system verification. In CAV 2004, pages 135-147, 2004.
26. A. Lisitsa, A. P. Nemytykh, Reachability analysis in verification via supercompilation, Int. J. Found. Comput. Sci. 19 (4) (2008) 953-969.
27. M. Maidl. A unifying model checking approach for safety properties of parameterized systems. In Berry, Comon, and Finkel, editors, Proc. 13th Int. Conf. on Computer Aided verification, volume 2102 of Lecture Notes in Computer Science, pages 324-336, 2001.
28. R. Mayr. Undecidable problems in unreliable computations. Theoretical Computer Science, 297:347-354, 2003.
29. M. L. Minsky, Computation: nite and in nite machines, Prentice-Hall, Inc., Upper Saddle River, NJ, USA, 1967.
30. K. Reinhardt, Reachability in petri nets with inhibitor arcs, Electron. Notes Theor. Comput. Sci. 223 (2008) 239-264.
31. A. Pnueli, S. Ruah, and L. Zuck. Automatic deductive verification with invisible invariants. In Proc. TACAS '01, 7th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems, volume 2031, pages 82-97, 2001.
32. A. Pnueli, J. Xu, and L. Zuck. Liveness with (0,1,in nity)-counter abstraction. In Proc. 14th Int. Conf. on Computer Aided verification, volume 2404 of Lecture Notes in Computer Science, 2002.
33. A. Roychoudhury and I. Ramakrishnan. Automated inductive verification of param- eterized protocols. In Proc. 13th Int. Conf. on Computer Aided verification, volume 2102 of Lecture Notes in Computer Science, pages 25-37, 2001.
34. C. Topnik, E. Wilhelm, T. Margaria, and B. Ste en. jMosel: A Stand-Alone Tool and jABC Plugin for M2L(Str). In Model Checking Software: 13th International SPIN Workshop, volume 3925 of Lecture Notes in Computer Science, pages 293-298, 2006.
35. T. Touili. Regular Model Checking using Widening Techniques. Electronic Notes in Theoretical Computer Science, 50(4), 2001. Proc. Workshop on verification of Parametrized Systems (VEPAS'01), Crete, July, 2001.
36. M. Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proc. LICS '86, 1st IEEE Int. Symp. on Logic in Computer Science, pages 332-344, June 1986.