Back to Search
Start Over
Sound up-to techniques and Complete abstract domains
- Publication Year :
- 2018
-
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.<br />Comment: 12 pages, accepted to 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS'18)
- Subjects :
- Computer Science - Logic in Computer Science
Subjects
Details
- Database :
- arXiv
- Publication Type :
- Report
- Accession number :
- edsarx.1804.10507
- Document Type :
- Working Paper