Commit message (Collapse) | Author | Age | Files | Lines | |
---|---|---|---|---|---|
* | Minor corrections. | Alex Auvolat | 2014-06-26 | 2 | -0/+10 |
| | | | | | | - Use correect clock scope in typing - De-activate multi-valuated domain for enumerate vars + var couples. - Add comment explaining why it doesn't work | ||||
* | Many things, sorry for the mess. | Alex Auvolat | 2014-06-26 | 3 | -179/+579 |
| | | | | | | | | | | - Implement two new enumeration domains (they don't bring us much) : multi valuation for variables ; multi valuation for variables and pairs of variables (not really sure it works) - Make it so that the number of init/time variables is reduced (do not create new init/time variables on node instanciation, only inside activate blocks and automaton states) - Some work on EDD (it is currently broken and does not compile) | ||||
* | Implement a few things. Tomorrow: optimizations. | Alex Auvolat | 2014-06-25 | 2 | -51/+138 |
| | |||||
* | Begin implementation of EDD ; SCA implemented. | Alex Auvolat | 2014-06-25 | 2 | -4/+504 |
| | |||||
* | Differentiate pre witin different scopes. | Alex Auvolat | 2014-06-25 | 1 | -0/+2 |
| | |||||
* | Add command line option : verbose chaotic iterations. | Alex Auvolat | 2014-06-25 | 1 | -12/+17 |
| | |||||
* | Implementation of disjunction domain seems to work. | Alex Auvolat | 2014-06-24 | 8 | -531/+590 |
| | |||||
* | Not much. Still does not work very well. | Alex Auvolat | 2014-06-20 | 6 | -59/+56 |
| | |||||
* | Everything proved !! | Alex Auvolat | 2014-06-19 | 3 | -41/+88 |
| | |||||
* | Actually, it works. | Alex Auvolat | 2014-06-19 | 2 | -8/+21 |
| | |||||
* | Very buggy disjunction domain ! | Alex Auvolat | 2014-06-19 | 5 | -49/+363 |
| | |||||
* | Did most of the boring stuff. Now, work on the abstract domain. | Alex Auvolat | 2014-06-19 | 5 | -106/+187 |
| | |||||
* | Isolate numerical part of domain. Next: isolate numerical part of equations. | Alex Auvolat | 2014-06-19 | 7 | -51/+124 |
| | |||||
* | Do some typing ; support multiple pre in abstract interpretation. | Alex Auvolat | 2014-06-19 | 2 | -92/+51 |
| | |||||
* | Presentation changes. | Alex Auvolat | 2014-06-18 | 1 | -15/+26 |
| | |||||
* | Nice view of guarantees ; add half test, proved. | Alex Auvolat | 2014-06-18 | 4 | -37/+120 |
| | |||||
* | Retab | Alex Auvolat | 2014-06-18 | 2 | -44/+50 |
| | |||||
* | Add gilbreath suite ; booleans are not represented in a good way. | Alex Auvolat | 2014-06-18 | 5 | -60/+105 |
| | |||||
* | Abstract interpretation gives good results on the limiter example. | Alex Auvolat | 2014-06-18 | 4 | -34/+31 |
| | |||||
* | Pretty printing. | Alex Auvolat | 2014-06-18 | 8 | -66/+147 |
| | |||||
* | Add intervals domain ; some interesting analysis works. | Alex Auvolat | 2014-06-18 | 6 | -17/+434 |
| | |||||
* | Some abstract interpretation does something now. | Alex Auvolat | 2014-06-17 | 4 | -10/+189 |
| | |||||
* | Add bindings to apron. Next : work on abstract interpret. | Alex Auvolat | 2014-06-17 | 4 | -3/+183 |
| | |||||
* | Write transformation of program into logical formula. | Alex Auvolat | 2014-06-17 | 3 | -25/+389 |
| | |||||
* | Add AST for logical formula. | Alex Auvolat | 2014-06-17 | 2 | -0/+80 |