Error detection with directed symbolic model checking

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

Volumn 1708, Issue , 1999, Pages 195-211

  Reel, Frank ^a   Edelkamp, Stefan ^b  

^a UNIVERSITY OF KARLSRUHE   (Germany)

^b UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY DECISION DIAGRAMS; BOOLEAN FUNCTIONS; FORMAL METHODS; SPACE RESEARCH; STATE SPACE METHODS;

AUTOMATICALLY GENERATED; BINARY DECISION DIAGRAMS (BDDS); CLASSICAL APPROACH; INTERNAL CHANGES; STATE SPACE EXPLORATION; STATE-SPACE EXPLOSION; SYMBOLIC MODEL CHECKING; SYMBOLIC STATE SPACE;

MODEL CHECKING;

EID: 84958049639     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48119-2_13     Document Type: Conference Paper

References (25)

1. R. Alur, R. Brayton, T. Henzinger, S. Qaderer, and S. Rajamani. Partial-order reduction in symbolic state space exploration. In Computer Aided Verification, volume 1254 of LNCS, pages 340-351, 1997.
2. A. Biere. E ziente -Kalk¨ul Modellpr¨ufung mit Bin¨arenntscheidungs diagrammen. PhD thesis, Fakult¨at f¨ur Informatik, Universit¨at Karlsruhe, 1997.
3. A. Biere. mucke – eficient -calculus model checking. In Computer Aided Verification, volume 1254 of LNCS, pages 468-471, 1997.
4. A. Biere, A. Cimatti, E. Clarke, Y. Zhu. Symbolic model checking without BDDs. In Tools and Algorithms for the Construction and Analysis of Systems, 1999. to appear.
5. R. Bryant. Graph based algorithms for boolean function manipulation. IEEE Transactions on Computers, C-35(8):677-691, 1986.
6. E. Clarke, O. Grumberg, and D. Long. Verification tools for finite-state concurrent systems. In A Decade of Concurrency, volume 803 of LNCS, pages 124-175. REX School Symposium, Springer, 1993.
7. R. Cleaveland. Tableau-based model checking in the propositional -calculus.Acta Inf., 27:725-747, 1990.
8. E. W. Dijkstra. A note on two problems in connection with graphs. Numerical Mathematics, 1(5):269-271, 1959.
9. D. L. Dill. Trace Theory for Automatic Hierarchical Verification of Speed- Independent Circuits. An ACM Distinguished Dissertation. The MIT Press, 1988.
10. J. F. Dillenburg and P. C. Nelson. Perimeter search (research note). Artificial Intelligence, 65(1):165-178, Jan. 1994.
11. S. Edelkamp and F. Re el. OBDDs in heuristic search. In O. Herzog and A. G¨unter, editors, Proceedings of the 22nd Annual German Conference on Advances in Artificial Intelligence (KI-98), volume 1504 of LNAI, pages 81-92.Springer, 1998.
12. S. Edelkamp and F. Reffel. Deterministic state space planning with BDDs. Technical Report 120, Institut f¨ur Informatik, Universit¨at Freiburg, 1999.
13. E. A. Emerson and J. Srinivasan. Branching time temporal logic. In REX workshop, volume 354 of LNCS, pages 123-172. Springer-Verlag, 1989.
14. J. C. Fernandez, L. Mounier, C. Jard, T. Jéron. On-the-fly verification of finite transition systems. Formal Methods in System Design, 1:251-273, 1992.
15. P. Hart, N. Nilsson, and B. Raphael. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions of Systems Science and Cybernetics, SCC-4(2):100-107, 1968.
16. R. E. Korf. Depth- rst iterative-deepening: An optimal admissible tree search. Artificial Intelligence, 27(1):97-109, 1985. reprinted in Chapter 6 of Expert Systems, A Software Methodology for Modern Applications, P.G. Raeth (Ed.), IEEE Computer Society Press, Washington D.C., 1990, pp. 380-389.
17. D. Kozen. Results on the propositional -calculus. Theoretical Computer Science, 27:333-354, 1983.
18. O. Lichtenstein and A. Pnueli. Checking that nite state concurrent programs satisfy their linear specication. In Proceedings of the Twelfth Annual ACM Symposium on Principles of Programming Languages, pages 97-107, New York, 1985. ACM.
19. K. McMillan. Symbolic Model Checking. Kluwer Academic Press, 1993.
20. D. Park. Concurrency and automata on in nite sequences. In P. Deussen, editor, Theoretical Computer Science, 5th GI Conference, volume 104 of LNCS, pages 167-183. Springer, 1981.
21. J. Pearl. Heuristics: Intelligent search strategies for computer problem solving. Addison-Wesley series in Articial Intelligence. Addison-Wesley, 1984.
22. A. Reinefeld and T. A. Marsland. Enhanced iterative-deepening search. IEEE Transactions on Pattern Analysis and Machine Intelligence, 16(7):701-710, 1994.
23. R. Rudell. Dynamic variable ordering for ordered binary decision diagrams. In International Conference on Computer-Aided Design, pages 139-144. IEEE, 1993.
24. C. Stirling and D. Walker. Local model checking in the modal -claculus. Theoretical Computer Science, 89:161-177, 1991.
25. C. H. Yang and D. Dill. Validation with guided search of the state space. In 35nd Design Automation Conference, 1998.