Strictness analysis and denotational abstract interpretation

DOI10.1016/0890-5401(88)90041-7zbMath0636.68018OpenAlexW2069293912MaRDI QIDQ1098274

Flemming Nielson

Publication date: 1988

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0890-5401(88)90041-7

zbMATH Keywords

correctnessabstract interpretationtyped \(\lambda \)-calculusrepresentation functionsfaithful functionshigher order strictness analysislevel-preserving

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65) Combinatory logic and lambda calculus (03B40)

Related Items (9)

Strictness analysis and denotational abstract interpretation ⋮ Proving the correctness of compiler optimisations based on a global analysis: a study of strictness analysis^† ⋮ Strictness analysis via abstract interpretation for recursively defined types ⋮ Functional completeness of the mixed \(\lambda\)-calculus and combinatory logic ⋮ Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages ⋮ Kleene's Logic with equality ⋮ Bottom-up abstract interpretation of logic programs ⋮ Frameworks for abstract interpretation ⋮ Semantics-directed program analysis: A tool-maker's perspective

Cites Work

• ``A la Burstall intermittent assertions induction principles for proving inevitability properties of programs
• A structured approach to static semantics correctness
• Strictness analysis and denotational abstract interpretation
• A denotational framework for data flow analysis
• Chain-complete posets and directed sets with applications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Strictness analysis and denotational abstract interpretation