Work Plan - Meeting 9-11052016 » History » Version 1
Antti Hyvärinen, 17/05/2016 18:17
1 | 1 | Antti Hyvärinen | h1. Work Plan - Meeting 9-11/05/2016 |
---|---|---|---|
2 | |||
3 | h2. Mile-Stones |
||
4 | |||
5 | I. Propositional logic MC for FunFrog + OpenSMT2 |
||
6 | Tasks (1) - (3) |
||
7 | |||
8 | II. Theories MC for FunFrog + OpenSMT2/Other |
||
9 | Tasks (1) - (3) |
||
10 | |||
11 | III. Theory aware MC for FunFrog + OpenSMT2 |
||
12 | Tasks (1) - (4) and (5.5) |
||
13 | |||
14 | IV. Incremental SMT for FunFrog |
||
15 | Tasks (1) - (4) |
||
16 | |||
17 | V. Unbounded MC (loops) |
||
18 | Tasks (1) - (4) |
||
19 | |||
20 | |||
21 | h3. Tasks for OpenSMT2 |
||
22 | |||
23 | # Library + Headers (A,L) |
||
24 | # Interface (ALL) |
||
25 | # Interpolation (L,S) |
||
26 | # Incrementality - Push/Pop (M,A) |
||
27 | # Parallelizaion and clause sharing between theories (M,A) |
||
28 | 5.5 Theory combinations (L,A) |
||
29 | 5.6 Full define - fun for OpenSMT2, with parameteres (?) |
||
30 | # Quantifiers (G,A,M) |
||
31 | |||
32 | |||
33 | h3. Tasks for Funfrog |
||
34 | |||
35 | a. Encoding SSA --> theory (L,K,S) |
||
36 | > - Convert SSA --> PTRef (propositional logic) |
||
37 | > - Convert Itp --> funfrog (propositional logic) |
||
38 | > - Convert SSA --> PTRef (theories) |
||
39 | > - Convert Itp --> funfrog (exprt theory) |
||
40 | b. New CBMC - updare the repository (G,K) |
||
41 | c. Benchmarks (ALL) |
||
42 | d. Incremental SMT for funfrog (use) (G,K,S) |
||
43 | e. Unbounded MC (G,K,S) |