Boosting combinatorial search through randomization
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
FPGA '99 Proceedings of the 1999 ACM/SIGDA seventh international symposium on Field programmable gate arrays
GRASP: A Search Algorithm for Propositional Satisfiability
IEEE Transactions on Computers
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
On external memory graph traversal
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A machine program for theorem-proving
Communications of the ACM
Proceedings of the 38th annual Design Automation Conference
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Alloy: a lightweight object modelling notation
ACM Transactions on Software Engineering and Methodology (TOSEM)
Stålmarck's Algorithm as a HOL Derived Rule
TPHOLs '96 Proceedings of the 9th International Conference on Theorem Proving in Higher Order Logics
Faster Proof Checking in the Edinburgh Logical Framework
CADE-18 Proceedings of the 18th International Conference on Automated Deduction
BerkMin: A Fast and Robust Sat-Solver
Proceedings of the conference on Design, automation and test in Europe
Using Counter Example Guided Abstraction Refinement to Find Complex Bugs
Proceedings of the conference on Design, automation and test in Europe - Volume 1
Refining the SAT decision ordering for bounded model checking
Proceedings of the 41st annual Design Automation Conference
Jedd: a BDD-based relational extension of Java
Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation
Iterative Abstraction using SAT-based BMC with Proof Analysis
Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
Inferring Specifications to Detect Errors in Code
Proceedings of the 19th IEEE international conference on Automated software engineering
A Faster Counterexample Minimization Algorithm Based on Refutation Analysis
Proceedings of the conference on Design, Automation and Test in Europe - Volume 2
Proceedings of the conference on Design, Automation and Test in Europe - Volume 2
Verification of Embedded Memory Systems using Efficient Memory Modeling
Proceedings of the conference on Design, Automation and Test in Europe - Volume 2
Dynamic abstraction using SAT-based BMC
Proceedings of the 42nd annual Design Automation Conference
Lemma Exchange in a Microcontroller Based Parallel SAT Solver
ISVLSI '05 Proceedings of the IEEE Computer Society Annual Symposium on VLSI: New Frontiers in VLSI Design
Model Checking C Programs Using F-SOFT
ICCD '05 Proceedings of the 2005 International Conference on Computer Design
Functional test generation based on word-level SAT
Journal of Systems Architecture: the EUROMICRO Journal
Incremental deductive & inductive reasoning for SAT-based bounded model checking
Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design
Efficient computation of small abstraction refinements
Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design
Strong conflict analysis for propositional satisfiability
Proceedings of the conference on Design, automation and test in Europe: Proceedings
Propositional Satisfiability and Constraint Programming: A comparative survey
ACM Computing Surveys (CSUR)
Interpolant Learning and Reuse in SAT-Based Model Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
OPIUM: Optimal Package Install/Uninstall Manager
ICSE '07 Proceedings of the 29th international conference on Software Engineering
Inferring specifications to detect errors in code
Automated Software Engineering
Compressing Propositional Refutations
Electronic Notes in Theoretical Computer Science (ENTCS)
On resolution proofs for combinational equivalence
Proceedings of the 44th annual Design Automation Conference
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Using unsatisfiable cores to debug multiple design errors
Proceedings of the 18th ACM Great Lakes symposium on VLSI
Relations as an abstraction for BDD-based program analysis
ACM Transactions on Programming Languages and Systems (TOPLAS)
Algorithms for maximum satisfiability using unsatisfiable cores
Proceedings of the conference on Design, automation and test in Europe
A fast approximation algorithm for MIN-ONE SAT
Proceedings of the conference on Design, automation and test in Europe
Model checking with Boolean Satisfiability
Journal of Algorithms
Efficient SAT-based bounded model checking for software verification
Theoretical Computer Science
Axiom Pinpointing in General Tableaux
TABLEAUX '07 Proceedings of the 16th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Pinpointing in the Description Logic $\mathcal {EL}^+$
KI '07 Proceedings of the 30th annual German conference on Advances in Artificial Intelligence
An approach for extracting a small unsatisfiable core
Formal Methods in System Design
LCF-Style Propositional Simplification with BDDs and SAT Solvers
TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
Trust and Automation in Verification Tools
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Efficient Generation of Unsatisfiability Proofs and Cores in SAT
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Data Compression for Proof Replay
Journal of Automated Reasoning
Invariant-strengthened elimination of dependent state elements
Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design
Contradictory antecedent debugging in bounded model checking
Proceedings of the 19th ACM Great Lakes symposium on VLSI
Formalization and Implementation of Modern SAT Solvers
Journal of Automated Reasoning
Verification Techniques for System-Level Design
Verification Techniques for System-Level Design
Reconfigurable Computing: The Theory and Practice of FPGA-Based Computation
Reconfigurable Computing: The Theory and Practice of FPGA-Based Computation
On Extending Bounded Proofs to Inductive Proofs
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Improved Conflict-Clause Minimization Leads to Improved Propositional Proof Traces
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Width-Based Restart Policies for Clause-Learning Satisfiability Solvers
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Automated deduction for verification
ACM Computing Surveys (CSUR)
A Deductive System for FO(ID) Based on Least Fixpoint Logic
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Evaluating and certifying QBFs: A comparison of state-of-the-art tools
AI Communications
Integrating a SAT Solver with an LCF-style Theorem Prover
Electronic Notes in Theoretical Computer Science (ENTCS)
Practical algorithms for unsatisfiability proof and core generation in SAT solvers
AI Communications - Practical Aspects of Automated Reasoning
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Reachability for linear hybrid automata using iterative relaxation abstraction
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
Checking pedigree consistency with PCS
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Verifying propositional unsatisfiability: pitfalls to avoid
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Compressing propositional proofs by common subproof extraction
EUROCAST'07 Proceedings of the 11th international conference on Computer aided systems theory
Fast reflexive arithmetic tactics the linear case and beyond
TYPES'06 Proceedings of the 2006 international conference on Types for proofs and programs
Towards more effective unsatisfiability-based maximum satisfiability algorithms
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
A modular CNF-based SAT solver
SBCCI '10 Proceedings of the 23rd symposium on Integrated circuits and system design
Synthesizing complementary circuits automatically
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Making deduction more effective in SAT solvers
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Formal verification of a modern SAT solver by shallow embedding into Isabelle/HOL
Theoretical Computer Science
Property analysis and design understanding
Proceedings of the Conference on Design, Automation and Test in Europe
Industrial-strength certified SAT solving through verified SAT proof checking
ICTAC'10 Proceedings of the 7th International colloquium conference on Theoretical aspects of computing
Natural domain SMT: a preliminary assessment
FORMATS'10 Proceedings of the 8th international conference on Formal modeling and analysis of timed systems
Reasoning and explanation in EL and in expressive description logics
ReasoningWeb'10 Proceedings of the 6th international conference on Semantic technologies for software engineering
A Framework for Certified Boolean Branch-and-Bound Optimization
Journal of Automated Reasoning
MBEERTS'07 Proceedings of the 2007 International Dagstuhl conference on Model-based engineering of embedded real-time systems
Rewriting, inference, and proof
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
Information flow analysis via path condition refinement
FAST'10 Proceedings of the 7th International conference on Formal aspects of security and trust
An efficient and flexible approach to resolution proof reduction
HVC'10 Proceedings of the 6th international conference on Hardware and software: verification and testing
On improving MUS extraction algorithms
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
On interpolation in decision procedures
TABLEAUX'11 Proceedings of the 20th international conference on Automated reasoning with analytic tableaux and related methods
Extended resolution proofs for conjoining BDDs
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Deciding separation logic formulae by SAT and incremental negative cycle elimination
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Minimizing counterexample with unit core extraction and incremental SAT
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
Reduction of interpolants for logic synthesis
Proceedings of the International Conference on Computer-Aided Design
Web explanations for semantic heterogeneity discovery
ESWC'05 Proceedings of the Second European conference on The Semantic Web: research and Applications
SMT techniques for fast predicate abstraction
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Efficient conflict analysis for finding all satisfying assignments of a boolean circuit
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Interleaved invariant checking with dynamic abstraction
CHARME'05 Proceedings of the 13 IFIP WG 10.5 international conference on Correct Hardware Design and Verification Methods
Automated testing and debugging of SAT and QBF solvers
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Two techniques for minimizing resolution proofs
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Extended resolution proofs for symbolic SAT solving with quantification
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
On solving the partial MAX-SAT problem
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
SAT-Based verification methods and applications in hardware verification
SFM'06 Proceedings of the 6th international conference on Formal Methods for the Design of Computer, Communication, and Software Systems
SAT-Based software certification
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Efficient abstraction refinement in interpolation-based unbounded model checking
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Towards a notion of unsatisfiable and unrealizable cores for LTL
Science of Computer Programming
Generating Invariant-Based Certificates for Embedded Systems
ACM Transactions on Embedded Computing Systems (TECS)
Conflict-driven answer set solving: From theory to practice
Artificial Intelligence
Read-once resolution for unsatisfiability-based Max-SAT algorithms
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
An overview of parallel SAT solving
Constraints
Parallel search for maximum satisfiability
AI Communications - 18th RCRA International Workshop on “Experimental evaluation of algorithms for solving problems with combinatorial explosion”
Towards efficient MUS extraction
AI Communications - 18th RCRA International Workshop on “Experimental evaluation of algorithms for solving problems with combinatorial explosion”
Restoring CSP Satisfiability with MaxSAT
Fundamenta Informaticae - RCRA 2009 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
Improvements to core-guided binary search for MaxSAT
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
SAT and SMT are still resolution: questions and challenges
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Model-driven construction of certified binaries
MODELS'07 Proceedings of the 10th international conference on Model Driven Engineering Languages and Systems
Producing and verifying extremely large propositional refutations
Annals of Mathematics and Artificial Intelligence
Lower bounds and upper bounds for MaxSAT
LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
Multi-threaded asp solving with clasp
Theory and Practice of Logic Programming
Optimization techniques for craig interpolant compaction in unbounded model checking
Proceedings of the Conference on Design, Automation and Test in Europe
Verifying refutations with extended resolution
CADE'13 Proceedings of the 24th international conference on Automated Deduction
Computing interpolants without proofs
HVC'12 Proceedings of the 8th international conference on Hardware and Software: verification and testing
Mechanical verification of SAT refutations with extended resolution
ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
On computing minimal correction subsets
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
As the use of SAT solvers as core engines in EDA applications grows, it becomes increasingly important to validate their correctness. In this paper, we describe the implementation of an independent resolution-based checking procedure that can check the validity of unsatisfiable claims produced by the SAT solver zchaff. We examine the practical implementation issues of such a checker and describe two implementations with different pros and cons. Experimental results show low overhead for the checking process. Our checker can work with many other modern SAT solvers with minor modifications, and it can provide information for debugging when checking fails. Finally we describe additional results that can be obtained by the validation process and briefly discuss their applications.