Abstract: Automated abstraction is a key technology in extending computer-aided verification methods to larger and more complex systems. In general terms, given a system and a property to prove, abstraction means extracting a simple set of facts about the system that are sufficient to prove the property. In this talk, we will see that this notion of abstraction is closely related to Craig's interpolation lemma. This is a classical result about predicate logic connecting proofs and abstraction. The lemma states that if formula A implies formula B, then there is an interpolant formula A' such that A implies A' and A' implies B, and such that A' is expressed over the common symbols of A and B. In some sense, the interpolant is an abstraction of A sufficient to prove BAutomated abstraction is a key technology in extending computer-aided verification methods to larger and more complex systems. In general terms, given a system and a property to prove, abstraction means extracting a simple set of facts about the system that are sufficient to prove the property. In this talk, we will see that this notion of abstraction is closely related to Craig's interpolation lemma. This is a classical result about predicate logic connecting proofs and abstraction. The lemma states that if formula A implies formula B, then there is an interpolant formula A' such that A implies A' and A' implies B, and such that A' is expressed over the common symbols of A and B. In some sense, the interpolant is an abstraction of A sufficient to prove B.
![]() Appointments: dcm@cs.cmu.edu |
Maintainer | [ Home > Seminar ] |
`Last modified: Mon Feb 26 11:09:10 EDT 2007 |