From Jinja bytecode to term rewriting: a complexity reflecting transformation
From MaRDI portal
Publication:1640985
DOI10.1016/j.ic.2018.05.007zbMath1395.68160OpenAlexW2805029593MaRDI QIDQ1640985
Publication date: 14 June 2018
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2018.05.007
Analysis of algorithms and problem complexity (68Q25) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Grammars and rewriting systems (68Q42)
Related Items (max. 100)
\textsc{ComplexityParser}: an automatic tool for certifying poly-time complexity of Java programs ⋮ Mechanising a type-safe model of multithreaded Java with a verified compiler ⋮ Constant runtime complexity of term rewriting is semi-decidable ⋮ Runtime complexity analysis of logically constrained rewriting
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A combination framework for complexity
- Cost analysis of object-oriented bytecode programs
- Matrix interpretations for proving termination of term rewriting
- Reachability-based acyclicity analysis by abstract interpretation
- A new order-theoretic characterisation of the polytime computable functions
- Analyzing innermost runtime complexity of term rewriting by dependency pairs
- Resource Analysis of Complex Programs with Cost Equations
- Lower Runtime Bounds for Integer Programs
- Term Rewriting with Logical Constraints
- Polynomial Path Orders
- Tyrolean Complexity Tool: Features and Usage.
- Analysing the complexity of functional programs: higher-order meets first-order
- Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems
- Termination Graphs for Java Bytecode
- Matching Logic: An Alternative to Hoare/Floyd Logic
- Constrained Term Rewriting tooL
- Automated Complexity Analysis Based on the Dependency Pair Method
- Amortised Resource Analysis with Separation Logic
- Verifying a Compiler for Java Threads
- Proving Termination of Integer Term Rewriting
- A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs
- On Proving Termination of Constrained Term Rewrite Systems by Eliminating Edges from Dependency Graphs
- Matrix Interpretations on Polyhedral Domains.
- Inferring Lower Bounds for Runtime Complexity
- Termination Analysis of C Programs Using Compiler Intermediate Languages
- A Path Order for Rewrite Systems that Compute Exponential Time Functions
- Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting
- Automated Termination Analysis of Java Bytecode by Term Rewriting
- Modular Complexity Analysis via Relative Complexity
- Complexity, Graphs, and the Dependency Pair Method
- Static Analysis
- Verification, Model Checking, and Abstract Interpretation
This page was built for publication: From Jinja bytecode to term rewriting: a complexity reflecting transformation
