Automated termination analysis of Java bytecode by term rewriting
From MaRDI portal
Recommendations
- Modular termination proofs of recursive Java bytecode programs by term rewriting
- Termination graphs for Java bytecode
- A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs
- Proving termination of programs automatically with AProVE
- Analyzing program termination and complexity automatically with \textsf{AProVE}
Cited in
(18)- A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs
- Analyzing program termination and complexity automatically with \textsf{AProVE}
- Lower-bound synthesis using loop specialization and Max-SMT
- A framework for computing finite SLD trees
- Automatic synthesis of logical models for order-sorted first-order theories
- Proving termination by dependency pairs and inductive theorem proving
- Verifying procedural programs via constrained rewriting induction
- From Jinja bytecode to term rewriting: a complexity reflecting transformation
- Termination graphs for Java bytecode
- Modular termination proofs of recursive Java bytecode programs by term rewriting
- Proving termination of programs automatically with AProVE
- A dependency pair framework for innermost complexity analysis of term rewrite systems
- Analyzing innermost runtime complexity of term rewriting by dependency pairs
- Automatically proving termination and memory safety for programs with pointer arithmetic
- Proving Termination of C Programs with Lists
- Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs
- Complexity analysis for \textbf{Java} with \textsf{AProVE}
- Lower bounds for runtime complexity of term rewriting
This page was built for publication: Automated termination analysis of Java bytecode by term rewriting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5389149)
