Constructing quantified invariants via predicate abstraction

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

Volumn 2937, Issue , 2004, Pages 267-281

  Lahiri, Shuvendu K ^a   Bryant, Randal E ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; SOFTWARE DESIGN;

CACHE COHERENCE PROTOCOLS; DECISION PROCEDURE; FINITE-STATE MODELS; FIRST ORDER LOGIC; HARDWARE AND SOFTWARE DESIGNS; INFINITE STATE SYSTEMS; INVARIANT PROPERTIES; PREDICATE ABSTRACTIONS;

MODEL CHECKING;

EID: 70350235720     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24622-0_22     Document Type: Conference Paper

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. K. Baukus, Y. Lakhnech, and K. Stahl. ParameterizedVerification of a Cache Coherence Protocol: Safety and Liveness. In A. Cortesi, editor, Verification, Model Checking, and Abstract Interpretation, (VMCAI’02), LNCS 2294, pages 317–330, January 2002.
3. E. Börger, E. Grädel, and Y. Gurevich. The Classical Decision Problem. Springer-Verlag, 1997.
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 E. Brinksma and K. G. Larsen, editors, Computer-Aided Verification (CAV’02), LNCS 2404, pages 78–92, 2002.
5. C. T. Chou. The mathematical foundation fo symbolic trajectory evaluation. In N. Halbwachs and D. Peled, editors, Computer-Aided Verification (CAV’99), LNCS 1633, pages 196–207, 1999.
6. P. Cousot and R. Cousot. Abstract interpretation: a unified lattice model for the static analysis of programs by construction or approximation of fixpoints. In Principles of Programming Languages (POPL’77), pages 238–252, 1977.
7. S. Das and D. L. Dill. Counter-example based predicate discovery in predicate abstraction. In M. D. Aagaard and J. W. O’Leary, editors, Formal Methods in Computer-Aided Design (FMCAD’02), LNCS 2517, pages 19–32, 2002.
8. C. Flanagan and S. Qadeer. Predicate abstraction for software verification. In J. Launchbury and J. C. Mitchell, editors, Principles of Programming Languages (POPL’02), pages 191–202, 2002.
9. S. German. Personal communication.
10. S. Graf and H. Saïdi. Construction of abstract state graphs with PVS. In O. Grumberg, editor, Computer-Aided Verification (CAV’97), LNCS 1254, pages 72–83, 1997.
11. C. N. Ip and D. L. Dill. Verifying systems with replicated components in Murϕ. In R. Alur and T. A. Henzinger, editors, Computer-Aided Verification (CAV’96), LNCS 1102, pages 147–158, 1996.
12. S. K. Lahiri, R. E. Bryant, and B. Cook. A symbolic approach to predicate abstraction. In W. A. Hunt, Jr. and F. Somenzi, editors, Computer-Aided Verification (CAV’03), LNCS 2725, pages 141–153, 2003.
13. S. K. Lahiri, S. A. Seshia, and R. E. Bryant. Modeling and verification of out-of-order microprocessors in UCLID. In M. D. Aagaard and J. W. O’Leary, editors, Formal Methods in Computer-Aided Design (FMCAD’02), LNCS 2517, pages 142–159, 2002.
14. L. Lamport. Anewsolution of Dijkstra’s concurrent programming problem. Communications of the ACM, 17:453–455, August 1974.
15. A. Pnueli, S. Ruah, and L. Zuck. Automatic deductive verification with invisible invariants. In T. Margaria andW.Yi, editors, Tools and Algorithms for the Construction and Analysis of Systems (TACAS’01), LNCS 2031, pages 82–97, 2001.