| ||||
| ||||
![]() Title:Sound up-to techniques and Complete abstract domains Conference:LICS18 Tags:abstract interpretation, coinduction up-to, complete abstract domains, cross-fertilization and sound up-to techniques 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 as 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. Sound up-to techniques and Complete abstract domains ![]() Sound up-to techniques and Complete abstract domains | ||||
Copyright © 2002 – 2025 EasyChair |