Bounded Fixed-Point Iteration

DOI10.1093/LOGCOM/2.4.441zbMATH Open0783.68075OpenAlexW2072350000MaRDI QIDQ5285983FDOQ5285983

Authors: Hanne Riis Nielson, Flemming 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

Recommendations

• Publication:3026317
• Approximate fixed points in abstract interpretation
• Computer Aided Verification
• Acceleration of the abstract fixpoint computation in numerical program analysis
• Fixed points and frontiers: a new perspective

zbMATH Keywords

boundsabstract interpretationstatic program analysis

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Cited In (3)

• Least solutions of equations over N
• Logic programs as compact denotations.
• Approximate fixed points in abstract interpretation

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5285983)