Abstract
In practice due to entailed memory limitations the most important problem in model checking is state space explosion. Therefore, to prove the correctness of a given design binary decision diagrams (BDDs) are widely used as a concise and symbolic state space representation. Nevertheless, BDDs are not able to avoid an exponential blow-up in general. If we restrict ourselves to find an error of a design which violates a safety property, in many cases a complete state space exploration is not necessary and the introduction of a heuristic to guide the search can help to keep both the explored part and the associated BDD representation smaller than with the classical approach.
In this paper we will show that this idea can be extended with an automatically generated heuristic and that it is applicable to a large class of designs. Since the proposed algorithm can be expressed in terms of BDDs it is even possible to use an existent model checker without any internal changes.
Chapter PDF
References
R. Alur, R. Brayton, T. Henzinger, S. Qaderer, and S. Rajamani. Partial-order reduction in symbolic state space exploration. In Computer Aided Verication, volume 1254 of LNCS, pages 340–351, 1997.
A. Biere. Effiziente µ-Kalköl Modellpröfung mit Binäaren Entscheidungsdiagrammen.PhD thesis, Fakultät für Informatik, Universität Karlsruhe, 1997.
A. Biere. mucke-efficient µ-calculus model checking. InComputer Aided Verication, volume 1254 of LNCS, pages 468–471, 1997.
A. Biere, A. Cimatti, E. Clarke, and Y. Zhu. Symbolic model checking without BDDs. In Tools and Algorithms for the Construction and Analysis of Systems, 1999. to appear.
R. Bryant. Graph based algorithms for boolean function manipulation. IEEE Transactions on Computers, C-35(8):677–691, 1986.
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.
R. Cleaveland. Tableau-based model checking in the propositional µ-calculus. Acta Inf., 27:725–747, 1990.
E. W. Dijkstra. A note on two problems in connection with graphs. Numerical Mathematics, 1(5):269–271, 1959.
D. L. Dill. Trace Theory for Automatic Hierarchical Verification of Speed-Independent Circuits.An ACM Distinguished Dissertation. The MIT Press, 1988.
J. F. Dillenburg and P. C. Nelson. Perimeter search (research note). Articial Intelligence,65(1):165–178, Jan. 1994.
S. Edelkamp and F. Reffel.OBDDs in heuristic search. In O. Herzog and A. Günter, editors, Proceedings of the 22nd Annual German Conference on Advances in Articial Intelligence (KI-98), volume 1504 of LNAI, pages 81–92. Springer, 1998.
S. Edelkamp and F. Reffel. Deterministic state space planning with BDDs. Technical Report 120, Institut für Informatik, Universitä Freiburg, 1999.
E. A. Emerson and J. Srinivasan. Branching time temporal logic. In REX workshop, volume 354 of LNCS, pages 123–172. Springer-Verlag, 1989.
J. C. Fernandez, L. Mounier, C. Jard, and T. Jéron. On-the-fly verification of finite transition systems. Formal Methods in System Design, 1:251–273, 1992.
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.
R. E. Korf. Depth-rst iterative-deepening: An optimal admissible tree search. Articial 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.
D. Kozen. Results on the propositional μ-calculus. Theoretical Computer Science, 27:333–354, 1983.
O. Lichtenstein and A. Pnueli. Checking that nite state concurrent programs satisfy their linear specification. In Proceedings of the Twelfth Annual ACM Symposium on Principles of Programming Languages, pages 97–107, New York, 1985. ACM.
K. McMillan. Symbolic Model Checking. Kluwer Academic Press, 1993.
D. Park. Concurrency and automata on infinite sequences. In P. Deussen, editor, Theoretical Computer Science, 5th GI Conference, volume 104 of LNCS, pages 167–183.Springer, 1981.
J. Pearl. Heuristics: Intelligent search strategies for computer problem solving. Addison-Wesley series in Articial Intelligence. Addison-Wesley, 1984.
A. Reinefeld and T. A. Marsland. Enhanced iterative-deepening search. IEEE Transactions on Pattern Analysis and Machine Intelligence, 16(7):701–710, 1994.
R. Rudell. Dynamic variable ordering for ordered binary decision diagrams.In International Conference on Computer-Aided Design, pages 139–144. IEEE, 1993.
C. Stirling and D. Walker. Local model checking in the modal µ-calculus. Theoretical Computer Science, 89:161–177, 1991.
C. H. Yang and D. Dill. Validation with guided search of the state space. In 35nd Design Automation Conference, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Reffe, F., Edelkamp, S. (1999). Error Detection with Directed Symbolic Model Checking. In: Wing, J.M., Woodcock, J., Davies, J. (eds) FM’99 — Formal Methods. FM 1999. Lecture Notes in Computer Science, vol 1708. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48119-2_13
Download citation
DOI: https://doi.org/10.1007/3-540-48119-2_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66587-8
Online ISBN: 978-3-540-48119-5
eBook Packages: Springer Book Archive