Model checking on product structures

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

Volumn 1522, Issue , 1998, Pages 483-500

  Schneider, Klaus ^a  

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED DESIGN; DISTRIBUTED COMPUTER SYSTEMS; FORMAL METHODS; STRUCTURAL DESIGN;

CTL MODEL-CHECKING; KRIPKE STRUCTURE; LTL MODEL-CHECKING; MODEL CHECKING PROBLEM; PRODUCT STRUCTURE; SYMBOLIC MODEL CHECKING;

MODEL CHECKING;

EID: 84937451815     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49519-3_31     Document Type: Conference Paper

References (24)

1. E.M. Clarke and E.A. Emerson. Design and Synthesis of Synchronization Skeletons using Branching Time Temporal Logic. In D. Kozen, editor, Workshop on Logics of Programs, volume 131 of Lecture Notes in Computer Science, pages 52-71, Yorktown Heights, New York, May 1981. Springer-Verlag.
2. A. Pnueli. The temporal logic of programs. In Symposium on Foundations of Computer Science, volume 18, pages 46-57, New York, 1977. IEEE.
3. E.A. Emerson and J.Y. Halpern.’’sometimes” and”not never” revisited: On branching versus linear time temporal logic. Journal of the ACM, 33(1):151—178, January 1986.
4. K.L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, Norwell Massachusetts, 1993.
5. A. Aziz, F. Balarin, S.-T. Cheng, R. Hojati, T. Kam, S.C. Krishnan, R.K. Ranjan, T.R. Shiple, V. Singhal, S. Tasiran, H.-Y. Wang, R.K. Brayton, and A.L. Sangiovanni-Vincentelli. HSIS: A BDD-Based Environment for Formal Verification. In ACM/IEEE Design Automation Conference (DAC), San Diego, CA, June 1994. San Diego Convention Center.
6. J. Dingel and T. Filkorn. Model checking for infinite state systems using data abstraction, assumption-commitment style reasoning and theorem proving. In P. Wolper, editor, Conference on Computer Aided Verification (CAV), volume 939 of Lecture Notes in Computer Science, pages 54—69, Liege, Belgium, July 1995. Springer Verlag.
7. E.M. Clarke, E.A. Emerson, and A.P. Sistla. Automatic Verification of Finite-State Concurrent Systems Using Temporal Logic Specifications. ACM Transactions on Programming Languages and Systems, 8(2):244—263, April 1986.
8. A.P. Sistla and E.M. Clarke. The complexity of propositional linear temporal logics. Journal of Assoc. Comput. Mach., 32(3):733—749, July 1985.
9. E.M. Clarke, O. Grumberg, and K. Hamaguchi. Another look at LTL model checking. In David L. Dill, editor, Conference on Computer Aided Verification (CAV), volume 818 of Lecture Notes in Computer Science, pages 415—427, Standford, California, USA, June 1994. Springer-Verlag.
10. P. Wolper. The tableau method for temporal logic: An overview. Logique et Analyse, 28:119—136, 1985.
11. P. Wolper. On the relation of programs and computations to models of temporal logic. In B. Banieqbal, H. Barringer, and A. Pnueli, editors, Temporal Logic in Specification, pages 75—123, Altrincham, UK, 1987. Springer-Verlag.
12. M.Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In IEEE Symposium on Logic in Computer Science (LICS), pages 332—344. IEEE Computer Society Press, D.C., June 1986.
13. C. Courcoubetis, M.Y. Vardi, P. Wolper, and M. Yannakakis. Memory efficient algorithms for the verification of temporal properties. Formal Methods in System Design, 1:275—288, 1992.
14. A. Valmari. A Stubborn Attack on the State Explosion Problem. In R. P. Kurshan and E.M. Clarkes, editors, Workshop on Computer Aided Verification (CAV), June 1990.
15. P. Godefroid and P. Wolper. Using partial orders for the efficient verification of deadlock freedom and safety properties. Formal Methods in System Design, 2(2):149—164, April 1993.
16. D. Peled. Combining partial order reductions with on-the-fly model-checking. In David L. Dill, editor, Conference on Computer Aided Verification (CAV), volume 818 of Lecture Notes in Computer Science, pages 377—390, Standford, California, USA, June 1994. Springer- Verlag.
17. K. Schneider. CTL and equivalent sublanguages of CTL*. In C. Delgado Kloos, editor, IFIP Conference on Computer Hardware Description Languages and their Applications (CHDL), pages 40—59, Toledo,Spain, April 1997. IFIP, Chapman and Hall.
18. R. Milner. Communication and Concurrency. Prentice-Hall International, London, 1989.
19. M.C. Browne, E.M. Clarke, and O. Grumberg. Characterizing Finite Kripke Structures in Propositional Temporal Logic. Theoretical Computer Science, 59(1-2), July 1988.
20. A. Aziz, V. Singhal, F. Balarin, R.K. Brayton, and A.L. Sangiovanni-Vincentelli. Equivalences for fair kripke structures. In International Colloquium on Automata, Languages and Programming (ICALP), Jerusalem, Israel, July 1994.
21. E.A. Emerson and C.-L. Lei. Modalities for model checking: Branching time strikes back. In ACM Symposium on Principles of Programming Languages (POPL), pages 84—96, New York, January 1985. ACM.
22. E.A. Emerson and C.-L. Lei. Modalities for model checking: Branching time strikes back. Science of Computer Programming, 8:275—306, 1987.
23. E. Clarke, O. Grumberg, and D. Long. Model checking and abstraction. ACM Transactions on Programming Languages and systems, 16(5):1512-1542, September 1994.
24. E. Clarke, O. Grumberg, and D. Long. Verification Tools for Finite State Concurrent Systems. In J.W. de Bakker, W.-P. de Roever, and G. Rozenberg, editors, A Decade of Concurrency-Reflections and Perspectives, volume 803 of Lecture Notes in Computer Science, pages 124—175, Noordwijkerhout, Netherlands, June 1993. REX School/Symposium, Springer-Verlag