Abstraction refinement guided by a learnt probabilistic model
The core challenge in designing an effective static program analysis is to find a good program abstraction -- one that retains only details relevant to a given query. In this paper, we present a new approach for automatically finding such an abstraction. Our approach uses a pessimistic strategy, whi...
| Main Authors: | , |
|---|---|
| Format: | Conference item |
| Sprog: | English |
| Udgivet: |
Association for Computing Machinery
2016
|