Formal Verification based on Boolean Expression Diagrams

[1]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.

[2]  H. Andersen,et al.  Satisfiability checking using Boolean Expression Diagrams , 2001, International Journal on Software Tools for Technology Transfer.

[3]  E. Clarke,et al.  Combining Decision Diagrams and SAT Procedures for Efficient Symbolic Model Checking , 2000, International Conference on Computer Aided Verification.

[4]  Ofer Strichman,et al.  Tuning SAT Checkers for Bounded Model Checking , 2000, CAV.

[5]  Antoine Rauzy,et al.  Bypassing BDD construction for reliability analysis , 2000, Inf. Process. Lett..

[6]  Parosh Aziz Abdulla,et al.  Symbolic Reachability Analysis Based on SAT-Solvers , 2000, TACAS.

[7]  Henrik Reif Andersen,et al.  Difference Decision Diagrams , 1999, CSL.

[8]  R. Sebastiani,et al.  Applying the Davis-Putnam Procedure to Non-clausal Formulas , 1999, International Conference of the Italian Association for Artificial Intelligence.

[9]  Poul Frederick Williams,et al.  Equivalence checking of hierarchical combinational circuits , 1999, ICECS'99. Proceedings of ICECS '99. 6th IEEE International Conference on Electronics, Circuits and Systems (Cat. No.99EX357).

[10]  Jussi Rintanen,et al.  Improvements to the Evaluation of Quantified Boolean Formulae , 1999, IJCAI.

[11]  Fausto Giunchiglia,et al.  NUSMV: A New Symbolic Model Verifier , 1999, CAV.

[12]  Armin Biere,et al.  Verifiying Safety Properties of a Power PC Microprocessor Using Symbolic Model Checking without BDDs , 1999, CAV.

[13]  Henrik Reif Andersen,et al.  Equivalence checking of combinational circuits using Boolean expression diagrams , 1999, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[14]  E. Clarke,et al.  Symbolic model checking using SAT procedures instead of BDDs , 1999, Proceedings 1999 Design Automation Conference (Cat. No. 99CH36361).

[15]  Joao Marques-Silva,et al.  GRASP: A Search Algorithm for Propositional Satisfiability , 1999, IEEE Trans. Computers.

[16]  Armin Biere,et al.  Symbolic Model Checking without BDDs , 1999, TACAS.

[17]  Mary Sheeran,et al.  A Tutorial on Stålmarcks's Proof Procedure for Propositional Logic , 1998, FMCAD.

[18]  Marco Schaerf,et al.  An Algorithm to Evaluate Quantified Boolean Formulae , 1998, AAAI/IAAI.

[19]  Max J. Cresswell,et al.  A New Introduction to Modal Logic , 1998 .

[20]  C. A. J. van Eijk,et al.  Sequential equivalence checking without state space traversal , 1998, DATE.

[21]  David R. O'Hallaron,et al.  Space- and time-efficient BDD construction via working set control , 1998, Proceedings of 1998 Asia and South Pacific Design Automation Conference.

[22]  A. Rauzy,et al.  Exact and truncated computations of prime implicants of coherent and non-coherent fault trees within Aralia , 1997 .

[23]  Jacob A. Abraham,et al.  Indexed BDDs: Algorithmic Advances in Techniques to Represent and Verify Boolean Functions , 1997, IEEE Trans. Computers.

[24]  Hantao Zhang,et al.  SATO: An Efficient Propositional Prover , 1997, CADE.

[25]  Henrik Reif Andersen,et al.  Boolean expression diagrams , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[26]  A. Kuehlmann,et al.  Equivalence Checking Using Cuts And Heaps , 1997, Proceedings of the 34th Design Automation Conference.

[27]  Rolf Drechsler,et al.  Manipulation Algorithms for K*BMDs , 1997, TACAS.

[28]  Rolf Drechsler,et al.  The K*BMD: A Verification Data Structure , 1997, IEEE Des. Test Comput..

[29]  Rolf Drechsler,et al.  Fast and efficient construction of BDDs by reordering based synthesis , 1997, Proceedings European Design and Test Conference. ED & TC 97.

[30]  Rolf Drechsler,et al.  Decision diagrams in synthesis-algorithms, applications and extensions , 1997, Proceedings Tenth International Conference on VLSI Design.

[31]  Jeannette M. Wing,et al.  Formal methods: state of the art and future directions , 1996, CSUR.

