Predicate Abstraction via Symbolic Decision Procedures

We present a new approach for performing predicate abstraction based on symbolic decision procedures. Intuitively, a symbolic decision procedure for a theory takes a set of predicates in the theory and symbolically executes a decision procedure on all the subsets over the set of predicates. The resu...

Полное описание

Библиографические подробности
Главные авторы: Shuvendu K. Lahiri, Thomas Ball, Byron Cook
Формат: Статья
Язык:English
Опубликовано: Logical Methods in Computer Science e.V. 2007-04-01
Серии:Logical Methods in Computer Science
Предметы:
Online-ссылка:https://lmcs.episciences.org/2218/pdf