Abstract Interpretation, Logical Relations, and Kan Extensions

DOI10.1093/logcom/1.1.5zbMath0727.03020OpenAlexW2059221460WikidataQ57006940 ScholiaQ57006940MaRDI QIDQ3348896

Samson Abramsky

Publication date: 1990

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/1.1.5

zbMATH Keywords

correctnesslivenesssafetypowerdomainsprogram analysislambda-calculusabstract interpretationKan extensionslogical relationsstrictness analysis

Mathematics Subject Classification ID

Adjoint functors (universal constructions, reflective subcategories, Kan extensions, etc.) (18A40) Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Continuous lattices and posets, applications (06B35) Combinatory logic and lambda calculus (03B40)

Related Items

PCF extended with real numbers, On collecting semantics for program analysis, Strictness and totality analysis with conjunction, A domain-theoretic framework for robustness analysis of neural networks, On-line and off-line partial evaluation: semantic specifications and correctness proofs, Head-strictness is not a monotonic abstract property, Payoffs, Intensionality and Abstraction in Games, On-the-Fly Techniques for Game-Based Software Model Checking, Inverse image analysis generalises strictness analysis, Differential logical relations, Part I: The simply-typed case, Domains for Higher-Order Games, Properly injective spaces and function spaces, Prelogical relations, Extracting Program Logics From Abstract Interpretations Defined by Logical Relations