[32]  D. Pradhan,et al.  VERILAT: verification using logic augmentation and transformations , 1996, Proceedings of International Conference on Computer Aided Design.

[33]  Rolf Drechsler,et al.  MORE: an alternative implementation of BDD packages by multi-operand synthesis , 1996, Proceedings EURO-DAC '96. European Design Automation Conference with EURO-VHDL '96 and Exhibition.

[34]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[35]  John Harrison,et al.  Stålmarck's Algorithm as a HOL Derived Rule , 1996, TPHOLs.

[36]  Masahiro Fujita,et al.  Verification of Arithmetic Circuits by Comparing Two Similar Circuits , 1996, CAV.

[37]  Y. Matsunaga.  An efficient equivalence checker for combinational circuits , 1996, 33rd Design Automation Conference Proceedings, 1996.

[38]  Rolf Drechsler,et al.  K*BMDs: a new data structure for verification , 1996, Proceedings ED&TC European Design and Test Conference.

[39]  R. Bryant.  Binary decision diagrams and beyond: enabling technologies for formal verification , 1995, Proceedings of IEEE International Conference on Computer Aided Design (ICCAD).

[40]  S. Minato.  Binary Decision Diagrams and Applications for VLSI CAD , 1995 .

[41]  Ingo Wegener,et al.  Graph Driven BDDs - A New Data Structure for Boolean Functions , 1995, Theor. Comput. Sci..

[42]  E.M. Clarke,et al.  Hybrid decision diagrams. Overcoming the limitations of MTBDDs and BMDs , 1995, Proceedings of IEEE International Conference on Computer Aided Design (ICCAD).

[43]  C. Meinel,et al.  Efficient Boolean Manipulation With OBDD's can be Extended to FBDD's , 1994, IEEE Trans. Computers.

[44]  C. A. J. van Eijk,et al.  Exploiting Structural Similarities in a BDD-Based Verification Method , 1994, TPCD.

[45]  Tomás E. Uribe,et al.  Ordered Binary Decision Diagrams and the Davis-Putnam Procedure , 1994, CCL.

[46]  D. Pradhan,et al.  Recursive learning: a new implication technique for efficient solutions to CAD problems-test, verification, and optimization , 1994, The IEEE International Symposium on Circuits and Systems, 2003. Tutorial Guide: ISCAS 2003..

[47]  Sarma Vrudhula,et al.  EVBDD-based algorithms for integer linear programming, spectral transformation, and function decomposition , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[48]  Rolf Drechsler,et al.  Efficient Representation and Manipulation of Switching Functions Based on Ordered Kronecker Functional Decision Diagrams , 1994, 31st Design Automation Conference.

[49]  R. Bryant,et al.  Verification of Arithmetic Functions with Binary Moment Diagrams , 1994 .

[50]  R. I. Bahar,et al.  Algebraic decision diagrams and their applications , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).

[51]  R. Rudell.  Dynamic variable ordering for ordered binary decision diagrams , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).

[52]  Hiroshige Fujii,et al.  Interleaving based variable ordering methods for ordered binary decision diagrams , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).

[53]  D. Brand.  Verification of large synthesized designs , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).

[54]  Wolfgang Kunz,et al.  HANNIBAL: An efficient tool for logic verification based on recursive learning , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).

[55]  Hiroyuki Ochi,et al.  Breadth-first manipulation of very large binary-decision diagrams , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).

[56]  Roberto Sebastiani,et al.  Applying GSAT to Non-Clausal Formulas , 1993, J. Artif. Intell. Res..

[57]  Edmund M. Clarke,et al.  Symbolic model checking for sequential circuit verification , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[58]  Masahiro Fujita,et al.  Spectral Transforms for Large Boolean Functions with Applications to Technology Mapping , 1993, 30th ACM/IEEE Design Automation Conference.

[59]  Shin-ichi Minato,et al.  Zero-Suppressed BDDs for Set Manipulation in Combinatorial Problems , 1993, 30th ACM/IEEE Design Automation Conference.

[60]  Janak H. Patel,et al.  Efficient variable ordering heuristics for shared ROBDD , 1993, 1993 IEEE International Symposium on Circuits and Systems.

[61]  Aarti Gupta,et al.  Formal hardware verification methods: A survey , 1992, Formal Methods Syst. Des..

