Complexity analysis for \textbf{Java} with \textsf{AProVE}

DOI10.1007/978-3-319-66845-1_6MaRDI QIDQ5045475zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Analyzing program termination and complexity automatically with \textsf{AProVE}
• Proving termination of programs automatically with AProVE
• Modular termination proofs of recursive Java bytecode programs by term rewriting
• Complexity analysis for term rewriting by integer transition systems
• Automated termination analysis of Java bytecode by term rewriting

Cited in

(5)

• Analyzing program termination and complexity automatically with \textsf{AProVE}
• Runtime complexity analysis of logically constrained rewriting
• Proving termination of programs automatically with AProVE
• Constant runtime complexity of term rewriting is semi-decidable
• \textsc{ComplexityParser}: an automatic tool for certifying poly-time complexity of Java programs

This page was built for publication: Complexity analysis for \textbf{Java} with \textsf{AProVE}

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5045475)