| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Minor corrections. | Alex Auvolat | 2014-06-26 | 1 | -2/+2 |
| | | | | | | | - 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 | -23/+30 |
| | | | | | | | | | | | - 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) | ||||
| * | Begin implementation of EDD ; SCA implemented. | Alex Auvolat | 2014-06-25 | 1 | -8/+1 |
| | | |||||
| * | Differentiate pre witin different scopes. | Alex Auvolat | 2014-06-25 | 1 | -0/+1 |
| | | |||||
| * | Implementation of disjunction domain seems to work. | Alex Auvolat | 2014-06-24 | 1 | -5/+7 |
| | | |||||
| * | Not much. Still does not work very well. | Alex Auvolat | 2014-06-20 | 2 | -12/+9 |
| | | |||||
| * | Everything proved !! | Alex Auvolat | 2014-06-19 | 1 | -1/+16 |
| | | |||||
| * | Very buggy disjunction domain ! | Alex Auvolat | 2014-06-19 | 2 | -23/+49 |
| | | |||||
| * | Did most of the boring stuff. Now, work on the abstract domain. | Alex Auvolat | 2014-06-19 | 4 | -3/+14 |
| | | |||||
| * | Do some typing ; support multiple pre in abstract interpretation. | Alex Auvolat | 2014-06-19 | 4 | -0/+367 |
| | | |||||
| * | Add gilbreath suite ; booleans are not represented in a good way. | Alex Auvolat | 2014-06-18 | 1 | -1/+1 |
| | | |||||
| * | Some abstract interpretation does something now. | Alex Auvolat | 2014-06-17 | 3 | -3/+3 |
| | | |||||
| * | Write transformation of program into logical formula. | Alex Auvolat | 2014-06-17 | 1 | -3/+3 |
| | | |||||
| * | Add AST for logical formula. | Alex Auvolat | 2014-06-17 | 1 | -1/+2 |
| | | |||||
| * | Begin of new interpret with more imperative concepts. Scope activation 'n stuff. | Alex Auvolat | 2014-06-13 | 3 | -29/+29 |
| | | |||||
| * | Move a lot of things. | Alex Auvolat | 2014-06-13 | 5 | -19/+19 |
| | | |||||
| * | Parse activate blocks. | Alex Auvolat | 2014-06-13 | 4 | -26/+71 |
| | | |||||
| * | Working prototype for an interpret ! But very messy. | Alex Auvolat | 2014-06-12 | 4 | -45/+110 |
| | | |||||
| * | Parse type groups. | Alex Auvolat | 2014-06-11 | 3 | -9/+20 |
| | | |||||
| * | Make code cleaner | Alex Auvolat | 2014-06-11 | 7 | -1906/+276 |
| | | |||||
| * | Initial commit: parser for tiny subset of SCADE language... | Alex Auvolat | 2014-06-11 | 7 | -0/+2207 |
 |
index : scade-analyzer.git | |
| Analyse statique de SCADE |
| summaryrefslogtreecommitdiff |