Abstraction refinement via inductive learning

Alexey Loginov, Thomas Reps, Mooly Sagiv

Research output: Contribution to journalConference articlepeer-review

Abstract

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.

Original languageEnglish
Pages (from-to)519-533
Number of pages15
JournalLecture Notes in Computer Science
Volume3576
DOIs
StatePublished - 2005
Event17th International Conference on Computer Aided Verification, CAV 2005 - Edinburgh, Scotland, United Kingdom
Duration: 6 Jul 200510 Jul 2005

Fingerprint

Dive into the research topics of 'Abstraction refinement via inductive learning'. Together they form a unique fingerprint.

Cite this