A Satisfiability-Based Approach to Abstraction Refinement in Model Checking

This publication has 10 references indexed in Scilit:

• Verification of proofs of unsatisfiability for CNF formulas
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2003
• Automatic Abstraction without Counterexamples
  Published by Springer Nature ,2003
• Property Checking via Structural Analysis
  Published by Springer Nature ,2002
• SATIRE
  Published by Association for Computing Machinery (ACM) ,2001
• Chaff
  Published by Association for Computing Machinery (ACM) ,2001
• Formal property verification by abstraction refinement with formal, simulation and hybrid engines
  Published by Association for Computing Machinery (ACM) ,2001
• Combining Decision Diagrams and SAT Procedures for Efficient Symbolic Model Checking
  Published by Springer Nature ,2000
• Symbolic Model Checking without BDDs
  Published by Springer Nature ,1999
• Graph-Based Algorithms for Boolean Function Manipulation
  IEEE Transactions on Computers, 1986
• Defining liveness
  Information Processing Letters, 1985