Combining Decision Procedures

1
Combining Decision Procedures

• Individual DPs
• Software Engineering Aspects

Sergey Berezin Stanford University
2
2x3ylt17
Integer
Real
x-ylt17
Special Fragments
Linear Arithmetic
x_at_y75 10010 z
car(cons(x,y))x
Recursive Datatypes
Bitvectors
xyzgt17
Non-linear Arithmetic
Decision Procedures
Arrays
ai (b with i 0)j
8x.9y.f
Quantifiers
Records, Tuples
fx, gy r
Transitive Closure
x!y
Uninterpreted Functions
f(x,y) g(z)
Interpolants
Widening
3
Simple Properties on API
Concrete Counterexamples
DP Completeness
I can change my code, and so can you
Hackability
Integrating SAT
SMT-LIB
Input Language
Clean restarts
new/delete
Combining Tools
Software Engineering
C/C lib
User API
Generic Architecture
Rapid Prototying
DPs as plug-ins (?)
Soundness
Open-source model (?)
Efficiency
Theorem Object
4
DPs in Combination

• Online (incremental)
• Proof-producing (conflict analysis)
• Complete w.r.t. combination
• Backtracking (driven by SAT solver)
• Efficient