2LS is a framework for analysis of sequential C programs that can verify and refute program assertions and termination. The 2LS framework is built upon the CPROVER infrastructure and implements template-based synthesis techniques, e.g. to find invariants and ranking functions, and incremental loop unwinding techniques to find counterexamples and k-induction proofs. The main improvements in this year's version are the ability of 2LS to analyse programs requiring combined reasoning about shape and content of dynamic data structures, and an instrumentation for memory safety properties.
@article{arxiv.1903.00712,
title = {2LS: Heap Analysis and Memory Safety (Competition Contribution)},
author = {Viktor Malik and Martin Hruska and Peter Schrammel and Tomas Vojnar},
journal= {arXiv preprint arXiv:1903.00712},
year = {2020}
}
Comments
System description for contribution to Software Verification Competition (SV-COMP) 2019