Introspective pushdown analysis of higher-order programs

DOI10.1145/2364527.2364576zbMath1291.68117arXiv1207.1813OpenAlexW1990810662MaRDI QIDQ5168912

Matthew Might, David A. Vanhorn, Ilya Sergey, Christopher F. Earl

Publication date: 21 July 2014

Published in: Proceedings of the 17th ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1207.1813

zbMATH Keywords

program analysishigher-order languagesabstract interpretationpushdown systemsabstract machinespushdown analysisabstract garbage collectioncfa2

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Related Items (3)

Liberate Abstract Garbage Collection from the Stack by Decomposing the Heap ⋮ Analyzing pushdown systems with stack manipulation ⋮ Abstract allocation as a unified approach to polyvariance in control-flow analyses

This page was built for publication: Introspective pushdown analysis of higher-order programs