Implementing backward bounded model checking in CPAchecker
Backward bounded model checking is a technique for program analysis that aims to solve the error location reachability problem by searching for...
Scaling Formal Verification: Parallel Analysis of Functions
Formal methods have been known to be useful for verifying critical software. However, one of the main factors keeping tools such as CPA-Checker from...
Reverse Program Synthesis for Backward Reachability Analysis in CPAchecker
CPAchecker now supports reachability analysis, which can search for a path from the initial program location to the error location. This project is a...
Integrating the SMT solver dReal to the framework JavaSMT
SMT solvers are widely utilized in computer-guided verification of computer programs and artificial intelligence. With a multitude of theories...