Exploiting reachability and cardinality in higher-order flow analysis

DOI10.1017/S0956796808006941MaRDI QIDQ3546050zbMATH OpenFDO

Authors Matthew Might, Olin Shivers

Publication date 18 December 2008

Published in Journal of Functional Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0956796808006941

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Recommendations

• Improving flow analyses via ΓCFA
• Pushdown flow analysis with abstract garbage collection
• Modular, higher order cardinality analysis in theory and practice
• Modular, higher-order cardinality analysis in theory and practice
• Introspective pushdown analysis of higher-order programs

Cites work

• Analyzing the environment structure of higher-order languages using frame strings

Cited in

(4)

• Pushdown flow analysis with abstract garbage collection
• Introspective pushdown analysis of higher-order programs
• Modular, higher order cardinality analysis in theory and practice
• Modular, higher-order cardinality analysis in theory and practice

This page was built for publication: Exploiting reachability and cardinality in higher-order flow analysis

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