Predicate abstraction for dense real-time systems

Electronic Notes in Theoretical Computer Science

Volumn 65, Issue 6, 2002, Pages 218-237

  Möller, M Oliver ^a   Rueß, Harald ^b   Sorea, Maria ^b  

^a AARHUS UNIVERSITY   (Denmark)

^b SRI INTERNATIONAL   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; ALGORITHMS; APPROXIMATION THEORY; CONSTRAINT THEORY; GRAPH THEORY; MATHEMATICAL MODELS; SEMANTICS;

ABSTRACTION; ABSTRACTION ALGORITHMS; AUTOMATA; MODEL CHECKING;

REAL TIME SYSTEMS;

EID: 18544381781     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80478-X     Document Type: Conference Paper

References (20)

1. Alur R., Courcoubetis C., Dill D. Model-checking for real-time systems. 5th Symp. on Logic in Computer Science (LICS 90). 1990;414-425
2. Alur R., Dill D.L. A theory of timed automata. Theoretical Computer Science. 126:1994;183-235
3. Bensalem S., Lakhnech Y., Owre S. Computing abstractions of infinite state systems compositionally and automatically. Lecture Notes in Computer Science. 1427:1998;319-331
4. Clarke E., Grumberg O., Jha S., Lu Y., Veith H. Counterexample-guided abstraction refinement. Lecture Notes in Computer Science. 1855:2000;154-169
5. Cousot P. 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, Los Angeles, CA, 1977, pp. 238-252.
6. Dams, D. R., "Abstract Interpretation and Partition Refinement for Model Checking," Ph.D. thesis, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands (1996).
7. Das S. and D. L. Dill, Successive approximation of abstract transition relations, in: Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science (LICS-01) (2001), pp. 51-60.
8. Dill D., Wong-Toi H. Verification of real-time systems by successive over and under approximation. Lecture Notes in Computer Science. 939:1995;409-422
9. Filliǎtre J.-C., S. Owre, H. Rueß and N. Shankar, ICS: Integrated Canonization and Solving, in: G. Berry, H. Comon and A. Finkel, editors, Proceedings of CAV'2001, Lecture Notes in Computer Science 2102 (2001), pp. 246-249.
10. Graf S., Saïdi H. Construction of abstract state graphs with PVS. Lecture Notes in Computer Science. 1254:1997;72-83
11. Henzinger T.A., Nicollin X., Sifakis J., Yovine S. Symbolic model checking for real-time systems. Information and Computation. 111:1994;193-244
12. Kick A., "Generation of counterexamples and witnesses for the Mu-calculus," Ph.D. thesis, University of Karlsruhe, Germany (1996).
13. Kozen D. Results on the propositional μ-calculus. Theoretical Computer Science. 27:1983;333-354
14. Lachnech Y., Bensalem S., Berezin S., Owre S. Incremental verification by abstraction. Lecture Notes in Computer Science. 2031:2001;98-112
15. Möller, M. O., H. Rueß and M. Sorea, Predicate abstraction for dense real-time systems, Technical Report BRICS-RS-01-44, Department of Computer Science, University of Aarhus, Denmark (2001), Available online at http://www.brics.dk/RS/01/44/.
16. Namjoshi K., Kurshan R. Syntactic program transformations for automatic abstraction. Lecture Notes in Computer Science. 1855:2000;435-449
17. Saïdi H., Shankar N. Abstract and model check while you prove. Lecture Notes in Computer Science. 1633:1999;443-454
18. Tripakis S., Yovine S. Analysis of timed systems using time-abstracting bisimulations. Formal Methods in System Design. 18:2001;25-68
19. Uribe, T. E., "Abstraction-based Deductive-Algorithmic Verification of Reactive Systems," Ph.D. thesis, Computer Science Department, Stanford University (1998), technical report STAN-CS-TR-99-1618.
20. Yovine, S., Model-checking timed automata, in: G. Rozenberg and F. Vaandrager, editors, Embedded Systems, number 1494 in Lecture Notes in Computer Science, 1998, pp. 114-152.