Logic-flow analysis of higher-order programs

DOI10.1145/1190216.1190247MaRDI QIDQ3189798zbMATH OpenOpenAlexFDO

Authors 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 provinglambda calculusstatic analysisCPSabstract countingabstract garbage collectionenvironment analysisgamma-CFA first-order logicLFAlogic-flow analysis

Mathematics Subject Classification ID

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

Recommendations

• Static Analysis
• Exact flow analysis by higher-order model checking
• A logic for information flow analysis with an application to forward slicing of simple imperative programs
• scientific article; zbMATH DE number 879004
• Efficient dataflow analysis of logic programs

Cited in

(3)

• The Nuggetizer: Abstracting Away Higher-Orderness for Program Verification
• scientific article; zbMATH DE number 1130261 (Why is no real title available?)
• Flow analytic type system for array bound checks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3189798)