SMT-Based Bounded Model Checking for Embedded ANSI-C Software

Cordeiro, Lucas C.; Fischer, Bernd; Marques-Silva, João

doi:10.1109/ase.2009.63

Cited by 118 publications

(154 citation statements)

References 19 publications

Supporting

Mentioning

148

Contrasting

Unclassified

Order By: Relevance

“…In our experiments, we have used ESBMC v1.15.1 together with Z3 v2.11 [10], which was the most efficient SMT solver in our previous experiments [8]. ESBMC and the benchmarks are available at http://users.ecs.soton.ac.uk/lcc08r/esbmc/.…”

Section: Experimental Evaluationmentioning

confidence: 99%

“…We build this by first executing the gotoprogram of Figure 1(b) sequentially, i.e., in the same order that the threads are created. In this case, we first execute the statements of t1 (i.e., lines 3-5), followed by the statements of t2 (i.e., lines [8][9][10][11][12]. The initial node of the RT fragment is ν0 = (t0, 0, s0, (L16, true), (L2, true), (L7, true) ), i.e., the main thread t0 is active at line 16, the program is before the first context switch, the state s0 has x = 0 and y undefined, and both threads t1 and t2 have just been started, i.e., are at their initial location with guards true.…”

Section: R5mentioning

confidence: 99%

“…In our prior work [8], we extended the encodings from previous SMT-based BMC [1,12] to provide more accurate support for variables of finite bit width, bit-vector operations, arrays, structures, unions and pointers, and implemented these in the ESBMC tool, which is built on top of the CBMC model checker [5]. Here, we continue this work and develop and evaluate three related approaches for model checking multi-threaded ANSI-C software.…”

Section: Introductionmentioning

confidence: 99%

“…In an attempt to cope with growing system complexity, Boolean Satisfiability (SAT) solvers are increasingly replaced by Satisfiability Modulo Theories (SMT) solvers to prove the generated verification conditions (VCs) [1,8,12]. There have also been attempts to extend BMC to the verification of multi-threaded software [13,16,17,25].…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Verifying multi-threaded software using smt-based context-bounded model checking

Cordeiro

Fischer

2011

Proceedings of the 33rd International Conference on Software Engineering

Self Cite

107

View full text Add to dashboard Cite

We describe and evaluate three approaches to model check multi-threaded software with shared variables and locks using bounded model checking based on Satisfiability Modulo Theories (SMT) and our modelling of the synchronization primitives of the Pthread library. In the lazy approach, we generate all possible interleavings and call the SMT solver on each of them individually, until we either find a bug, or have systematically explored all interleavings. In the schedule recording approach, we encode all possible interleavings into one single formula and then exploit the high speed of the SMT solvers. In the underapproximation and widening approach, we reduce the state space by abstracting the number of interleavings from the proofs of unsatisfiability generated by the SMT solvers. In all three approaches, we bound the number of context switches allowed among threads in order to reduce the number of interleavings explored. We implemented these approaches in ESBMC, our SMT-based bounded model checker for ANSI-C programs. Our experiments show that ESBMC can analyze larger problems and substantially reduce the verification time compared to stateof-the-art techniques that use iterative context-bounding algorithms or counter-example guided abstraction refinement.

show abstract

Section: Experimental Evaluationmentioning

confidence: 99%

Section: R5mentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Verifying multi-threaded software using smt-based context-bounded model checking

Cordeiro

Fischer

2011

Proceedings of the 33rd International Conference on Software Engineering

Self Cite

107

View full text Add to dashboard Cite

show abstract

“…BMC generates verification conditions (VCs) that reflect the exact path in which a statement is executed, the context in which a given function is called, and the bit-accurate representation of the expressions. Proving the validity of these VCs remains the main performance bottleneck in verifying large embedded software, despite attempts to cope with increasing system complexity by applying SMT (Satisfiability Modulo Theories) [3,8,10] solvers.…”

Section: Introductionmentioning

confidence: 99%

SMT-based bounded model checking for multi-threaded software in embedded systems

Cordeiro

2010

Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering - Volume 2

Self Cite

View full text Add to dashboard Cite

The transition from single-core to multi-core processors has made multi-threaded software an important subject over the last years in computer-aided verification. Model checkers have been successfully applied to discover subtle errors, but they suffer from combinatorial state space explosion when verifying multi-threaded software. In our previous work, we have extended the encodings from SMT-based bounded model checking (BMC) to provide more accurate support for program verification and to use different background theories and solvers in order to improve scalability and precision in a completely automatic way. We now focus on extending this work to support an SMT-based BMC formulation of multithreaded software which allows the state space to be reduced by abstracting the number of state variables and interleavings from the proof of unsatisfiability generated by the SMT solvers. The core idea of our approach aims to extract the proof objects produced by the SMT solvers in order to control the number of interleavings and to remove logic that is not relevant to a given property. This work aims to develop a new algorithmic method and corresponding tools based on SMT to verify embedded software in multi-core systems.

show abstract

SMT‐based context‐bounded model checking for CUDA programs

Pereira

Albuquerque

Silva

et al. 2016

Concurrency and Computation

Self Cite

View full text Add to dashboard Cite

We present ESBMC-GPU tool, an extension to the Efficient SMT-Based Context-Bounded Model Checker (ESBMC), which is aimed at verifying Graphics Processing Unit (GPU) programs written for the Compute Unified Device Architecture (CUDA) platform. ESBMC-GPU uses an operational model, that is, an abstract representation of the standard CUDA libraries, which conservatively approximates their semantics, in order to verify CUDA-based programs. It then explicitly explores the possible interleavings (up to the given context bound), while treats each interleaving itself symbolically. Additionally, ESBMC-GPU employs the monotonic partial order reduction and the two-thread analysis to prune the state space exploration. Experimental results show that ESBMC-GPU can successfully verify 82% of all benchmarks, while keeping lower rates of false results. Going further than previous attempts, ESBMC-GPU is able to detect more properties violations than other existing GPU verifiers due to its ability to verify errors of the program execution flow and to detect array out-of-bounds and data race violations. exploration, similar to Cordeiro et al. [4]. In particular, we explicitly explore the possible interleavings (up to the given context bound), while we treat each interleaving itself symbolically w.r.t. a given property.To prune the state-space exploration, we apply Monotonic Partial Order Reduction (MPOR) [12] to CUDA programs, which eliminates redundant interleavings without missing any behavior that can be exhibited by the program. We have modified the MPOR algorithm to identify transitions between threads that accessed different memory locations in the same array. Because CUDA kernels typically produce regular and independent access to explore the benefits of the GPU execution model, the application of MPOR routinely leads to substantial performance improvements in most benchmarks. Thus, using operational models that simulate CUDA libraries, together with MPOR implementation in ESBMC-GPU, we achieve significant (correct) results of CUDA kernels verification, primarily when compared with other state-of-the-art GPU verifiers [3,[7][8][9]. Additionally, the present approach considers low-level aspects related to dynamic memory allocation, data transfer, memory deallocation, and overflow. Such violations are typically present in CUDA programs, however, they are routinely ignored by most GPU verifiers. Thus, we provide a more precise verification than other existing approaches, considering soundness of data passed by the main program to the kernel, with the drawback of leading to a higher verification time. ContributionsWe make four major contributions:we extend benefits of SMT-based context-bounded model checking for CUDA programs, in the context of parallel programming for GPUs, to detect more failures than other existing approaches, while keeping lower rates of false results; although SMT-based context-bounded model checking is not a novel technique, we have not seen in the literature its application to verify CUDA programs. this wor...

show abstract

SMT-Based Bounded Model Checking for Embedded ANSI-C Software

Abstract: Abstract

Cited by 118 publications

References 19 publications

Verifying multi-threaded software using smt-based context-bounded model checking

Verifying multi-threaded software using smt-based context-bounded model checking

SMT-based bounded model checking for multi-threaded software in embedded systems

SMT‐based context‐bounded model checking for CUDA programs

Contact Info

Product

Resources

About