Abstracting abstract machines
From MaRDI portal
Publication:5176929
DOI10.1145/1863543.1863553zbMath1323.68231arXiv1007.4446OpenAlexW2013885073MaRDI QIDQ5176929
David A. Vanhorn, Matthew Might
Publication date: 5 March 2015
Published in: Proceedings of the 15th ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1007.4446
Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (9)
Liberate Abstract Garbage Collection from the Stack by Decomposing the Heap ⋮ Systematic abstraction of abstract machines ⋮ Higher-Order Model Checking in Direct Style ⋮ Logical approximation for program analysis ⋮ Automating the functional correspondence between higher-order evaluators and abstract machines ⋮ Result invalidation for incremental modular analyses ⋮ Higher order symbolic execution for contract verification and refutation ⋮ Modular, higher order cardinality analysis in theory and practice ⋮ Abstract allocation as a unified approach to polyvariance in control-flow analyses
This page was built for publication: Abstracting abstract machines
