Model Checking Via ΓCFA

DOI10.1007/978-3-540-69738-1_4MaRDI QIDQ5452596zbMATH OpenOpenAlexFDO

Authors Matthew Might, Benjamin Chambers, Olin Shivers

Publication date 4 April 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-69738-1_4

zbMATH Keywords

static analysishigher-order languagesAbstract interpretationabstract countingabstract garbage collection\(\Gamma \)CFA

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Functional programming and lambda calculus (68N18)

Recommendations

• Improving flow analyses via ΓCFA
• Higher-order model checking in direct style
• Model checking higher-order programs
• Exact flow analysis by higher-order model checking
• Higher-order model checking: an overview

Cited in

(2)

• scientific article; zbMATH DE number 88950 (Why is no real title available?)
• Access analysis-based tight localization of abstract memories

This page was built for publication: Model Checking Via ΓCFA

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