Actions
Wiki » History » Revision 4
« Previous |
Revision 4/27
(diff)
| Next »
Karine Even Mendoza, 13/05/2016 18:02
Skype Meeting 03/05/2016¶
Why we need combination of theories, multipication of non-constants
Short Code example:
t1 = x*y;
x' = x;
y'= y;
t2 = x'*y';
assert(t1 != t2);
Solution: t1 = f(x, y) =====
Work Plan - Meeting 9-11/05/2016¶
Mile-Stones¶
I. Propositional logic MC for FunFrog + OpenSMT2
Tasks (1) - (3)
II. Theories MC for FunFrog + OpenSMT2/Other
Tasks (1) - (3)
III. Theory aware MC for FunFrog + OpenSMT2
Tasks (1) - (4) and (5.5)
IV. Incremental SMT for FunFrog
Tasks (1) - (4)
V. Unbounded MC (loops)
Tasks (1) - (4)
Tasks for OpenSMT2
- Library + Headers (A,L)
- Interface (ALL)
- Interpolation (L,S)
- Incrementality - Push/Pop (M,A)
- Parallelizaion and clause sharing between theories (M,A)
5.5 Quantifiers (G,A,M)
5.5 Quantifiers (G,A,M)
=====
Updated by Karine Even Mendoza over 8 years ago · 4 revisions