Decomposing software verification into off-the-shelf components

Beyer, Dirk; Haltermann, Jan; Lemberger, Thomas R.; Wehrheim, Heike

doi:10.1145/3510003.3510064

Cited by 15 publications

(4 citation statements)

References 89 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…While state-of-the-art verification tools usually track the abstraction as data-flow domains (e.g., predicates [17]) over the program states, control-flow abstractions can also be encoded as Fig. 2: General workflow of CEGAR (taken from [12]) abstractions used in CEGAR [2]. CEGAR-PT integrates external, off-the-shelf control-flow transformations into CEGAR, i.e., we eliminate the dependency on the internal program representation of a particular verifier.…”

Section: Cegar For Program Transformationsmentioning

confidence: 99%

“…In order to make program transformations available to all verifiers, we decomposed the CEGAR loop into multiple components, similar to [12]. These components interact via well-defined interfaces, which makes it easy to replace and compare different implementations of the same component.…”

Section: Cegar For Program Transformationsmentioning

confidence: 99%

“…CEGAR-PT adopts the approach of counterexample-guided abstraction refinement (CEGAR) [9,10] to loop abstraction in a modular way. There are two very related results, which paved the road for our investigation: C-CEGAR [12] implements CEGAR in a modular way, using off-the-shelf components. The precision in this approach consists of precisions for predicate-based abstractions, such as predicate abstraction and trace abstraction.…”

Section: Introductionmentioning

confidence: 96%

See 2 more Smart Citations

CEGAR-PT: A Tool for Abstraction by Program Transformation

Beyer,

Lingsch-Rosenfeld,

Spiessl

2023

2023 38th IEEE/ACM International Conference on Automated Software Engineering (ASE)

Self Cite

View full text Add to dashboard Cite

ion is an important approach for proving the correctness of computer programs. There are many implementations of this approach available, but unfortunately, the various implementations are difficult to reuse and combine, and the successful techniques have to be re-implemented in new tools again and again. We address this problem by contributing the tool CEGAR-PT, which views abstraction as program transformation and integrates different verification components off-the-shelf. The idea is to use existing components without having to change their implementation, while still adjusting the precision of the abstraction using the successful CEGAR approach. The approach of CEGAR-PT is largely general: It only restricts the abstraction to transform, given a precision that defines the level of abstraction, one program into another program. The abstraction by program transformation can over-approximate the data flow (e.g., havoc some variables, use more abstract types) or the control flow (e.g., loop abstraction, slicing). To illustrate our tool, we provide a demonstration video, accessible at https://youtu.be/ASZ6hoq8asE.

show abstract

Section: Cegar For Program Transformationsmentioning

confidence: 99%

Section: Cegar For Program Transformationsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 96%

See 1 more Smart Citation

CEGAR-PT: A Tool for Abstraction by Program Transformation

Beyer,

Lingsch-Rosenfeld,

Spiessl

2023

2023 38th IEEE/ACM International Conference on Automated Software Engineering (ASE)

Self Cite

View full text Add to dashboard Cite

show abstract

“…The idea of cooperative verification is to have different sorts of analyses cooperate on the task of software verification. This principle has already been implemented in various forms [16,19,33,59], in particular also as cooperations of testing and verification tools [10,39,41,42]. Such cooperations most often take the form of se-quential combinations, where one tool starts with the full task, stores its partial analysis result within some verification artefact, and the next tool then works on the remaining task.…”

Section: Introductionmentioning

confidence: 99%

Parallel Program Analysis via Range Splitting

Haltermann

Jakobs

Richter

et al. 2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Ranged symbolic execution has been proposed as a way of scaling symbolic execution by splitting the task of path exploration onto several workers running in parallel. The split is conducted along path ranges which – simply speaking – describe sets of paths. Workers can then explore path ranges in parallel.In this paper, we propose ranged analysis as the generalization of ranged symbolic execution to arbitrary program analyses. This allows us to not only parallelize a single analysis, but also run different analyses on different ranges of a program in parallel. Besides this generalization, we also provide a novel range splitting strategy operating along loop bounds, complementing the existing random strategy of the original proposal. We implemented ranged analysis within the tool CPAchecker and evaluated it on programs from the SV-COMP benchmark. The evaluation in particular shows the superiority of loop bounds splitting over random splitting. We furthermore find that compositions of ranged analyses can solve analysis tasks that none of the constituent analysis alone can solve.

show abstract

CoVeriTeam: On-Demand Composition of Cooperative Verification Systems

Beyer

Kanav

2022

Lecture Notes in Computer Science

View full text Add to dashboard Cite

There is no silver bullet for software verification: Different techniques have different strengths. Thus, it is imperative to combine the strengths of verification tools via combinations and cooperation. CoVeriTeam is a language and tool for on-demand composition of cooperative approaches. It provides a systematic and modular way to combine existing tools (without changing them) in order to leverage their full potential. The idea of cooperative verification is that different tools help each other to achieve the goal of correctly solving verification tasks.The language is based on verification artifacts (programs, specifications, witnesses) as basic objects and verification actors (verifiers, validators, testers) as basic operations. We define composition operators that make it possible to easily describe new compositions. Verification artifacts are the interface between the different verification actors. CoVeriTeam consists of a language for composition of verification actors, and its interpreter.As a result of viewing tools as components, we can now create powerful verification engines that are beyond the possibilities of single tools, avoiding to develop certain components repeatedly. We illustrate the abilities of CoVeriTeam on a few case studies. We expect that CoVeriTeam will help verification researchers and practitioners to easily experiment with new tools, and assist them in rapid prototyping of tool combinations.

show abstract

Decomposing software verification into off-the-shelf components

Cited by 15 publications

References 89 publications

CEGAR-PT: A Tool for Abstraction by Program Transformation

CEGAR-PT: A Tool for Abstraction by Program Transformation

Parallel Program Analysis via Range Splitting

CoVeriTeam: On-Demand Composition of Cooperative Verification Systems

Contact Info

Product

Resources

About