Improving flow analyses via ΓCFA

DOI10.1145/1159803.1159807zbMath1321.68350OpenAlexW2110507526MaRDI QIDQ5501455

Matthew Might, Olin Shivers

Publication date: 3 August 2015

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

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

zbMATH Keywords

functional languagesprogram analysislambda calculuscontinuationsflow analysisCPSinliningabstract countingabstract garbage collectionenvironment analysisgamma-CFAsuperbeta

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (8)

Liberate Abstract Garbage Collection from the Stack by Decomposing the Heap ⋮ Semantic Foundations for Deterministic Dataflow and Stream Processing ⋮ Systematic abstraction of abstract machines ⋮ Push versus pull-based loop fusion in query engines ⋮ Modular, higher order cardinality analysis in theory and practice ⋮ Abstract allocation as a unified approach to polyvariance in control-flow analyses ⋮ Context-sensitive analysis without calling-context ⋮ Access Analysis-Based Tight Localization of Abstract Memories

This page was built for publication: Improving flow analyses via ΓCFA