A denotational framework for data flow analysis

DOI10.1007/BF00263194MaRDI QIDQ1162139zbMATH OpenOpenAlexFDO

Authors Flemming Nielson

Publication date 1982

Published in Acta Informatica (Search for Journal in Brave)

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

zbMATH Keywords

abstract interpretation

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited in

(8)

• Inverse-limit and topological aspects of abstract interpretation
• Data flow analysis as model checking
• Abstract interpretation from a denotational-semantics perspective
• Program verification: state of the art, problems, and results. I
• Static semantics, types, and binding time analysis
• Strictness analysis and denotational abstract interpretation
• An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations.
• Incorporating static analysis in a combinator-based compiler

This page was built for publication: A denotational framework for data flow analysis

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