|
348
|
Automatic predicate abstraction of C programs
– Thomas Ball , Rupak Majumdar, Todd Millstein, Sriram K. Rajamani
- 2001
|
|
909
|
Chaff: Engineering an Efficient SAT Solver
– Matthew W. Moskewicz , Conor F. Madigan, Ying Zhao, Lintao Zhang, Sharad Malik
- 2001
|
|
520
|
Construction of abstract state graphs with PVS
– Susanne Graf, Hassen Saidi
- 1997
|
|
38
|
Deciding Separation Formulas with SAT
– Ofer Strichman, Sanjit A. Seshia, Randal E. Bryant
- 2002
|
|
352
|
Simplification by cooperating decision procedures
– Greg Nelson, Derek C. Oppen
- 1979
|
|
38
|
Modeling and Verification of Out-of-Order Microprocessors in UCLID
– Shuvendu K. Lahiri, Sanjit A. Seshia, Randal E. Bryant
- 2002
|
|
143
|
Validity Checking for Combinations of Theories with Equality
– Clark Barrett, David Dill, Jeremy Levitt
- 1996
|
|
184
|
CVCLite: A new implementation of the cooperating validity checker category b
– C W Barrett, S Berezin
|
|
378
|
Lazy Abstraction
– Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar, Gregoire Sutre
- 2002
|
|
2605
|
Graph-based algorithms for Boolean function manipulation
– Randal E. Bryant
- 1986
|
|
77
|
Checking Satisfiability of First-Order Formulas by Incremental Translation into
– C Barrett, D Dill, A Stump
|
|
242
|
Automatic Verification of Pipelined Microprocessor Control
– Jerry Burch, David Dill
- 1994
|
|
296
|
Simplify: A theorem prover for program checking
– David Detlefs, Greg Nelson, James B. Saxe
- 2003
|
|
47
|
Exploiting Positive Equality in a Logic of Equality with Uninterpreted Functions
– Randal E. Bryant, Steven German, Miroslav N. Velev
- 1999
|
|
80
|
Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logic
– Randal E. Bryant, Steven German, Miroslav N. Velev
- 1999
|
|
53
|
A Symbolic Approach to Predicate Abstraction
– Shuvendu K. Lahiri, Randal E. Bryant, Byron Cook
- 2003
|
|
85
|
Predicate abstraction for software verification
– C Flanagan, S Qadeer
- 2002
|
|
1637
|
Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints
– P Cousot, R Cousot
- 1977
|
|
63
|
Successive approximation of abstract transition relations
– S Das, D L Dill
- 2001
|