Logic-flow analysis of higher-order programs

DOI10.1145/1190216.1190247zbMath1295.68066OpenAlexW4236379125MaRDI QIDQ3189798

Matthew Might

Publication date: 12 September 2014

Published in: Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1190216.1190247

zbMATH Keywords

theorem provingstatic analysislambda calculusCPSabstract countingabstract garbage collectionenvironment analysisgamma-CFA first-order logicLFAlogic-flow analysis

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

The Nuggetizer: Abstracting Away Higher-Orderness for Program Verification

This page was built for publication: Logic-flow analysis of higher-order programs