[62]  Randal E. Bryant,et al.  Symbolic Boolean manipulation with ordered binary-decision diagrams , 1992, CSUR.

[63]  Wolfgang Rosenstiel,et al.  Multilevel logic synthesis based on functional decision diagrams , 1992, [1992] Proceedings The European Conference on Design Automation.

[64]  Fabio Somenzi,et al.  Extended BDDs: Trading of canonicity for structure in verification algorithms , 1991, Formal Methods Syst. Des..

[65]  Srinivas Devadas,et al.  Boolean satisfiability and equivalence checking using general binary decision diagrams , 1991, [1991 Proceedings] IEEE International Conference on Computer Design: VLSI in Computers and Processors.

[66]  Don E. Ross,et al.  Heuristics to compute variable orderings for efficient manipulation of ordered binary decision diagrams , 1991, 28th ACM/IEEE Design Automation Conference.

[67]  Randal E. Bryant,et al.  Formal hardware verification by symbolic ternary trajectory evaluation , 1991, 28th ACM/IEEE Design Automation Conference.

[68]  Masahiro Fujita,et al.  On variable ordering of binary decision diagrams for the application of multi-level logic synthesis , 1991, Proceedings of the European Conference on Design Automation..

[69]  Eduard Cerny,et al.  Tautology checking using cross-controllability and cross-observability relations , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[70]  R. Bryant,et al.  Efficient implementation of a BDD package , 1990, 27th ACM/IEEE Design Automation Conference.

[71]  Olivier Coudert,et al.  Verification of Synchronous Sequential Machines Based on Symbolic Execution , 1989, Automatic Verification Methods for Finite State Systems.

[72]  Masahiro Fujita,et al.  Evaluation and improvement of Boolean comparison method based on binary decision diagrams , 1988, [1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers.

[73]  Albert R. Wang,et al.  Logic verification using binary decision diagrams in a logic synthesis environment , 1988, [1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers.

[74]  藤田 昌宏,et al.  Evaluation and Improvements of Boolean Comparison Method Based on Binary Decision Diagrams , 1988 .

[75]  A. P. Sistla,et al.  Automatic verification of finite-state concurrent systems using temporal logic specifications , 1986, TOPL.

[76]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.

[77]  Mary Sheeran,et al.  A Tutorial on Stålmarck's Proof Procedure for Propositional Logic , 2000, Formal Methods Syst. Des..

[78]  F. Somenzi.  Binary Decision Diagrams , 1999 .

[79]  Marco Cadoli,et al.  An Algorithm to Evaluate Quanti ed Boolean Formulae , 1998 .

[80]  Robert K. Brayton,et al.  Canonical TBDD's and Their Application to Combinational Verification , 1997 .

[81]  van Caj Koen Eijk,et al.  Formal methods for the verification of digital circuits , 1997 .

[82]  Henrik Reif Andersen,et al.  Combinational Logic-Level Verification using Boolean Expression Diagrams , 1997 .

[83]  Massoud Pedram,et al.  Edge Valued Binary Decision Diagrams , 1996 .

[84]  Dhiraj K. Pradhan,et al.  A novel framework for logic verification in a synthesis environment , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[85]  Masahiro Fujita,et al.  Advanced Verification Techniques Based on Learning , 1995, 32nd Design Automation Conference.

[86]  Srinivas Devadas,et al.  Probabilistic manipulation of Boolean functions using free Boolean diagrams , 1995, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[87]  B. Selman.  A New Method for Solving Hard Satis ability Problems , 1992 .

[88]  P. R. Stephan,et al.  SIS : A System for Sequential Circuit Synthesis , 1992 .

[89]  Seh-Woong Jeong,et al.  Extended BDD's: trading off canonicity for structure in verification algorithms , 1991, 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers.

[90]  E. Clarke,et al.  Symbolic model checking: 1020 states and beyond , 1989, LICS 1989.

[91]  R. Bryant.  Graph-based Algorithm for Boolean Function Manipulation , 1989 .

[92]  F. Brglez,et al.  A neutral netlist of 10 combinational benchmark circuits and a target translator in FORTRAN , 1985 .

[93]  Christoph M. Hoffmann,et al.  Pattern Matching in Trees , 1982, JACM.

[94]  Krister Segerberg,et al.  An Introduction to Modal Logic , 1977 .