Using Off-the-Shelf Exception Support Components in C++ Verification

Štill, Vladimír; Ročkai, Petr; Barnat, Jǐŕı

doi:10.1109/qrs.2017.15

Cited by 6 publications

(7 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The authors also claim DIVINE as the first model checker that can verify exception handling in C++ programs, as opposed to what has been stated by Ramalho et al [24]. However, ESBMC v1.23 (i.e., the version used by Ramalho et al [24]) is able to correctly verify the example presented by Roc ˇkai, Barnat and Brim [67], generating and verifying 10 VCs in less than 1 s. Our experimental evaluation shows that ESBMC outperforms DIVINE in handling exceptions as well as for the support of standard containers, inheritance, and polymorphism (cf. Section 6).…”

Section: Sniffer Applicationmentioning

confidence: 88%

“…When it comes to the verification of C++ programs, most of the model checkers available in the literature focus their verification approach on specific C++ features, such as exception handling, and end up neglecting other features of equal importance, such as the verification of the STL [66,67]. Table 3 shows a comparison among other studies available in the literature and our approach.…”

Section: Sniffer Applicationmentioning

confidence: 99%

“…Nonetheless, this translation process might cause some irregularities to the verification process once it loses high-level information about the C++ program structure (i.e., the relationship between the classes). To tackle such issues in the verification process of exception handling structures, Štill, Roc ˇkai and Barnat [67] propose a new API for DIVINE to properly map and deal with exception handling in C++ programs, based on a study about the C++ and LLVM exception handling mechanisms [66]. The authors also claim DIVINE as the first model checker that can verify exception handling in C++ programs, as opposed to what has been stated by Ramalho et al [24].…”

Section: Sniffer Applicationmentioning

confidence: 99%

See 2 more Smart Citations

Model checking C++ programs

Monteiro

Gadelha

Cordeiro

2021

Software Testing Verif & Rel

View full text Add to dashboard Cite

In the last three decades, memory safety issues in system programming languages such as C or C++ have been one of the most significant sources of security vulnerabilities. However, there exist only a few attempts with limited success to cope with the complexity of C++ program verification. We describe and evaluate a novel verification approach based on bounded model checking (BMC) and satisfiability modulo theories (SMT) to verify C++ programs. Our verification approach analyses bounded C++ programs by encoding into SMT various sophisticated features that the C++ programming language offers, such as templates, inheritance, polymorphism, exception handling, and the Standard Template Libraries. We formalize these features within our formal verification framework using a decidable fragment of first-order logic and then show how state-of-the-art SMT solvers can efficiently handle that. We implemented our verification approach on top of ESBMC. We compare ESBMC to LLBMC and DIVINE, which are state-of-the-art verifiers to check C++ programs directly from the LLVM bitcode. Experimental results show that ESBMC can handle a wide range of C++ programs, presenting a higher number of correct verification results. Additionally, ESBMC has been applied to a commercial C++ application in the telecommunication domain and successfully detected arithmetic-overflow errors, which could potentially lead to security vulnerabilities.

show abstract

Section: Sniffer Applicationmentioning

confidence: 88%

Section: Sniffer Applicationmentioning

confidence: 99%

Section: Sniffer Applicationmentioning

confidence: 99%

See 1 more Smart Citation

Model checking C++ programs

Monteiro

Gadelha

Cordeiro

2021

Software Testing Verif & Rel

View full text Add to dashboard Cite

show abstract

“…When it comes to the verification of C++ programs, most of the model checkers available in the literature focus their verification approach on specific C++ features, such as exception handling, and end up neglecting other features of equal importance, such as the verification of the STL [66,67]. Table III shows a comparison among other studies available in the literature and our approach.…”

Section: Related Workmentioning

confidence: 99%

Model Checking C++ Programs

Monteiro¹,

Gadelha²,

Cordeiro³

2021

Preprint

View full text Add to dashboard Cite

In the last three decades, memory safety issues in system programming languages such as C or C++ have been one of the significant sources of security vulnerabilities. However, there exist only a few attempts with limited success to cope with the complexity of C++ program verification. Here we describe and evaluate a novel verification approach based on bounded model checking (BMC) and satisfiability modulo theories (SMT) to verify C++ programs formally. Our verification approach analyzes bounded C++ programs by encoding into SMT various sophisticated features that the C++ programming language offers, such as templates, inheritance, polymorphism, exception handling, and the Standard C++ Libraries. We formalize these features within our formal verification framework using a decidable fragment of first-order logic and then show how state-of-the-art SMT solvers can efficiently handle that. We implemented our verification approach on top of ESBMC. We compare ESBMC to LLBMC and DIVINE, which are state-of-the-art verifiers to check C++ programs directly from the LLVM bitcode. Experimental results show that ESBMC can handle a wide range of C++ programs, presenting a higher number of correct verification results. At the same time, it reduces the verification time if compared to LLBMC and DIVINE tools. Additionally, ESBMC has been applied to a commercial C++ application in the telecommunication domain and successfully detected arithmetic overflow errors, potentially leading to security vulnerabilities.

show abstract

“…When DiOS runs natively, the host version of libunwind is used, the same as with setjmp. When executing in DiVM, DiOS supplies its own implementation of the libunwind API, as described in [19].…”

Section: C++ Support Librariesmentioning

confidence: 99%

Reproducible Execution of POSIX Programs with DiOS

Ročkai

Baranová

Mrázek

et al. 2019

Software Engineering and Formal Methods

View full text Add to dashboard Cite

In this paper, we describe DiOS, a lightweight model operating system which can be used to execute programs that make use of POSIX APIs. Such executions are fully reproducible: running the same program with the same inputs twice will result in two exactly identical instruction traces, even if the program uses threads for parallelism. DiOS is implemented almost entirely in portable C and C++: although its primary platform is DiVM, a verification-oriented virtual machine, it can be configured to also run in KLEE, a symbolic executor. Finally, it can be compiled into machine code to serve as a user-mode kernel. Additionally, DiOS is modular and extensible. Its various components can be combined to match both the capabilities of the underlying platform and to provide services required by a particular program. New components can be added to cover additional system calls or APIs. The experimental evaluation has two parts. DiOS is first evaluated as a component of a program verification platform based on DiVM. In the second part, we consider its portability and modularity by combining it with the symbolic executor KLEE.

show abstract

Using Off-the-Shelf Exception Support Components in C++ Verification

Cited by 6 publications

References 14 publications

Model checking C++ programs

Model checking C++ programs

Model Checking C++ Programs

Reproducible Execution of POSIX Programs with DiOS

Contact Info

Product

Resources

About