Complexity Analysis for Java with AProVE

DOI10.1007/978-3-319-66845-1_6zbMath1498.68065OpenAlexW2748531242MaRDI QIDQ5045475

Florian Frohn, Jürgen Giesl

Publication date: 4 November 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-66845-1_6

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Related Items (3)

\textsc{ComplexityParser}: an automatic tool for certifying poly-time complexity of Java programs ⋮ Constant runtime complexity of term rewriting is semi-decidable ⋮ Runtime complexity analysis of logically constrained rewriting

This page was built for publication: Complexity Analysis for Java with AProVE