-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathCHANGES.txt
40 lines (38 loc) · 1.32 KB
/
CHANGES.txt
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
v1.3.3 2020/09/29
- new qlrf: BMS
v1.3.2 2020/06/23
- Koat parser fix
v1.3.1 2020/06/19
- parameter to preserve cost when CFR
- new binaries of PE that allows not to unfold nodes
v1.3 2020/06/04
- non-termination reachability
- allowing C as entry
- renaming a parameter
- optimizing close walks
- sampling non-deterministic variables
- give properties of nodes through a different file
v1.2.1 2019/06/09
- variables domain via parameter
- smt2 as output format
- close walks
- analyse non determinism of close walks
v1.2 2019/01/23 (remove ppl dependency at this level)
- invariants and all node-properties are now independent from ppl.
- all the algorithms are now independent from ppl.
- minor other improvements.
- pep8.
v1.1 2018/12/19
- check assertions of cfgs and refined cfgs
- properties of projection are computed now on python side
- remove no important variables has been moved.
- partial-evaluation now can handle simple sccs calling "prepare" first.
- analyse termination and non-termination in one single call.
- three possible strategies to apply CFR. After, at scc level and Before.
- algorithm to compute nodes on the way to a set of nodes.
- 'print-graphs' argument to print the fc and svg of the cfg and their corresponding refined graphs.
v0.5 2018/10/02
v0.2 2018/09/19
v0.0.1 2017/08/11
- Initial release
- Package adaptation