Existential Label Flow Inference Via CFL Reachability

DOI10.1007/11823230_7MaRDI QIDQ3613380zbMATH OpenOpenAlexFDO

Authors

Publication date 12 March 2009

Published in Static Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11823230_7

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Specification inference using context-free language reachability
• Type-based flow analysis and context-free language reachability
• Proof labeling schemes for reachability-related problems in directed graphs
• Selective context-sensitivity for \(k\)\textit{-CFA} with CFL-reachability
• scientific article; zbMATH DE number 1696834
• Certifying confluence proofs via relative termination and rule labeling
• Uniform labelled calculi for conditional and counterfactual logics
• scientific article; zbMATH DE number 1696833
• Reachability logic: an efficient fragment of transitive closure logic
• Inference of field-sensitive reachability and cyclicity

Cited in

(3)

• Region Analysis for Race Detection
• Conditional Dyck-CFL reachability analysis for complete and efficient library summarization
• Formalizing Soundness of Contextual Effects

This page was built for publication: Existential Label Flow Inference Via CFL Reachability

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