Learn More
ESBMC is a context-bounded symbolic model checker for single-and multi-threaded ANSI-C code. It converts the verification conditions using different background theories and passes them directly to an SMT solver. 1 Overview ESBMC is a context-bounded symbolic model checker that allows the verification of single-and multi-threaded C code with shared variables(More)
We have implemented an improved memory model for ESBMC which better takes into account C's memory alignment rules and optimizes the generated SMT formulae. This simultaneously improves ESBMC's precision and performance. 1 Overview ESBMC is a context-bounded symbolic model checker that allows the verification of single-and multi-threaded C code with shared(More)
We extended ESBMC to exploit the combination of context-bounded symbolic model checking and k-induction to prove safety properties in single-and multi-threaded ANSI-C programs with unbounded loops. We now first try to verify by induction that the safety property holds in the system. If that fails, we search for a bounded reachable state that constitutes a(More)
Context-bounded model checking has successfully been used to verify safety properties in multi-threaded systems automatically, even if they are implemented in low-level programming languages like ANSI-C. In this paper, we describe and experiment with an approach to extend context-bounded model checking to liveness properties expressed in linear-time(More)
Context-bounded model checking has been used successfully to verify safety properties in multi-threaded systems automatically, even if they are implemented in low-level programming languages such as C. In this paper, we describe and experiment with an approach to extend context-bounded software model checking to safety and liveness properties expressed in(More)
We describe the application of ESBMC, a symbolic bounded model checker for C programs, to the 2012 RERS greybox challenge. We checked the reachability properties via reachability of the error labels, and the behavioral properties via a bounded LTL model checking approach. Our approach could solve about 700 properties for the small and medium problems from(More)
An evaluation of the current status of two novel clusters, running Linux and NT, has been made to assess their performance for parallel CFD calculations. The core algorithm of the code is the conjugate gradient method used to solve the pressure equation. For good performance, a low latency and high bandwidth is required and the results indicate that,(More)