| Commit message (Collapse) | Author | Age |
| |
|
|
|
|
|
| |
- Fix best first search algorithm
- Improve efficiency of exploration adapter
|
|\
| |
| | |
Initial version of State Coder
|
| |\
| |/
|/| |
|
|\ \
| | |
| | | |
Design-space exploration
|
| | | |
|
| | | |
|
| | |
| | |
| | |
| | |
| | |
| | |
| | | |
-Display values from all relevant interpretations
-Support TruthValue
-Add tabular formatting
-Add colors
|
| | | |
|
| |\ \
| |/ /
|/| | |
|
| | | |
|
| | | |
|
| | | |
|
| | |
| | |
| | |
| | |
| | |
| | | |
- Replace guru.nidi:graphviz-java with DOT based solution
- Draws the design space as well as the model states
- Design space nodes link to visualization of the sate
|
| | | |
|
| | | |
|
| | | |
|
| | | |
|
| | | |
|
| | |
| | |
| | |
| | | |
Uses Graphviz to create a visualization of the models and can save them to disk as an image or various textual representations
|
| | | |
|
| | |
| | |
| | |
| | |
| | |
| | | |
- Transformation rules
- Design Space Exploration adapter
- Depth First Strategy
|
| | |
| | |
| | |
| | | |
StateEquivalenceChecker prototypes
|
| |/
|/|
| |
| | |
No tests yet.
|
|\ \
| |/
|/| |
Datastructure versions
|
| |
| |
| |
| | |
When a Version is collected by gc, the store lets the state get collected by gc as well.
|
| |\
| |/
|/| |
|
|\ \
| | |
| | | |
Datastructure
|
| |/
| |
| |
| |
| |
| |
| | |
VersionedMapStoreStateImpl, update builder.
- details of the maps goes to internal packages
- ModelStoreBuilderImpl uses VersionedMapStoreFactoryBuilder
|
| | |
|
| | |
|
| |\
| |/
|/| |
|
|\ \
| | |
| | | |
feat: ordered query ResultSet
|
|/ /
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| | |
Enable deterministic state-space exploration by ordering activations in
lexicographic order.
This preliminary implementation adds oredering as a wrapper for ResultSet
instances, but more sophisticated support could be built directly into query
engine adapters if a query engine supports deterministic output by default.
* Implements Comparable for tuples with loops unrolled for small tuples by hand.
* Cleans up the contents of the (root of the) tools.refinery.query package.
* Adds ResultSetListener to notify clients about ResultSet changes.
* Adds OrderStatisticTree data structure for determinisitc ordering of keys.
|
| |
| |
| |
| |
| | |
The filer can't return true for the default value, because tuples with default
value cannot be enumerated.
|
| |
| |
| |
| | |
We will need to rework rule execution according to recent Dnf changes.
|
| | |
|
|\ \
| | |
| | | |
Query refactor
|
| | | |
|
| | | |
|
| | |
| | |
| | |
| | | |
Shorthad syntax for the most commonly used symbol types.
|
| | | |
|
| | |
| | |
| | |
| | |
| | | |
Add the ability to create assertions without pre-processing Dnf clauses (raw
matchin mode). Also fix tests broken by Dnf pre-processing.
|
| | | |
|
| | | |
|
| | | |
|
| | |
| | |
| | |
| | |
| | |
| | |
| | | |
* Introduce parameter directions for constraints and DNF
* Introduce variable directions for literals
* Infer and check variable directions in DNF and topologically sort literals by
their input variables
|
| | |
| | |
| | |
| | |
| | | |
Temporarily remove custom scrollbar and indentation styling, because they
interferred with cursor visibility.
|
| | | |
|
| | |
| | |
| | |
| | | |
Disable some rules that we don't use but require repeated file parsing.
|