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.

中文翻译：

---

2LS：堆分析和内存安全（竞赛贡献）

2LS 是一个用于分析连续 C 程序的框架，可以验证和反驳程序断言和终止。2LS 框架建立在 CPROVER 基础设施之上，并实现了基于模板的综合技术，例如查找不变量和排序函数，以及增量循环展开技术以查找反例和 k 归纳证明。今年版本的主要改进是 2LS 能够分析需要对动态数据结构的形状和内容进行组合推理的程序，以及内存安全属性的检测。