Published April 4, 2023
| Version v1.11.2
Software
Open
rindPHI/isla: ISLa 1.11.2
Description
[1.11.2] - 2023-04-04
Changed
- Worked on documentation; now available on https://isla.readthedocs.io/.
- New optimization in SMT formula solving: Variables exclusively occurring in
str.to.intcontexts are passed to Z3 as integers and later converted to strings, which reduces the solver's load. - Cleaned up / improved code corresponding to SMT formula solving optimizations.
- The default for the
ISLaSolverparameterenforce_unique_trees_in_queuechanged fromTruetoFalse. The old setting could improve performance if the same derivation tree can be generated by expansion and tree insertion (and similar cases), but can have very unpleasant side effects, e.g., in the presence of disjunctions (see GitHub Issue 53). If you encounter negative performance effects in your existing use cases, consider setting this flag toTruewhen creating theISLaSolver.
- Solved parser problem: Arithmetic differences (
a = b - c) not parsed correctly before. - Eliminated bug in solver: If an explicit start symbol was given, the given grammar was mutated. Solver invocations (including the constructor) should, however, not have such side effects. In fact, that problem rendered the test suite flaky.
delete_unreachable(which deletes unreachable nonterminal keys in a grammar) no longer mutates grammars, but instead returns a new grammar.
Files
rindPHI/isla-v1.11.2.zip
Files
(431.8 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:2b691ad8c3bc62fd8b284055fa412cea
|
431.8 kB | Preview Download |
Additional details
Related works
- Is supplement to
- https://github.com/rindPHI/isla/tree/v1.11.2 (URL)