Propelling SAT and SAT-based BMC using careset

No abstract is available for this paper.

• Publication year

  2010

• Venue

  Formal Methods in Computer-Aided Design

• Publication date

  2010-10-20

• Fields of study

  Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A machine program for theorem-proving

  2011cited by this paper
• P{re,i}cosat@sc'09 Picosat 193

  2009cited by this paper
• Justification-Based Non-Clausal Local Search for SAT

  2008influential reference
• Efficient SAT-based bounded model checking for software verification

  2008influential reference
• PicoSAT Essentials

  2008cited by this paper
• The Effect of Restarts on the Efficiency of Clause Learning

  2007cited by this paper
• Limitations of restricted branching in clause learning

  2007cited by this paper
• SAT-Based Scalable Formal Verification Solutions

  2007cited by this paper
• SWORD: A SAT like prover using word level information

  2007cited by this paper
• Influence of cultivation temperature on the ligninolytic activity of selected fungal strains

  2006influential reference
• Accelerating High-level Bounded Model Checking

  2006cited by this paper
• Effective Preprocessing in SAT Through Variable and Clause Elimination

  2005influential reference
• Considering circuit observability don't cares in CNF satisfiability

  2005influential reference
• Backbones and Backdoors in Satisfiability

  2005influential reference
• Towards Understanding and Harnessing the Potential of Clause Learning

  2004influential reference
• Effective Preprocessing with Hyper-Resolution and Equality Reduction

  2003cited by this paper
• Backdoors To Typical Case Complexity

  2003cited by this paper
• Solving difficult SAT instances in the presence of symmetry

  2002cited by this paper
• Combining strengths of circuit-based and CNF-based algorithms for a high-performance SAT solver

  2002influential reference
• Recovering and Exploiting Structural Knowledge from CNF Formulas

  2002cited by this paper
• Dependent and Independent Variables in Propositional Satisfiability

  2002cited by this paper
• Chaff: engineering an efficient SAT solver

  2001cited by this paper
• Efficient conflict driven learning in a Boolean satisfiability solver

  2001cited by this paper
• Tuning SAT Checkers for Bounded Model Checking

  2000influential reference
• Symbolic Model Checking without BDDs

  1999cited by this paper
• Determining computational complexity from characteristic ‘phase transitions’

  1999cited by this paper
• Act, and the Rest Will Follow: Exploiting Determinism in Planning as Satisfiability

  1998cited by this paper
• Boosting Combinatorial Search Through Randomization

  1998cited by this paper
• Clustering at the Phase Transition

  1997cited by this paper
• Exploiting Variable Dependency in Local Search

  1997cited by this paper
• GRASP-A new search algorithm for satisfiability

  1996cited by this paper
• Branching rules for satisfiability

  1995cited by this paper
• Experimental Results on the Application of Satisfiability Algorithms to Scheduling Problems

  1994cited by this paper
• The Relative Efficiency of Propositional Proof Systems

  1979cited by this paper

• Towards better heuristics for solving bounded model checking problems

  2022cites this paper
• Debugging RTL Using Structural Dominance

  2014influential citation
• Solving AI Planning Problems with SAT

  2013cites this paper
• Removal of Quantifiers by Elimination of Boundary Points

  2012cites this paper
• Quantifier elimination by dependency sequents

  2012cites this paper
• SAT-based Automated Design Debugging: Improvements and Application to Low-power Design

  2012cites this paper