Functional extension of symbolic model checking
Burch, Clarke, McMillan, Dill and Hwang describe in  a symbolic model checking procedure for Μ-calculus formulas. The algorithm is based on the representation of relations by binary decision diagrams (BDDs) . In the area of synchronous digital circuits a functional instead of a relational representation results in more compact BDDs. This is the reason for extending the Μ-calculus and the symbolic model checking procedure with functions.
Unable to display preview. Download preview PDF.
- R. E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions Computer, C-35(12):1035–1044, 1986.Google Scholar
- J.R. Burch, E.M. Clarke, and D.E. Long. Representing circuits more efficiently in symbolic model checking. In ACM/IEEE Design Automation Conference, 1991.Google Scholar
- J.R. Burch, E.M. Clarke, K.L. McMillan, and David L. Dill. Sequential circuit verification using symbolic model checking. In ACM/IEEE Design Automation Conference, 1990.Google Scholar
- J.R. Burch, E.M. Clarke, K.L. McMillan, David L. Dill, and L.J. Hwang. Symbolic model checking: 1020 states and beyond. In LICS, 1990.Google Scholar
- Olivier Coudert, Christian Berthet, and Jean-Christophe Madre. Verification of sequential machines using boolean functional vectors. In IMEC-IFIP International Workshop on Applied Formal Methods For Correct VLSI Design, 1989.Google Scholar
- Thomas Filkorn. Unifikation in endlichen Algebren und ihre Integration in Prolog. Master's thesis, Technical University Munich, 1988.Google Scholar
- Jean-Christophe Madre, Olivier Coudert, Michel Currat, Alain Debreil, and Christian Berthet. The formal verification chain at BULL. In EURO ASIC 90, 1990.Google Scholar
- Diederik Verkest, Luc Claesen, and Hugo De Man. Special benchmark session on formal system design. In IMEC-IFIP International Workshop on Applied Formal Methods For Correct VLSI Design, 1989.Google Scholar