The UCLID decision procedure

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3114, Issue , 2004, Pages 475-478

  Lahiri, Shuvendu K ^a   Seshia, Sanjit A ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

DECISION PROCEDURE; LEVEL MODEL; UNINTERPRETED FUNCTIONS;

COMPUTER AIDED ANALYSIS;

EID: 35048827513     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27813-9_40     Document Type: Article

References (15)

1. T. Ball, R. Majumdar, T. Millstein, and S. K. Rajamani. Automatic predicate abstraction of C programs. In Programming Language Design and Implementation (PLDI '01), pages 203-213, 2001.
2. C. Barrett, D. Dill, and J. Levitt. Validity checking for combinations of theories with equality. In Format Methods in Computer-Aided Design (FMCAD '96), LNCS 1166, pages 187-201, 1996.
3. R. E. Bryant, S. German, and M. N. Velev. Processor verification using efficient reductions of the logic of uninterpreted functions to prepositional logic. ACM Transactions on Computational Logic, 2(1):1-41, January 2001.
4. R. E. Bryant, S. K. Lahiri, and S. A. Seshia. Modeling and verifying systems using a logic of counter arithmetic with lambda expressions and uninterpreted functions. In Computer-Aided Verification (CAV '02), LNCS 2404, pages 78-92, 2002.
5. Leonardo de Moura, Harald Rueß, and Maria Sorea. Lazy theorem proving for bounded model checking over infinite domains. In Conference on Automated Deduction (CADE '02), pages 438-455, 2002.
6. J.-C. Filliatre, S. Owre, H. Rueß, and N. Shankar. ICS: Integrated Canonizer and Solver. In CAV '01 LNCS 2102, pages 246-249, 2001.
7. S. K. Lahiri, R. E. Bryant, and Byron Cook. A symbolic approach to predicate abstraction. In Computer-Aided Verification (CAV '03), LNCS 2725, pages 141-153, 2003.
8. S. K. Lahiri, R. E. Bryant, A. Goel, and M. Talupur. Revisiting positive equality. In Tools and Algorithms for the Construction and Analysis of Systems (TACAS'04), LNCS 2988, pages 1-15. Springer-Verlag, 2004.
9. S. K. Lahiri, S. A. Seshia, and R. E. Bryant. Modeling and verification of out-of-order microprocessors in UCLID. In Formai Methods in Computer-Aided Design (FMCAD '02), LNCS 2517, pages 142-159, 2002.
10. S. Owre, J. M. Rushby, and N. Shankar. PVS: A prototype verification system. In Conference on Automated Deduction (CADE '92), LNAI 607, pages 748-752, 1992.
11. th IEEE Symposium on Logic in Computer Science (LICS), July 2004. To appear.
12. S. A. Seshia, S. K. Lahiri, and R. E. Bryant. A hybrid SAT-based decision procedure for separation logic with uninterpreted functions. In 40th Design Automation Conference (DAC '03), pages 425-430, June 2003.
13. O. Strichman, S. A. Seshia, and R. E. Bryant. Deciding separation formulas with SAT. In Computer-Aided Verification (CAV '02), LNCS 2404, pages 209-222, 2002.
14. Aaron Stump, Clark W. Barrett, and David L. Dill. CVC: A Cooperating Validity Checker. In 14th International Conference on Computer Aided Verification (CAV), volume 2404 of LNCS, pages 500-504. Springer-Verlag, 2002.
15. UCLID. Available at http://www.cs.cmu.edu/∼uclid