Precise reasoning for programs using containers

DOI10.1145/1926385.1926407zbMath1284.68175OpenAlexW4235733131MaRDI QIDQ5408543

Alex Aiken, Thomas Dillig, Isil Dillig

Publication date: 10 April 2014

Published in: Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

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

zbMATH Keywords

heap analysiscontainer analysissymbolic heap

Mathematics Subject Classification ID

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

Related Items (5)

Optimization Modulo Theories with Linear Rational Costs ⋮ Correct Code Containing Containers ⋮ An array content static analysis based on non-contiguous partitions ⋮ Generic Abstraction of Dictionaries and Arrays ⋮ Under-approximating loops in C programs for fast counterexample detection

This page was built for publication: Precise reasoning for programs using containers