Reasoning about Heap Manipulating Programs using Automata Techniques

DOI10.1142/9789814271059_0007zbMath1256.68116OpenAlexW2395854335MaRDI QIDQ4907859

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

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

Related Items (1)

Expressive Completeness of Separation Logic with Two Variables and No Separating Conjunction

This page was built for publication: Reasoning about Heap Manipulating Programs using Automata Techniques