The UCLID Decision Procedure

The UCLID Decision Procedure (2004)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Shuvendu K. Lahiri , Sanjit A. Seshia

Venue:	In CAV’04
Citations:	29 - 1 self

BibTeX

@INPROCEEDINGS{Lahiri04theuclid,
    author = {Shuvendu K. Lahiri and Sanjit A. Seshia},
    title = {The UCLID Decision Procedure},
    booktitle = {In CAV’04},
    year = {2004},
    pages = {475--478},
    publisher = {Springer}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

UCLID is a tool for term-level modeling and verification of infinite-state systems expressible in the logic of counter arithmetic with lambda expressions and uninterpreted functions (CLU). In this paper, we describe a key component of the tool, the decision procedure for CLU.

Citations

490	PVS: A prototype verification system - Owre, Rushby, et al. - 1992
348	S.K.: Automatic predicate abstraction of C programs 36(5 - Ball, Majumdar, et al. - 2001
143	Validity Checking for Combination of Theories with Equality - Barrett, Dill, et al. - 1996
121	Modeling and Verifying Systems Using a Logic of Counter Arithmetic with Lambda Expressions and Uninterpreted Functions - Bryant, Lahiri, et al.
102	CVC: A Cooperating Validity Checker - Stump, Barrett, et al. - 2002
80	Processor Verification Using Efficient Reductions of the Logic of Uninterpreted Functions to Propositional Logic - Bryant, German, et al. - 2001
61	Lazy theorem proving for bounded model checking over infinite domains - Moura, Rueß, et al. - 2002
53	A symbolic approach to predicate abstraction - Lahiri, Bryant, et al. - 2003
38	Modeling and verification of out-of-order microprocessors - Lahiri, Seshia, et al.
38	A hybrid SAT-based decision procedure for separation logic with uninterpreted functions - Seshia, Lahiri, et al. - 2003
38	Deciding Separation Formulas with SAT - Strichman, Seshia, et al. - 2002
31	Deciding quantifier-free Presburger formulas using parameterized solution bounds - Seshia, Bryant - 2004
6	Revisiting positive equality - Lahiri, Bryant, et al. - 2004
4	Processor verification using e#cient reductions of the logic of uninterpreted functions to propositional logic - Bryant, German, et al. - 2001
2	Available at http://www.cs.cmu.edu/~uclid - UCLID