Sa’ed Abed , Otmane Ait Mohamed , Ghiath Al Sammane
July 2008
Second International Workshop on Verification and Evaluation of Computer and Communication Systems (VECoS 2008) (VECoS)
Verification and Evaluation of Computer and Communication Systems
2 - 3 July 2008
Multiway Decision Graphs (MDGs) subsume Binary Decision Diagrams (BDDs) by representing formulae which are suitable for first-order model checking able to handle large datapath circuits. In this paper, we propose a reduction approach to improve MDGs model checking. We use a reduction platform based on combining MDGs with the rewriting engine of the HOL theorem prover. The idea is to prune the transition relation of the design using pre-proved theorems and lemmas from the specification given at system level. Then, the actual proof of temporal MDG formulae will be achieved by the MDGs model checker.
This work is licensed under a Creative Commons Attribution 4.0 Unported License. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/