Symbolic Reachability Analysis Based on SAT-Solvers

This publication has 14 references indexed in Scilit:

• Symbolic model checking: 1020 States and beyond
  Published by Elsevier ,2004
• Symbolic model checking using SAT procedures instead of BDDs
  Published by Association for Computing Machinery (ACM) ,1999
• Verifying Safety Properties of a PowerPC− Microprocessor Using Symbolic Model Checking without BDDs
  Published by Springer Nature ,1999
• Case Study: Formal Verification of a Computerized Railway Interlocking
  Formal Aspects of Computing, 1998
• The industrial success of verification tools based on stålmarck's method
  Published by Springer Nature ,1997
• SATO: An efficient propositional prover
  Lecture Notes in Computer Science, 1997
• Symbolic Model Checking
  Published by Springer Nature ,1993
• Graph-Based Algorithms for Boolean Function Manipulation
  IEEE Transactions on Computers, 1986
• Automatic verification of finite-state concurrent systems using temporal logic specifications
  ACM Transactions on Programming Languages and Systems, 1986
• Specification and verification of concurrent systems in CESAR
  Published by Springer Nature ,1982