Reflecting BDDs in Coq - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2000

Reflecting BDDs in Coq


We propose an implementation and a proof of correctness of binary decision diagrams (BDDs), completely formalized in Coq. This not only shows that BDD algorithms are correct, but also yields a certified BDD algorithm running in Caml, using extraction, and even allows us to run BDD-based algorithms inside Coq itself, by reflection. The latter point paves the path for a smooth integration of symbolic model-checking in the Coq proof assistant. Extensive experimental results show that this approach works in practice, and is able to solve both relatively hard propositional problems and actual industrial hardware verification problems.


Other [cs.OH]
Fichier principal
Vignette du fichier
RR-3859.pdf (588.25 Ko) Télécharger le fichier

Dates and versions

inria-00072797 , version 1 (24-05-2006)


  • HAL Id : inria-00072797 , version 1


Kumar Neeraj Verma, Jean Goubault-Larrecq. Reflecting BDDs in Coq. [Research Report] RR-3859, INRIA. 2000. ⟨inria-00072797⟩
169 View
392 Download


Gmail Facebook Twitter LinkedIn More