scientific article
From MaRDI portal
Publication:3968981
zbMath0503.06008MaRDI QIDQ3968981
Publication date: 1982
Full work available at URL: https://eudml.org/doc/115380
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Complete lattices, completions (06B23) Galois correspondences, closure operators (in relation to ordered sets) (06A15)
Related Items (9)
May-Happen-in-Parallel Analysis for Actor-Based Concurrency ⋮ Why does Astrée scale up? ⋮ On Fixpoint/Iteration/Variant Induction Principles for Proving Total Correctness of Programs with Denotational Semantics ⋮ Transforming Abstract Interpretations by Abstract Interpretation ⋮ Weakening additivity in adjoining closures ⋮ Algorithms for the fixed point property ⋮ An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations. ⋮ Closures on CPOs form complete lattices ⋮ Sometime = always + recursion \(\equiv\) always. On the equivalence of the intermittent and invariant assertions methods for proving inevitability properties of programs
This page was built for publication:
