An SMT-Based Approach to Coverability Analysis

This publication has 20 references indexed in Scilit:

• Automatic Verification of Erlang-Style Concurrency
  2013
• Algorithmic verification of asynchronous programs
  ACM Transactions on Programming Languages and Systems, 2012
• Bounded Phase Analysis of Message-Passing Programs
  2012
• Efficient Coverability Analysis by Proof Minimization
  2012
• Dynamic Cutoff Detection in Parameterized Concurrent Programs
  Lecture Notes in Computer Science, 2010
• Z3: An Efficient SMT Solver
  2008
• Expand, Enlarge and Check: New algorithms for the coverability problem of WSTS
  Journal of Computer and System Sciences, 2006
• Towards the Automated Verification of Multithreaded Java Programs
  2002
• Verification of Safety Properties Using Integer Programming: Beyond the State Equation
  Formal Methods in System Design, 2000
• Reasoning about systems with many processes
  Journal of the ACM, 1992