A denotational framework for data flow analysis
From MaRDI portal
Publication:1162139
DOI10.1007/BF00263194zbMath0479.68012OpenAlexW1998717006MaRDI QIDQ1162139
Publication date: 1982
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00263194
Specification and verification (program logics, model checking, etc.) (68Q60) General topics in the theory of software (68N01)
Related Items (8)
Strictness analysis and denotational abstract interpretation ⋮ Data flow analysis as model checking ⋮ Inverse-limit and topological aspects of abstract interpretation ⋮ Program verification: state of the art, problems, and results. I ⋮ Static semantics, types, and binding time analysis ⋮ Abstract Interpretation From a Denotational-semantics Perspective ⋮ Incorporating static analysis in a combinator-based compiler ⋮ An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations.
This page was built for publication: A denotational framework for data flow analysis
