Conference ProceedingsOPEN ACCESS

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

Lecture Notes in Computer Science (2020) 12079 LNCS 368-372
DOI: 10.1007/978-3-030-45237-7_22
9Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

2LS is a framework for analysis of sequential C programs based on the CPROVER infrastructure and template-based synthesis techniques for checking both safety and termination. The paper presents the main improvements done in 2LS since 2018, which concern mainly the way 2LS handles dynamically allocated objects and structures as well as combinations of abstract domains.

Cite

CITATION STYLE

APA

Malík, V., Schrammel, P., & Vojnar, T. (2020). 2LS: Heap Analysis and Memory Safety: (Competition Contribution). In Lecture Notes in Computer Science (Vol. 12079 LNCS, pp. 368–372). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-45237-7_22

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free