@inproceedings{alt-gre-kod-18-aa-taycor,
  author = {Matthias Althoff and Dmitry Grebenyuk and Niklas Kochdumper},
  title = {Implementation of {Taylor} Models in {CORA} 2018},
  booktitle = {Proceedings of the 5th International Workshop on Applied Verification of Continuous and Hybrid Systems (ARCH 2018)},
  year = 2018,
  series = {EPiC Series in Computing},
  volume = {54},
  pages = {145–173},
  doi = {10.29007/zzc7}
  url = {https://mediatum.ub.tum.de/doc/1454477/file.pdf},
  comment = {Implements IA, AA, and mixed in Matlab. Claims to be the first to evaluate mixed AA/IA?},
  abstract = {Tool Presentation: Computing guaranteed bounds of function outputs when their input variables are bounded by intervals is an essential technique for many formal methods. Due to the importance of bounding function outputs, several techniques have been proposed for this problem, such as interval arithmetic, affine arithmetic, and Taylor models. While all methods provide guaranteed bounds, it is typically unknown to a formal verification tool which approach is best suitable for a given problem. For this reason, we present an implementation of the aforementioned techniques in our MATLAB tool CORA so that advantages and disadvantages of different techniques can be quickly explored without having to compile code. In this work we present the implementation of Taylor models and affine arithmetic; our interval arithmetic implementation has already been published. We evaluate the performance of our implementation using a set of benchmarks against Flow* and INTLAB. To the best of our knowledge, we have also evaluated for the first time how a combination of interval arithmetic and Taylor models performs: our results indicate that this combination is faster and more accurate than only using Taylor models.}
}