Bounded Fixed-Point Iteration

DOI10.1093/logcom/2.4.441zbMath0783.68075OpenAlexW2072350000MaRDI QIDQ5285983

Flemming Nielson, Hanne Riis Nielson

Publication date: 29 June 1993

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

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

zbMATH Keywords

boundsabstract interpretationstatic program analysis

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Related Items (2)

Logic programs as compact denotations. ⋮ Least solutions of equations over N

This page was built for publication: Bounded Fixed-Point Iteration