TransformationToolContest / ttc2019-tt2bdd

Free form TTC contest (Truth tables to Binary Decision Diagrams, from ATL Zoo)
MIT License
5 stars 7 forks source link

Review of ATL #11

Open rene-schoene opened 5 years ago

rene-schoene commented 5 years ago

The presented tool is basically the same as the reference solution, however performance has been optimized by

The paper is extremely short, with the actual presentation of the optimizations spanning ~1/3rd of a page. It assumes, that the reader is already familiar with the reference solution, and with internals of the ATL runtime. A general introduction, how the reference solution works should be added. With this, the optimizations could be explained better, as mentioned helpers like getTree or getPartition would be in context of their usage. Another interesting point would be, if those optimizations are general, i.e., if they are applicable to a wider range of transformation tasks. Furthermore, in the paper unsolved "issues that are in the transformation code" are mentioned but not explained in detail.

Metrics

  1. Does the solution use the provided benchmark structure, i.e., is a batch execution supported? → Yes
  2. Can all models be transformed within 10 minues? → Yes
  3. What kind of result is produced? BDT, BDD, with fix order → not described
  4. Is the transformation correct? → not described nor checked
  5. Computed Metrics (like number of decision or assignment nodes) → Only execution time