Cost Analysis for Import and Export Using an Abstract Machine
Abstract
This paper presents the syntax and reduction rules for an abstract machine based on the JavaScript XML language. We incorporate the notion of cost into our reduction rules, and create a type system that over-approximate this cost. This over-approximation results in an equation that may contain unknowns originating from while loops. We conclude with a formal proof of soundness of the type system for our abstract machine, demonstrating that it over-approximates the cost of any terminating program. An implementation of the type system, constraint gathering, and the abstract machine is also presented
Cite
@article{arxiv.2410.18158,
title = {Cost Analysis for Import and Export Using an Abstract Machine},
author = {Benjamin Bennetzen and Daniel Vang Kleist and Emilie Sonne Steinmann and Loke Walsted and Nikolaj Rossander Kristensen and Peter Buus Steffensen},
journal= {arXiv preprint arXiv:2410.18158},
year = {2024}
}
Comments
Benjamin Bennetzen: 0009-0007-1751-6862 Daniel Vang Kleist: 0009-0005-1785-2124 Emilie Sonne Steinmann: 0009-0000-4733-5842 Loke Walsted: 0009-0002-1758-4594 Nikolaj Rossander Kristensen: 0009-0005-2339-8247 Peter Buus Steffensen: 0009-0005-6410-5869