A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Filters
VeriAbs : Verification by Abstraction and Test Generation (Competition Contribution)
[chapter]
2020
Lecture Notes in Computer Science
It analyzes the structure of loops, and intervals of inputs to choose one of the four verification strategies implemented in VeriAbs. ...
These changes have improved the verification of programs with arrays, and unstructured loops and unstructured control flows. ...
In this version, we additionally derive disjunctive invariants for correctness witnesses using abstract acceleration and abstract interpretation, and add them to the control flow automaton generated by ...
doi:10.1007/978-3-030-45237-7_25
fatcat:5y4nsgyi3jbsxm7e2w7bykn2au
VeriAbs: A Tool for Scalable Verification by Abstraction (Competition Contribution)
[chapter]
2021
Lecture Notes in Computer Science
By this if the program is found to besliceable, sub-programs or slices are generated, and the known strategy selection algorithm of VeriAbs is applied to each slice. ...
The verification results of each slice are then composed to derive that of the entire program. This compositional verification has improved the scalability of VeriAbs and presented in this paper. ...
This is because the invariants are to be derived from various abstractions, some of which are generated by off-the-shelf tools, and not yet extracted. ...
doi:10.1007/978-3-030-72013-1_32
fatcat:37l4xcjhr5g3thvo24ioghic7u
Cooperative Verification via Collective Invariant Generation
[article]
2020
arXiv
pre-print
Software verification has recently made enormous progress due to the development of novel verification methods and the speed-up of supporting technologies like SMT solving. ...
In this paper, we employ cooperative verification in order to avoid reimplementation and enable usage of novel tools as black-box components in verification. ...
INTRODUCTION Recent years have seen a major progress in software verification as for instance witnessed by the annual competition on software verification SV-COMP [2] . ...
arXiv:2008.04551v1
fatcat:zfdf4xbna5fptlb4ucd66vd6du
CoVEGI: Cooperative Verification via Externally Generated Invariants
[chapter]
2021
Lecture Notes in Computer Science
and enable usage of novel tools as black-box components in verification. ...
Our framework named CoVEGI allows a master verification tool to delegate the task of invariant generation to one or several specialized helper invariant generators. ...
We thus looked at current and past participants of the annual competition of software verification SV-COMP [2] for invariant generation. ...
doi:10.1007/978-3-030-71500-7_6
fatcat:uomklhtrfnhrxnbrnvzkxuawni
Advances in Automatic Software Verification: SV-COMP 2020
[chapter]
2020
Lecture Notes in Computer Science
The competition was based on 11 052 verification tasks for C programs and 416 verification tasks for Java programs. ...
This report describes the 2020 Competition on Software Verification (SV-COMP), the 9 th edition of a series of comparative evaluations of fully automatic software verifiers for C and Java programs. ...
The new format was used in SV-COMP 2019 for the Java category [14] and in the competition on software testing, Test-Comp 2019 [15] . ...
doi:10.1007/978-3-030-45237-7_21
fatcat:puu4r3at5zgibduclvflgev7cq
Software Verification with PDR: Implementation and Empirical Evaluation of the State of the Art
[article]
2020
arXiv
pre-print
We contribute a replicable and thorough comparative evaluation of the state of the art: We (1) implemented a standalone PDR algorithm and, as improvement, a PDR-based auxiliary-invariant generator for ...
The main contribution of our work is to establish a reproducible baseline for ongoing research in the area by providing a well-engineered reference implementation and an experimental evaluation of the ...
We are closing this gap by (a) providing a well-engineered implementation of one published adaptation of PDR to software verification, (b) designing and implementing an invariant generator based on the ...
arXiv:1908.06271v2
fatcat:gt4z3tohnrdzteimgsbd2bwxuy
Automatic Verification of C and Java Programs: SV-COMP 2019
[chapter]
2019
Msphere
The competition was based on 10 522 verification tasks for C programs and 368 verification tasks for Java programs. ...
This report describes the 2019 Competition on Software Verification (SV-COMP), the 8 th edition of a series of comparative evaluations of fully automatic software verifiers for C programs, and now also ...
In 2019, the competition was extended to include a Java track. Some of the Java programs existed already in the repository, and many other Java programs were contributed by the community [29] . ...
doi:10.1007/978-3-030-17502-3_9
fatcat:nhfizu64uzhg7e4skftvgjrbyu
Software Verification with PDR: An Implementation of the State of the Art
[chapter]
2020
Lecture Notes in Computer Science
We contribute a replicable and thorough comparative evaluation of the state of the art: We (1) implemented a standalone PDR algorithm and, as improvement, a PDR-based auxiliary-invariant generator for ...
The main contribution of our work is to establish a reproducible baseline for ongoing research in the area by providing a well-engineered reference implementation and an experimental evaluation of the ...
It complements other general approaches to ensure functional correctness, like software testing [31] and interactive software verification [3] . ...
doi:10.1007/978-3-030-45190-5_1
fatcat:itmhnqgelnax7bhrynp7ayjova
Property Checking Array Programs Using Loop Shrinking
[chapter]
2018
Lecture Notes in Computer Science
These methods either fail to abstract the array at the right granularity and are therefore limited in precision or scalability, or they attempt to synthesize an appropriate invariant that is quantified ...
Most verification tools find it difficult to prove properties of programs containing loops that process arrays of large or unknown size. ...
Experiments An early version of the tool VeriAbs competed in the SV-COMP 2017 verification competition [2] , where it ranked third amongst the 17 participating tools in the ArraysReach category. ...
doi:10.1007/978-3-319-89960-2_12
fatcat:tmy2mu7mp5gjlhv642bjgwljhy
Algorithm Selection for Software Verification using Graph Attention Networks
[article]
2022
arXiv
pre-print
We evaluate Graves on a set of 10 verification tools and over 8000 verification problems and find that it improves the state-of-the-art in verification algorithm selection by 11\%. ...
For general users, deciding the best tool for their verification problem is effectively impossible. In this work, we present Graves, a selection strategy based on graph neural networks (GNNs). ...
Army Research Office under grant number W911NF-19-1-0054 and by the DARPA ARCOS program under contract FA8750-20-C-0507. ...
arXiv:2201.11711v2
fatcat:xha5cjfsi5fubi2nzruft27dsm
A Complete Approach to Loop Verification with Invariants and Summaries
[article]
2021
arXiv
pre-print
Moreover, we demonstrate a novel constructive translation between the two approaches, which decouples the chosen specification approach from the verification backend. ...
But despite this advantage, the second approach receives little attention overall, and the goal of this paper is to lift it out of its niche. ...
The treatment of break and goto in with loop contracts has been explored by Johannes Blau. We thank Rustan Leino for the phone number example. ...
arXiv:2010.05812v3
fatcat:d6727fnx4rgnrlwa3upjbaj67i
Verifying Array Manipulating Programs with Full-Program Induction
[chapter]
2020
Lecture Notes in Computer Science
Significantly, this does not require generation or use of loop-specific invariants. We have developed a prototype tool Vajra to assess the efficacy of our technique. ...
Vajra verified 36 benchmarks, compared to 23 verified by VIAP, 12 by VeriAbs, 8 by Booster, 5 each by Vaphor and FreqHorn. ...
Our contribution lies in overcoming these difficulties algorithmically for a large class of programs and assertions, thereby making full-program induction a viable and competitive technique for proving ...
doi:10.1007/978-3-030-45190-5_2
fatcat:bhzseyy3mbgj5eyh7kl7lgnlkm
Verifying Array Manipulating Programs with Full-Program Induction
[article]
2020
arXiv
pre-print
Significantly, this does not require generation or use of loop-specific invariants. We have developed a prototype tool Vajra to assess the efficacy of our technique. ...
Vajra verified 36 benchmarks, compared to 23 verified by VIAP, 12 by VeriAbs, 8 by Booster, 5 each by Vaphor and FreqHorn. ...
Our contribution lies in overcoming these difficulties algorithmically for a large class of programs and assertions, thereby making full-program induction a viable and competitive technique for proving ...
arXiv:2002.09857v1
fatcat:mxn4txmdyjhupadyxfhizejg5m
Inductive Reachability Witnesses
[article]
2020
arXiv
pre-print
Previous works that tackle reachability analysis are either unable to handle programs consisting of general loops (e.g. symbolic execution), or lack completeness guarantees (e.g. abstract interpretation ...
In contrast, we propose a novel approach for reachability analysis that can handle general programs, is (semi-)complete, and can be entirely automated for a wide family of programs. ...
such as test-case generation [Beyer et al. 2004 ]. ...
arXiv:2007.14259v1
fatcat:ycinz34dlnfynakugwlnnbybtu
Interpretation-Based Violation Witness Validation for C: NITWIT
[chapter]
2020
Lecture Notes in Computer Science
This was done by extracting test harnesses and compiling them with the original program. ...
As software verification is gaining traction in academia and industry the number and complexity of verification tools is growing constantly. ...
Data Availability Statement and Acknowledgments. nitwit is available for free at https://github.com/moves-rwth/nitwit-validator and is licensed under the New BSD license. ...
doi:10.1007/978-3-030-45190-5_3
fatcat:7isjjgfvnvctvhmvb72zwjrgdy
« Previous
Showing results 1 — 15 out of 19 results