This paper concerns how to automatically create abstractions for program analysis. We show that inductive learning, the goal of which is to identify general rules from a set of observed instances, provides new leverage on the problem. An advantage of an approach based on inductive learning is that it does not require the use of a theorem prover. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Loginov, A., Reps, T., & Sagiv, M. (2005). Abstraction refinement via inductive learning. In Lecture Notes in Computer Science (Vol. 3576, pp. 519–533). Springer Verlag. https://doi.org/10.1007/11513988_50
Mendeley helps you to discover research relevant for your work.