Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2211.09572 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913604754735104 |
|---|---|
| author | Monniaux, David |
| author_facet | Monniaux, David |
| contents | Static analysis by abstract interpretation is generally designed to be "sound", that is, it should not claim to establish properties that do not hold-in other words, not provide "false negatives" about possible bugs. A rarer requirement is that it should be "complete", meaning that it should be able to infer certain properties if they hold. This paper describes a number of practical issues and questions related to completeness that I have come across over the years. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2211_09572 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Completeness in static analysis by abstract interpretation, a personal point of view Monniaux, David Programming Languages Static analysis by abstract interpretation is generally designed to be "sound", that is, it should not claim to establish properties that do not hold-in other words, not provide "false negatives" about possible bugs. A rarer requirement is that it should be "complete", meaning that it should be able to infer certain properties if they hold. This paper describes a number of practical issues and questions related to completeness that I have come across over the years. |
| title | Completeness in static analysis by abstract interpretation, a personal point of view |
| topic | Programming Languages |
| url | https://arxiv.org/abs/2211.09572 |