BDDs verified in a proof assistant ( Preliminary report )
暂无分享,去创建一个
[1] John Matthews,et al. Verifying BDD Algorithms through Monadic Interpretation , 2002, VMCAI.
[2] Tobias Nipkow,et al. A Proof Assistant for Higher-Order Logic , 2002 .
[3] Stephan Merz,et al. Construction of Büchi Automata for LTL Model Checking Verified in Isabelle/HOL , 2009, TPHOLs.
[4] Wolfgang Reif,et al. Do You Trust Your Model Checker? , 2000, FMCAD.
[5] Sofia Cassel,et al. Graph-Based Algorithms for Boolean Function Manipulation , 2012 .
[6] Norbert Schirmer,et al. Verification of BDD Normalization , 2005, TPHOLs.
[7] Ralph Matthes,et al. Verification of the Schorr-Waite Algorithm - From Trees to Graphs , 2010, LOPSTR.
[8] Clemens Ballarin,et al. Interpretation of Locales in Isabelle: Theories and Proof Contexts , 2006, MKM.
[9] Harald Ruess,et al. Case Studies in Meta-Level Theorem Proving , 1998, TPHOLs.
[10] Martin Odersky,et al. An Overview of the Scala Programming Language , 2004 .
[11] Peter Lammich,et al. The Isabelle Collections Framework , 2010, ITP.
[12] Jean Goubault-Larrecq,et al. Reflecting BDDs in Coq , 2000, ASIAN.
[13] H. Andersen. An Introduction to Binary Decision Diagrams , 1997 .