Typestate verification: abstraction techniques and complexity results

DOI10.1016/J.SCICO.2005.02.004zbMath1088.68066OpenAlexW4235481015MaRDI QIDQ2568446

Eran Yahav, G. Ramalingam, Deepak Goyal, John Field

Publication date: 10 October 2005

Published in: Science of Computer Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.scico.2005.02.004

zbMATH Keywords

computational complexitypointer analysisalias analysistypestate verification

Mathematics Subject Classification ID

Theory of programming languages (68N15) Specification and verification (program logics, model checking, etc.) (68Q60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (1)

Reference count analysis with shallow aliasing

This page was built for publication: Typestate verification: abstraction techniques and complexity results