@inproceedings{thakur2013posthat,
author = {Thakur, Aditya and Lal, Akash and Lim, Junghee and Reps, Thomas},
title = {PostHat and All That: Automating Abstract Interpretation},
booktitle = {The Fourth Workshop on Tools for Automatic Program Analysis (TAPAS)},
year = {2013},
month = {January},
abstract = {Abstract interpretation provides an elegant formalism for performing program analysis. Unfortunately, designing and implementing a sound, precise, scalable, and extensible abstract interpreter is difficult. In this paper, we describe an approach to creating correct-by-construction abstract interpreters that also attain the fundamental limits on precision that abstract-interpretation theory establishes. Our approach requires the analysis designer to implement only a small number of operations. In particular, we describe a systematic method for implementing an abstract interpreter that solves the following problem: Given program P, and an abstract domain A, find the most-precise inductive A-invariant for P.},
publisher = {Elsevier},
url = {http://approjects.co.za/?big=en-us/research/publication/posthat-and-all-that-automating-abstract-interpretation/},
edition = {The Fourth Workshop on Tools for Automatic Program Analysis (TAPAS)},
}