A symbolic approach to predicate abstraction

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

Volumn 2725, Issue , 2003, Pages 141-153

  Lahiri, Shuvendu K ^a   Bryant, Randal E ^a   Cook, Byron ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b MICROSOFT   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED ANALYSIS;

DECISION PROCEDURE; INFINITE STATE SPACE; ITS APPLICATIONS; MICROSOFT WINDOWS; PARAMETERIZED SYSTEM; PREDICATE ABSTRACTIONS; SYMBOLIC DECISION PROCEDURES; TRANSITION SYSTEM;

ABSTRACTING;

EID: 35248820231     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45069-6_15     Document Type: Article

References (25)

1. T. Ball, R. Majumdar, T. Millstein, and S. K. Rajamani. Automatic predicate abstraction of C programs. In Proceedings of the ACM SIGPLAN '01 Conference on Programming Language Design and Implementation (PLDI '01), Snowbird, Utah, June 20-22, 2001. SIGPLAN Notices, 36(5), May 2001.
2. C. Barrett, O. Dill, and J. Levitt. Validity checking for combinations of theories with equality. In Formal Methods in Computer-Aided Design (FMCAD '96), LNCS 1166, November 1996.
3. C. Barrett, D. Dill, and A. Stump. Checking satisfiability of first-order formulas by incremental translation to SAT. In Computer-Aided Verification (CAV '02), LNCS 2404, 2002.
4. R. E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, C-35(8), August 1986.
5. R. E. Bryant, S. German, and M. N. Velev. Exploiting positive equality in a logic of equality with uninterpreted functions. In Computer-Aided Verification (CAV '99), LNCS 1633, July 1999.
6. 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 Proc. Computer-Aided Verification (CAV'02), LNCS 2404, July 2002.
7. J. R. Burch and D. L. Dill. Automated verification of pipelined microprocessor control. In Computer-Aided Verification (CAV '94), LNCS 818, June 1994.
8. A. Cimatti, E.M. Clarke, F. Giunchiglia, and M. Roveri. NuSMV: a new Symbolic Model Verifier. In Computer-Aided Verification (CAV'99), LNCS 1633, July 1999.
9. E. Clarke, D. Kroening, and P. Chauhan. Fixpoint computation for circuits using Symbolic Simulation and SAT. In Preparation, 2003.
10. D. Cousot and R. Cousot. Abstract interpretation : a unified lattice model for the static analysis of programs by construction or approximation of fixpoints. In Proceedings of Fourth Annual Symposium on Principles of Programming Languages (POPL '77), 1977.
11. S. Das and D. Dill. Successive approximation of abstract transition relations. In IEEE Symposium of Logic in Computer Science(LICS '01), June 2001.
12. S. Das, D. Dill, and S. Park. Experience with predicate abstraction. In Computer-Aided Verification (CAV '99), LNCS 1633, July 1999.
13. C. Flanagan and S. Qadeer. Predicate abstraction for software verification. In Proceedings of the 29th ACM SIGPLAN-SIGACT Symposium on Principles of programming languages (POPL '02), 2002.
14. D. Geist and I. Beer. Efficient model checking by automated ordering of transition relation partitions. In Computer-Aided Verification (CAV '94), LNCS 818, June 1994.
15. S. Graf and H. Saidi. Construction of abstract state graphs with PVS. In Computer-Aided Verification (CAV '97), LNCS 1254, June 1997.
16. S. K. Lahiri, C. Pixley, and K. Albin. Experience with term level modeling and verification of the MCORE microprocessor core. In Proc. IEEE High Level Design Validation and Test (HLDVT 2001), November 2001.
17. S. K. Lahiri, S. A. Seshia, and R. E. Bryant. Modeling and verification of out-of-order microprocessors in UCLID. In Formal Methods in Computer-Aided Design (FMCAD '02), LNCS 2517, November 2002.
18. K. L. McMillan. Applying SAT Methods in Unbounded Symbolic Model Checking. In Computer Aided Verification, (CAV '02), LNCS 2404, 2002.
19. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient SAT solver. In 38th Design Automation Conference (DAC '01), 2001.
20. K. Namjoshi and R. Kurshan. Syntactic program transformations for automatic abstraction. In Computer-Aided Verification (CAV 2000), LNCS 1855, July 2000.
21. A. Pnueli, S. Ruah, and L. Zuck. Automatic deductive verification with invisible invariants. In Tools and Algorithms for the Construction and Analysis of Systems (TACAS'01), LNCS 2031, 2001.
22. H. Saidi and N. Shankar. Abstract and Model Check while you Prove. In Computer-Aided Verification (CAV '99), LNCS 1633, July 1999.
23. O. Strichmann. On solving Presburger and linear arithmetic with SAT. In Formal Methods in Computer-Aided Design (FMCAD '02), LNCS 2517, November 2002.
24. O. Strichmann, S. A. Seshia, and R. E. Bryant. Deciding separation formulas with sat. In Proc. Computer-Aided Verification (CAV'02), LNCS 2404, July 2002.
25. M. N. Velev and R. E. Bryant. Formal Verification of Superscalar Microprocessors with Multicycle Functional Units, Exceptions and Branch Predication. In 37th Design Automation Conference (DAC '00), June 2000.