\textsc{ComplexityParser}: an automatic tool for certifying poly-time complexity of Java programs
From MaRDI portal
Publication:2119987
DOI10.1007/978-3-030-85315-0_20OpenAlexW3195668155MaRDI QIDQ2119987
Emmanuel Hainry, Olivier Zeyen, Emmanuel Jeandel, Romain Péchoux
Publication date: 31 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-85315-0_20
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Two function algebras defining functions in \(\mathsf{NC}^k\) Boolean circuits
- Cost analysis of object-oriented bytecode programs
- A strong-connectivity algorithm and its applications in data flow analysis
- A new recursion-theoretic characterization of the polytime functions
- Arithmetical hierarchy and complexity of computation
- A type-based complexity analysis of object oriented programs
- From Jinja bytecode to term rewriting: a complexity reflecting transformation
- Tight worst-case bounds for polynomial loop programs
- On the linear ranking problem for integer linear-constraint loops
- Objects in Polynomial Time
- SPEED: Symbolic Complexity Bound Analysis
- Efficient Type-Checking for Amortised Heap-Space Analysis
- Type-Based Complexity Analysis for Fork Processes
- Complexity Analysis for Java with AProVE
- A tier-based typed programming language characterizing Feasible Functionals
- The size-change principle for program termination
- SPEED
- Automatic Type Inference for Amortised Heap-Space Analysis
- Evolving Graph-Structures and Their Implicit Computational Complexity
- Complexity Information Flow in a Multi-threaded Imperative Language
