2LS: Heap Analysis and Memory Safety (Competition Contribution) [article]

Viktor Malik, Martin Hruska, Peter Schrammel, Tomas Vojnar
2020 arXiv   pre-print
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
more » ... content of dynamic data structures, and an instrumentation for memory safety properties.
arXiv:1903.00712v2 fatcat:dy3qn7vwuvgkvjxk2kqzxin3za