Multiway decision graphs reduction approach based on the HOL theorem prover

  • Authors:
  • Sa'ed Abed;Otmane Ait Mohamed;Ghiath Al Sammane

  • Affiliations:
  • Department of Electrical and Computer Engineering, Concordia University, Montreal, Canada;Department of Electrical and Computer Engineering, Concordia University, Montreal, Canada;Department of Electrical and Computer Engineering, Concordia University, Montreal, Canada

  • Venue:
  • VECoS'08 Proceedings of the Second international conference on Verification and Evaluation of Computer and Communication Systems
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.