Modular reasoning about heap paths via effectively propositional formulas

DOI10.1145/2535838.2535854zbMath1284.68403MaRDI QIDQ5408433

Neil Immerman, Mooly Sagiv, Shachar Itzhaky, Anindya Banerjee, Aleksandar Nanevski, Ori Lahav

Publication date: 10 April 2014

Published in: Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2535838.2535854

zbMATH Keywords

verification; linked list; smt

Mathematics Subject Classification ID

03B70: Logic in computer science

68Q60: Specification and verification (program logics, model checking, etc.)

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)

Uses Software

• SMT-LIB
• Spec#
• z3