UCL Discovery
UCL home » Library Services » Electronic resources » UCL Discovery

Separation logic modulo theories

Navarro Peŕez, JA; Rybalchenko, A; (2013) Separation logic modulo theories. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) , 8301 90 - 106. 10.1007/978-3-319-03542-0_7. Green open access

[thumbnail of Navarro_Perez_1303.2489v1.pdf]

Download (189kB)


Logical reasoning about program behaviours often requires dealing with heap structures as well as scalar data types. Advances in Satisfiability Modulo Theories (SMT) offer efficient procedures for dealing with scalar values, yet they lack expressive support for dealing with heap structures. In this paper, we present an approach that integrates separation logic-a prominent logic for reasoning about linked data structures on the heap-and existing SMT solving technology. Our model-based approach communicates heap aliasing information between theory and separation logic reasoning, providing an efficient decision procedure for discharging verification conditions in program analysis and verification. © Springer International Publishing 2013.

Type: Article
Title: Separation logic modulo theories
Open access status: An open access version is available from UCL Discovery
DOI: 10.1007/978-3-319-03542-0_7
Publisher version: http://dx.doi.org/10.1007/978-3-319-03542-0_7
Language: English
Additional information: This is the author's accepted version of this published article.
UCL classification: UCL
UCL > Provost and Vice Provost Offices > UCL BEAMS
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science
URI: https://discovery.ucl.ac.uk/id/eprint/1390957
Downloads since deposit
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months

Archive Staff Only

View Item View Item