Parametric verification of a group membership algorithm

Theory and Practice of Logic Programming

Volumn 6, Issue 3, 2006, Pages 321-353

  Bouajjani, Ahmed ^a   Merceron, Agathe ^a  

^a UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

Abstraction; Fault tolerant protocols; Formal verification; Parametric counter automata

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; FAULT TOLERANT COMPUTER SYSTEMS; MATHEMATICAL MODELS; ROBUSTNESS (CONTROL SYSTEMS);

ABSTRACTION; FAULT-TOLERANT PROTOCOLS; FORMAL VERIFICATION; PARAMETRIC COUNTER AUTOMATA;

NETWORK PROTOCOLS;

EID: 33646696906     PISSN: 14710684     EISSN: 14753081     Source Type: Journal    
DOI: 10.1017/S1471068406002663     Document Type: Conference Paper

References (32)

1. ABDULLA, P., ANNICHINI, A., BENSALEM, S., BOUAJJANI, A. AND P. HABERMEHL, Y. L. 1999. Verification of Infinite-State Systems by Combining Abstraction and Reachability Analysis. Computer Aided verification CA V'99. Lecture Notes in Computer Science, vol. 1633. Springer Verlag, pp. 146-159.
2. ABDULLA, P. A. AND JONSSON, B. 2001a. Channel representations in protocol verification. CONCUR'01. Lecture Notes in Computer Science, vol. 2154. Springer Verlag, pp. 1-15.
3. ABDULLA, P. A. AND JONSSON, B. 2001b. Ensuring completeness of symbolic verification methods for infinite-state systems. Theoretical Computer Science 256, 145-167.
4. ANNICHINI, A., ASARIN, E. AND BOUAJJANI, A. 2000. Symbolic techniques for parametric reasoning about counter and clock systems. Intern. Conf. on Computer Aided Verification (CAV'00). Lecture Notes in Computer Science, vol. 1855. Springer Verlag, pp. 419-434.
5. BARDIN, S., FINKEL, A. AND LEROUX, J. 2004. Faster acceleration of counter automata in practice. Intern. Conf. Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2004). Lecture Notes in Computer Science, vol. 2988. Springer Verlag, pp. 576-590.
6. BAUER, G. AND PAULITSCH, M. 2000. An investigation of membership and clique avoidance in ttp/c. Proceedings 19th IEEE Symposium on Reliable Distributed Systems (SRDS'00). IEEE Computer Society. 118-124.
7. BAUKUS, K., LAKHNECH, Y., AND STAHL, K. 2000. Verifying universal properties of parameterized networks. Proceedings of the 5th International Symposium on Formal Techniques in Real-Time and Fault Tolerant Systems, FTRTFT 2000, Pune, India, pp. 291-303.
8. BENVENISTE, A. AND BERRY, G. 1991. The synchronous approach to reactive and real-time systems. Proc. IEEE 79(9), 1270-1282.
9. BOIGELOT, B. AND WOLPER, P. 1994. Symbolic Verification with Periodic Sets. Computer Aided verification CAV'94. Lecture Notes in Computer Science, vol. 818. Springer Verlag, pp. 55-67.
10. BOUAJJANI, A., ESPARZA, J., AND MALER, O. 1997. Reachability Analysis of Pushdown Automata: Application to Model Checking. International Conference on Concurrency Theory CON CUR'97. Lecture Notes in Computer Science, vol. 1243. Springer Verlag, pp. 135-150.
11. BOUAJJANI, A. AND HABERMEHL, P. 1997. Symbolic Reachability Analysis of FIFO-Channel Systems with Nonregular Sets of Configurations. ICALP'97. Lecture Notes in Computer Science, vol. 1256. Springer Verlag.
12. (Full version in Theoretical Computer Science 221(1/2), 221-250, 1999.)
13. BOUAJJANI, A., JONSSON, B., NILSSON, M. AND TOUILI, T. 2000. Regular model checking. Computer Aided verification CAV'00. Lecture Notes in Computer Science, vol. 1855. Springer Verlag, pp. 403-418.
14. BOUAJJANI, A. AND MERCERON, A. 2002. Parametric verification of a group membership algorithm. 7th Intern. Symp. on Formal Techniques in Real-Time and Fault Tolerant Systems (FTRTFT'02). Lecture Notes in Computer Science, vol. 2469. Springer-Verlag, Oldenburg, Germany, pp. 311-330.
15. BULTAN, T., GERBER, R., AND LEAGUE, C. 1998. Verifying systems with integer constraints and Boolean predicates: A composite approach. Proc. of the Intern. Symp. on Software Testing and Analysis. ACM Press, pp. 113-123.
16. BULTAN, T. AND YAVUZ-KAHVECI, T. 2001. Action language verifier. Proceedings of the 16th IEEE International Conference on Automated Software Engineering (ASE 2001), Coronado Island, California. IEEE Computer Society, pp. 382-386.
17. COUSOT, P. AND HALBWACHS, N. 1978. Automatic discovery of linear restraints among variables of a program. POPL78, ACM, pp. 84-96.
18. CREESE, S. AND ROSCOE, A. W. 1999. Ttp: a case study in combining induction and data independence. Oxford University Programming Research Group. Technical Report TR-1-99.
19. DELZANNO, G. 2000. Automatic Verification of Parameterized Cache Coherence Protocols. Computer Aided verification CAV'00. Lecture Notes in Computer Science, vol. 1855. Springer Verlag, pp. 53-68.
20. GRAF, S. AND SAIDI, H. 1997. Construction of abstract state graphs with pvs. Computer Aided verification CAV'97. Lecture Notes in Computer Science, vol. 1254. Springer Verlag, pp. 72-83.
21. KATZ, S., LINCOLN, P. AND RUSHBY, J. 1997. Low-overhead Time-Triggered Group Membership. International Workshop on Distributed Algorithms WDAG'97. Lecture Notes in Computer Science, vol. 1320. Springer Verlag, pp. 155-169.
22. KESTEN, Y., MALER, O., MARCUS, M., PNUELI, A. AND SHAHAR, E. 1997. Symbolic Model Checking with Rich Assertional Languages. Computer Aided verification CAV'97. Lecture Notes in Computer Science, vol. 1254. Springer Verlag.
23. (Full version in Theoretical Computer Science 256, 93-112.)
24. KOPETZ, H. 1999. Ttp/c protocol - specification of the ttp/c protocol. http://www.tttech.com (1999).
25. KOPETZ, H. AND GRÜNSTEIDL, G. 1999. A time triggered protocol for fault-tolerant Real-Time Systems. IEEE Computer, 14-23.
26. LASH 2002. The Liège Automata-based Symbolic Handler (LASH). Available at http://www.montefiore.ulg.ac.be/~boigelot/research/lash/.
27. MANNA, Z. AND PNUELI, A. 1995. Temporal Verification of Reactive Systems-Safety. Springer-Verlag.
28. PFEIFER, H. 2000. Formal verification of the TTP Group Membership Algorithm. International Conference on Formal Description Techniques for Distributed Systems and Communication protocols and Protocol Specification, Testing and Verification, FORTE/PSTV 2000, Pisa, Italy, pp. 3-18.
29. PNUELI, A., XU, J. AND ZUCK, L. 2002. Liveness with (0,1,∞)-Counter Abstraction. Computer Aided verification CAV'02. Lecture Notes in Computer Science, vol. 2404. Springer Verlag, pp. 107-122.
30. SAIDI, H. AND SHANKAR, N. 1999. Abstract and Model Check while you Prove. Computer Aided verification CAV'99. Lecture Notes in Computer Science, vol. 1633. Springer Verlag, pp. 443-454.
31. STEINER, W., RUSHBY, J., SOREA, M. AND PFEIFER, H. 2004. Model checking a fault-tolerant startup algorithm: From design exploration to exhaustive fault simulation. Proc. of the International Conference on Dependable Systems and Networks DSN 2004. pp. 189-198.
32. WOLPER, P. AND BOIGELOT, B. 1998. Verifying systems with infinite but regular state spaces. Computer Aided verification CAV'98. Lecture Notes in Computer Science, vol. 1427. Springer Verlag, pp. 88-97.