Model checking using adaptive state and data abstraction

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

Volumn 818 LNCS, Issue , 1994, Pages 455-467

  Dams, Dennis ^a   Gerth, Rob ^a,d   Döhmen, Gert ^b,d   Herrmann, Ronald ^b   Kelb, Peter ^b   Pargmann, Hergen ^c  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b OFFIS INSTITUTE FOR INFORMATION TECHNOLOGY   (Germany)

^c UNIVERSITY OF OLDENBURG   (Germany)

^d Building Correct Reactive Systems ^*

Author keywords

Abstract interpretation; ACTL; Binary decision diagrams (BDDs); Model checking; State partitioning

Indexed keywords

ABSTRACTING; BINARY DECISION DIAGRAMS; COMPUTER AIDED ANALYSIS; SPECIFICATIONS;

ABSTRACT INTERPRETATIONS; ACTL; BINARY DECISION DIAGRAMS (BDDS); DATA ABSTRACTION; MODEL CHECKER; PARTITIONING ALGORITHMS; STATE PARTITIONING;

MODEL CHECKING;

EID: 84947435338     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-58179-0_75     Document Type: Conference Paper

References (15)

1. 20 states and beyond. In Proceedings of the Fifth Anual IEEE Symposium on Logic in Computer Science (LICS), 1990.
2. +92] A. Bouajjani, J,-C. Fernandez, N. Halbwachs, E Raymond, and C. Ratel. Minimal state graph generation. Science of Computer Programmming, 18(3):247-271, 1992.
3. [Bry86] R.E. Bryant. Graph-based algorithms for boolean function manipulation. Transactions on Computers, C-35:677-691, 1986.
4. [Bry92] R.E. Bryant. Symbolic boolean manipulation with orderedbinary-decisiondiagrams. ACM Computing Surveys, 24(3):293-318, 1992.
5. [CC77] P. Cousot and R. Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by constructing or approximation of fixed points. In Proceedings of the Fourth Annual ACM Symposium on Principles of Programming Languages (POPL), pages 238-252. ACM, 1977.
6. [DGG93] D. Dams, R. Gerth, and O. Grumberg. Generation of reduced models for checking fragments of CTL. In C. Courcoubetis, editor, Proceedings of the Fifth Conference on Computer-Aided Verification, volume 697 of Lecture Notes in Computer Science. Springer-Vedag, 1993.
7. [DGG94] D. Dams, O. Grumberg, and R. Gerth. Abstract interpretation of reactive systems: abstractions preserving vCTL*, 3CTL* and CTL*. In Proceedings of PROCOMET, IFIE North-Holland, 1994. To appear.
8. [GKPP94] R. Gerth, R. Kuiper, D. Peled, and W. Penczek. A partial order approach to branching time logic model checking, 1994. Submitted.
9. [GW91 ] E Godefroid and E Wolper. A partial approach to model checking. In Proceedings of the Sixth Anual IEEE Symposium on Logic in Computer Science (LICS), 1991.
10. [Har87] D. Harel. Statecharts: A visual formalism for complex systems. Science of Computer Programming, 8, 1987.
11. [HK94] J. Helbig and E Kelb. An OBDD representation of statecharts, 1994. To appear in EDAC94.
12. +93] J. Helbig, R. Schlör, W. Damm, G. Döhmen, and E Kelb. VHDL/S-integrating statecharts, timing diagrams and VHDL. Microprocessing and Microprogramming, 38:571-580, 1993.
13. [Pel93] D. Peled. All from one, one for all, on model-checking using representatives. In Proceedings of the Fifth International Conference on Computer-Aided Verification, Lecture Notes in Computer Science, pages 409-423. Springer-Verlag, 1993.
14. [SD93] R. Schör and W. Datum. Specification and verification of system-level hardware designs using timing diagrams. In EDAC93, 1993.
15. [Val91] A. Valmari. A stubborn attack on state explosion. In Proceedings of the Second Conference on Computer-Aided Veritication, Lecture Notes in Computer Science. Springer-Verlag, 1991.