Deriving descriptions of possible values of program variables by means of abstract interpretation

DOI10.1016/0743-1066(92)90032-XzbMath0776.68027OpenAlexW2069076448MaRDI QIDQ4012708

Maurice Bruynooghe, Gerda Janssens

Publication date: 27 September 1992

Published in: The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0743-1066(92)90032-x

zbMATH Keywords

abstract interpretationfree variablesPROLOG compilationtype information

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Semantics in the theory of computing (68Q55) Logic programming (68N17) General topics in the theory of software (68N01)

Related Items (9)

Termination of floating-point computations ⋮ Proving Termination by Invariance Relations ⋮ Automating Termination Proofs for CHR ⋮ Automatic inference of determinacy and mutual exclusion for logic programs using mode and type analyses ⋮ Improving precision of type analysis using non-discriminative union ⋮ Detecting non-provable goals ⋮ S-semantics for logic programming: a retrospective look ⋮ Type inference in Prolog: A new approach ⋮ Finite-tree analysis for constraint logic-based languages

This page was built for publication: Deriving descriptions of possible values of program variables by means of abstract interpretation