| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | More verbosity ; adapt rfollow so that it can be proved | Alex Auvolat | 2014-07-02 | 1 | -1/+1 |
| | | |||||
| * | Adapt for real type with Apron ; not very efficient ATM. | Alex Auvolat | 2014-07-01 | 1 | -28/+48 |
| | | |||||
| * | Minor corrections. | Alex Auvolat | 2014-06-26 | 1 | -0/+1 |
| | | | | | | | - 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 | 1 | -94/+135 |
| | | | | | | | | | | | - 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) | ||||
| * | Differentiate pre witin different scopes. | Alex Auvolat | 2014-06-25 | 1 | -0/+2 |
| | | |||||
| * | Implementation of disjunction domain seems to work. | Alex Auvolat | 2014-06-24 | 1 | -7/+7 |
| | | |||||
| * | Not much. Still does not work very well. | Alex Auvolat | 2014-06-20 | 1 | -23/+21 |
| | | |||||
| * | Everything proved !! | Alex Auvolat | 2014-06-19 | 1 | -32/+76 |
| | | |||||
| * | Very buggy disjunction domain ! | Alex Auvolat | 2014-06-19 | 1 | -13/+50 |
| | | |||||
| * | Did most of the boring stuff. Now, work on the abstract domain. | Alex Auvolat | 2014-06-19 | 1 | -61/+101 |
| | | |||||
| * | Do some typing ; support multiple pre in abstract interpretation. | Alex Auvolat | 2014-06-19 | 1 | -26/+32 |
| | | |||||
| * | Nice view of guarantees ; add half test, proved. | Alex Auvolat | 2014-06-18 | 1 | -10/+59 |
| | | |||||
| * | Add gilbreath suite ; booleans are not represented in a good way. | Alex Auvolat | 2014-06-18 | 1 | -44/+62 |
| | | |||||
| * | Abstract interpretation gives good results on the limiter example. | Alex Auvolat | 2014-06-18 | 1 | -3/+3 |
| | | |||||
| * | Some abstract interpretation does something now. | Alex Auvolat | 2014-06-17 | 1 | -8/+49 |
| | | |||||
| * | Add bindings to apron. Next : work on abstract interpret. | Alex Auvolat | 2014-06-17 | 1 | -3/+1 |
| | | |||||
| * | Write transformation of program into logical formula. | Alex Auvolat | 2014-06-17 | 1 | -0/+203 |
 |
index : scade-analyzer.git | |
| Analyse statique de SCADE |
| summaryrefslogtreecommitdiff |