scientific article; zbMATH DE number 3792232

MaRDI QIDQ3968981zbMATH OpenFDO

Authors Patrick Cousot, Radhia Cousot

Publication date 1982

Full work available at URL https://eudml.org/doc/115380

zbMATH Keywords

closure operatorscomplete latticemonotone operatorretractions

Mathematics Subject Classification ID

Galois correspondences, closure operators (in relation to ordered sets) (06A15) Complete lattices, completions (06B23)

Cited in

(10)

• Sometime = always + recursion always. On the equivalence of the intermittent and invariant assertions methods for proving inevitability properties of programs
• 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
• Weakening additivity in adjoining closures
• Transforming Abstract Interpretations by Abstract Interpretation
• On Fixpoint/Iteration/Variant Induction Principles for Proving Total Correctness of Programs with Denotational Semantics
• May-happen-in-parallel analysis for actor-based concurrency
• Systems of fixpoint equations: abstraction, games, up-to techniques and local algorithms
• Why does Astrée scale up?

This page was built for publication:

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