On abstraction refinement for program analyses in Datalog
A central task for a program analysis concerns how to efficiently find a program abstraction that keeps only information relevant for proving properties of interest. We present a new approach for finding such abstractions for program analyses written in Datalog. Our approach is based on counterexamp...
| Principais autores: | , , , , |
|---|---|
| Formato: | Conference item |
| Publicado em: |
Association for Computing Machinery
2014
|