Abstract interpretation: a semantics-based tool for program analysis
Neil Deaton Jones, Flemming Nielson · 1995
Abstract Desirable mathematical background for this chapter includes basic concepts such as lattices, complete partial orders, homomorphisms, etc.the elements of domain theory, e.g. as in the chapter by Abramsky in volume 3 of this Handbook, or the books [Schmidt, 1986] or [Nielson and Nielson, 1992a]. the elements of denotational semantics, e.g. as in the chapter by Tennent in volume 3 of this Handbook, or the books [Schmidt, 1986] or [Nielson and Nielson, 1992a]. Interpretations as used in logic. There will be some use of structural operational semantics [Kahn, 1987], [Plotkin, 1981], [Nielson and Nielson, 1992a], for example deduction rules for a program’s semantics and type system. The use of category theory will be kept to a minimum but would be a useful background for the domain-related parts of section 3.