Model checking procedures for infinite state systems

Proceedings of the International Symposium and Workshop on Engineering of Computer Based Systems

Volumn , Issue , 2006, Pages 419-425

  Bogunović, Nikola ^a   Pek, Edgar ^a  

^a UNIVERSITY OF ZAGREB   (Croatia)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; NETWORK PROTOCOLS; STATISTICAL METHODS; SYSTEMS ANALYSIS; TEMPORAL LOGIC;

FISCHER MUTUAL EXCLUSION PROTOCOLS; SAFETY PROPERTIES;

MODEL CHECKING;

EID: 34250005253     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ECBS.2006.46     Document Type: Conference Paper

References (16)

1. R. Alur, C. Courcoubetis, and D. Dill, Model-checking for real-time systems. In Proceedings of the 5th Annual IEEE Symposium on Logic in Computer Science, pages 414-427, Philadelphia, PA, June 1990. IEEE Computer Society Press.
2. R. Alur and D. L. Dill. A theory of timed automata. Theoretical Computer Science, 126(2): 183-235, 25 Apr. 1994.
3. S. Bensalem, Y. Lakhnech, and S. Owre. Computing abstractions of infinite state systems compositionally and automatically. In CAV '98: Proceedings of the 10th International Conference on Computer Aided Verification, pages 319-331. Springer-Verlag, 1998.
4. N. Bogunović and E. Pek. Verification of mutual exclusion algorithms with SMV system. In Proceedings of IEEE Region 8 Eurocon 2003: Computer as a Tool, volume II., pages 12-25. IEEE, September 2003.
5. R. Cavada, A. Cimatti, E. Olivetti, M. Pistore, and M. Roveri. NuSMV 2.1 User Manual, 2002.
6. E. M. Clarke, O. Grumberg, and D. A. Peled. Model Checking. The MIT Press, Cambridge, Massachusetts, 1999.
7. M. Colon and T. E. Uribe. Generating finite-state abstractions of reactive systems using decision procedures. In CAV '98: Proceedings of the 10th International Conference on Computer Aided Verification, pages 293-304. Springer-Verlag, 1998.
8. P. Cousot and R. Cousot. Abstract intrepretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Conference Record of the 4th ACM Symposium on Principles of Programming Languages, pages 238-252, Los Angeles, CA, Jan. 1977.
9. S. Das, D. L. Dill, and S. Park. Experience with predicate abstraction. In 11th International Conference on Computer-Aided Verification. Springer-Verlag, July 1999.
10. S. Graf and H. Saïdi. Construction of abstract state graphs with pvs. In CAV '97: Proceedings of the 9th International Conference on Computer Aided Verification, pages 72-83. Springer-Verlag, 1997.
11. K.L. McMillan. Symbolic Model Checking: An Approach to the State Explosion Problem, PhD thesis, School of Computer Science, Carnegie Mellon University, 1992.
12. M. O. Möller, H. Rueß, and M. Sorea. Predicate abstraction for dense real-time systems. Electronic Notes in Theoretical Computer Science, 65(6), 2002.
13. E. Pek and N. Bogunović, Formal verification of communication protocols in distributed systems. In MIPRO 2003, Proceedings of the Joint Conferences Computers in technical systems and Intelligent systems, pages 44-49, May 2003.
14. E. Pek and N. Bogunović. Formal verification of logical link control and adaptation protocol. In Proceedings of the 12th IEEE Mediterranean Electrotechnical Conference, MELECON200, pages 583-586, May 2004.
15. H. Saïdi and N. Shankar. Abstract and model check while you prove. In CAV '99: Proceedings of the 11th International Conference on Computer Aided Verification, pages 443-454. Springer-Verlag, 1999.
16. N. Shankar. Programming methodology, chapter Automated verification using deduction, exploration, and abstraction, pages 333-351. Springer-Verlag New York, Inc., 2003.