Approximate Quantifier Elimination for Propositional Boolean Formulae
- 1 January 2011
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Automatic Abstraction for Intervals Using Boolean FormulaeLecture Notes in Computer Science, 2010
- Ranking Function Synthesis for Bit-Vector RelationsLecture Notes in Computer Science, 2010
- A View from the Engine Room: Computational Support for Symbolic Model CheckingLecture Notes in Computer Science, 2008
- A Tool for Checking ANSI-C ProgramsLecture Notes in Computer Science, 2004
- Bounded Model Checking Using Satisfiability SolvingFormal Methods in System Design, 2001
- Unveiling the ISCAS-85 benchmarks: a case study in reverse engineeringIEEE Design & Test of Computers, 1999
- Two classes of Boolean functions for dependency analysisScience of Computer Programming, 1998
- A practical framework for demand-driven interprocedural data flow analysisACM Transactions on Programming Languages and Systems, 1997
- Symbolic Boolean manipulation with ordered binary-decision diagramsACM Computing Surveys, 1992
- Symbolic model checking: 1020 States and beyondInformation and Computation, 1992