Memory Management Test-Case Generation of C Programs Using Bounded Model Checking

Rocha, Herbert; Barreto, Raimundo; Cordeiro, Lucas C.

doi:10.1007/978-3-319-22969-0_18

Cited by 6 publications

(1 citation statement)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We compare 13 verifiers that participated successfully in the category Reachsafety-Recursive of SV-COMP. This includes the predicate-based verifiers CPAchecker [35,56], PeSCo [34,49] and Ultimate Automizer [37,39], the bounded model checkers Cbmc [29,42] and Esbmc [36,45], the symbolic-execution tool Symbiotic [24,25], as well as the SMTbased tool Map2Check [51,52]. The binary archives of all verifiers are publicly available.…”

Section: Resultsmentioning

confidence: 99%

Domain-independent interprocedural program analysis using block-abstraction memoization

Beyer

Friedberger

2020

Proceedings of the 28th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Softw

View full text Add to dashboard Cite

Section: Resultsmentioning

confidence: 99%

Domain-independent interprocedural program analysis using block-abstraction memoization

Beyer

Friedberger

2020

Proceedings of the 28th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Softw

View full text Add to dashboard Cite

Automatic Verification of C and Java Programs: SV-COMP 2019

Beyer

2019

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

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 for Java programs. The competition provides a snapshot of the current state of the art in the area, and has a strong focus on replicability of its results. The repository of benchmark verification tasks now supports a new, more flexible format for task definitions (based on YAML), which was a precondition for conveniently benchmarking Java programs in the same controlled competition setting that was successfully applied in the previous years. The competition was based on 10 522 verification tasks for C programs and 368 verification tasks for Java programs. Each verification task consisted of a program and a property (reachability, memory safety, overflows, termination). SV-COMP 2019 had 31 participating verification systems from 14 countries.

show abstract

Advances in Automatic Software Verification: SV-COMP 2020

Beyer

2020

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

This report describes the 2020 Competition on Software Verification (SV-COMP), the 9$$^{\text {th}}$$ edition of a series of comparative evaluations of fully automatic software verifiers for C and Java programs. The competition provides a snapshot of the current state of the art in the area, and has a strong focus on replicability of its results. The competition was based on 11 052 verification tasks for C programs and 416 verification tasks for Java programs. Each verification task consisted of a program and a property (reachability, memory safety, overflows, termination). SV-COMP 2020 had 28 participating verification systems from 11 countries.

show abstract

Memory Management Test-Case Generation of C Programs Using Bounded Model Checking

Cited by 6 publications

References 17 publications

Domain-independent interprocedural program analysis using block-abstraction memoization

Domain-independent interprocedural program analysis using block-abstraction memoization

Automatic Verification of C and Java Programs: SV-COMP 2019

Advances in Automatic Software Verification: SV-COMP 2020

Contact Info

Product

Resources

About