Skip to content

Commit a95b41d

Browse files
pmbittneribbem
authored andcommitted
readme fixes
1 parent 90c9cdf commit a95b41d

1 file changed

Lines changed: 3 additions & 2 deletions

File tree

README.md

Lines changed: 3 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -13,7 +13,7 @@ This replication package consists of four parts:
1313

1414
Our appendix consists of:
1515
1. An extended formalization of our concepts in the [Haskell][haskell] programming language. The corresponding source code is also part of this replication package (see below).
16-
2. A proof for completeness of variation tree diffs to represent edits to variation trees.
16+
2. The proofs for (a) the completeness of variation tree diffs to represent edits to variation trees, and (b) the completeness and unambiguity of our elementary edit patterns.
1717
3. An inspection of edit patterns from related work to show that existing patterns are either composite patterns built from our elementary patterns or similar to our elementary patterns.
1818
4. The complete results of our validation for all 44 datasets.
1919

@@ -46,7 +46,8 @@ To execute the replication you can run the _execute_ script corresponding to you
4646
All raw results are stored in the [results](results) directory. The aggregated results can be found in the following files:
4747
- [speed statistics](results/difftrees/speedstatistics.txt): contains information about the total runtime, median runtime, mean runtime, and more.
4848
- [classification results](results/difftrees/ultimateresult.metadata.txt): contains information about how often each pattern was found, and more.
49-
- [runtime histogram](results/runtime_histogram.png): the runtime histogram shown in the paper.
49+
50+
Moreover, the results comprise the (LaTeX) tables that are part of our paper and appendix.
5051

5152
## Haskell Formalization
5253
The extended formalization in Haskell is a library using the _Stack_ build system.

0 commit comments

Comments
 (0)