Parametric verification of a group membership algorithm

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

Volumn 2469, Issue , 2002, Pages 311-330

  Bouajjani, Ahmed ^a   Merceron, Agathe ^a  

^a UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

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

Indexed keywords

ABSTRACTING; AUTOMATA THEORY; FAULT TOLERANCE; FORMAL VERIFICATION; REAL TIME SYSTEMS;

ABSTRACTION; ARBITRARY NUMBER; AUTOMATIC VERIFICATION; COUNTER AUTOMATA; FAULT TOLERANT PROTOCOLS; GROUP MEMBERSHIPS; PARAMETRIC VERIFICATION;

PARAMETER ESTIMATION;

EID: 84974720061     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45739-9_19     Document Type: Conference Paper

References (24)

1. Abdulla P.A, Annichini A., Bensalem S., Bouajjani A., Habermehl P., Lakhnech Y: Verification of Infinite-State Systems by Combining Abstraction and Reachability Analysis. CAV’99, Lecture Notes in Computer Science, Vol 1633. Springer-Verlag, (1999)
2. Abdulla P.A, Jonsson B.: Channel Representations in Protocol Verification. CONCUR’ 01, Lecture Notes in Computer Science, Vol 2154. Springer-Verlag, (2001) 1-15
3. Abdulla P.A, Jonsson B.: Ensuring Completeness of Symbolic Verification Methods for Infinite-State Systems. Theoretical Computer Science, Vol 256. (2001) 145-167
4. Annichini A., Asarin E., Bouajjani A.: Symbolic Techniques for Parametric Reasoning about Counter and Clock Systems. CAV’00, Lecture Notes in Computer Science, Vol 1855. (2000)
5. Bauer G., Paulitsch M.: An investigation of membership and clique avoidance in TTP/C. Proceedings 19th IEEE Symposium on Reliable Distributed Systems (SRDS’00), IEEE Computer Society, (2000), 118-124
6. Baukus K., Lakhnech Y., Stahl K.: 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
7. Boigelot B., Wolper P.: Symbolic Verification with Periodic Sets. CAV’94, Lecture Notes in Computer Science, Vol 818. Springer-Verlag, (1994)
8. Bouajjani A., Esparza J., Maler O.: Reachability Analysis of Pushdown Automata: Application to Model Checking. CONCUR’97, Lecture Notes in Computer Science, Vol 1243. Springer-Verlag, (1997)
9. Bouajjani A., Habermehl P.: Symbolic Reachability Analysis of FIFO-Channel Systems with Nonregular Sets of Configurations. ICALP’97, Lecture Notes in Computer Science, Vol 1256. Springer-Verlag, (1997) Full version in TCS, Vol 221 (1/2) (1999) 221-250
10. Bouajjani A., Jonsson B., Nilsson M., Touili T.: Regular Model Checking. CAV’00, Lecture Notes in Computer Science, Vol 1855. Springer-Verlag, (2000)
11. Bouajjani A., Merceron A.: Parametric Verification of a Group Membership Algorithm. Technical Report, Liafa, University of Paris 7, (2002)
12. Bultan T., Gerber R., League C.: Verifying Systems With Integer Constraints and Boolean Predicates: A Composite Approach. Proc. of the Intern. Symp. on Software Testing and Analysis, ACM Press (1998)
13. Bultan T., Yavuz-Kahveci T.: Action Language Verifier. Proceedings of the 16th IEEE International Conference on Automated Software Engineering (ASE 2001), IEEE Computer Society, Coronado Island, California, (2001)
14. Cousot P., Halbwachs H.: Automatic Discovery of Linear Restraints Among Variables of a Program. POPL’78, ACM Press (1978)
15. Creese S., Roscoe A.W.: TTP: a case study in combining induction and data independence. Oxford University Programming Research Group, Technical Report TR-1-99, (1999)
16. Graf S., Saidi H.: Construction of abstract state graphs with pvs. CAV’97, Lecture Notes in Computer Science, Vol 1254. Springer-Verlag, (1997)
17. Katz S., Lincoln P., Rushby J.: Low-overhead Time-Triggered Group Membership. WDAG’97, Lecture Notes in Computer Science, Vol 1320. Springer-Verlag, (1997)
18. Kesten Y., Maler O., Marcus M., Pnueli A., Shahar E.: Symbolic Model Checking with Rich Assertional Languages. CAV’97, Lecture Notes in Computer Science, Vol 1254. Springer-Verlag, (1997)
19. Kopetz H.: TTP/C Protocol - Specification of the TTP/C Protocol. www.tttech.com (1999)
20. Kopetz H., Grünsteidl G.: A time triggered protocol for fault-tolerant Real-Time Systems. IEEE Computer, (1999) 14-23
21. LASH: The Liège Automata-based Symbolic Handler (LASH). www.montefiore.ulg.ac.be/~boigelot/research/lash/
22. Pfeifer H.: Formal verification of the TTP Group Membership Algorithm. IFIP TC6/WG6.1 International Conference on Formal Description Techniques for Distributed Systems and Communication protocols and Protocol Specification, Testing and Verification, FORTE/PSTV 2000, Pisa, Italy (2000)
23. Saidi H., Shankar N.: Abstract and Model Check while you Prove. CAV’99, Lecture Notes in Computer Science, Vol 1633. Springer-Verlag, (1999)
24. Wolper W., Boigelot B.: Verifying systems with infinite but regular state spaces. CAV’98, Lecture Notes in Computer Science, Vol 1427. Springer-Verlag, (1998)