Sound up-to techniques and complete abstract domains
From MaRDI portal
(Redirected from Publication:5145290)
Abstract: Abstract interpretation is a method to automatically find invariants of programs or pieces of code whose semantics is given via least fixed-points. Up-to techniques have been introduced as enhancements of coinduction, an abstract principle to prove properties expressed via greatest fixed-points. While abstract interpretation is always sound by definition, the soundness of up-to techniques needs some ingenuity to be proven. For completeness, the setting is switched: up-to techniques are always complete, while abstract domains are not. In this work we show that, under reasonable assumptions, there is an evident connection between sound up-to techniques and complete abstract domains.
Recommendations
Cited in
(9)- Combining semilattices and semimodules
- Up-to techniques for behavioural metrics via fibrations
- Up-to techniques for behavioural metrics via fibrations
- Systems of fixpoint equations: abstraction, games, up-to techniques and local algorithms
- scientific article; zbMATH DE number 7559481 (Why is no real title available?)
- Strong induction is an up-to technique
- Convexity via Weak Distributive Laws
- Exploiting adjoints in property directed reachability analysis
- Language inclusion algorithms as complete abstract interpretations
This page was built for publication: Sound up-to techniques and complete abstract domains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145290)