Reasoning about heap manipulating programs using automata techniques

DOI10.1142/9789814271059_0007MaRDI QIDQ4907859zbMATH OpenOpenAlexFDO

Authors Supratik Chakraborty

Publication date 26 February 2013

Published in Modern Applications of Automata Theory (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/c4996a08328ed01cba94a3c0b5d057cf0819fd76

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Forest automata for verification of heap manipulation
• Automatic numeric abstractions for heap-manipulating programs
• Survey of research on program verification via separation logic
• Monotonic Abstraction for Programs with Dynamic Memory Heaps
• scientific article; zbMATH DE number 7149819

Cited in

(5)

• Automatically analyzing inductive properties for recursive data structures
• On the adequacy of dependence-based representations for programs with heaps
• Heaps and Data Structures: A Challenge for Automated Provers
• Expressive completeness of separation logic with two variables and no separating conjunction
• Precise reasoning for programs using containers

This page was built for publication: Reasoning about heap manipulating programs using automata techniques

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4907859)