From Jinja bytecode to term rewriting: a complexity reflecting transformation
DOI10.1016/J.IC.2018.05.007zbMATH Open1395.68160OpenAlexW2805029593MaRDI QIDQ1640985FDOQ1640985
Authors: Georg Moser, Michael Schaper 
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
Recommendations
- Transforming derivational complexity of term rewriting to runtime complexity
- Implementing term rewriting by jungle evaluation
- Modular termination proofs of recursive Java bytecode programs by term rewriting
- Automated termination analysis of Java bytecode by term rewriting
- Publication:3490954
- scientific article; zbMATH DE number 4074536
- Term rewriting: Some experimental results
- Jinja: towards a comprehensive formal semantics for a Java-like language
- Processes, Terms and Cycles: Steps on the Road to Infinity
Analysis of algorithms and problem complexity (68Q25) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Grammars and rewriting systems (68Q42)
Cites Work
- Constrained Term Rewriting tooL
- A new order-theoretic characterisation of the polytime computable functions
- Analyzing innermost runtime complexity of term rewriting by dependency pairs
- A combination framework for complexity
- 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
- Automated Complexity Analysis Based on the Dependency Pair Method
- Modular complexity analysis via relative complexity
- Complexity, Graphs, and the Dependency Pair Method
- Title not available (Why is that?)
- Title not available (Why is that?)
- Term Rewriting with Logical Constraints
- On proving termination of constrained term rewrite systems by eliminating edges from dependency graphs
- Matrix interpretations for proving termination of term rewriting
- Static Analysis
- Matching logic: an alternative to Hoare/Floyd logic
- Automated termination analysis of Java bytecode by term rewriting
- Title not available (Why is that?)
- Cost analysis of object-oriented bytecode programs
- Verification, Model Checking, and Abstract Interpretation
- Amortised resource analysis with separation logic
- Verifying a Compiler for Java Threads
- Lower Runtime Bounds for Integer Programs
- Resource Analysis of Complex Programs with Cost Equations
- Proving Termination of Integer Term Rewriting
- A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs
- Termination Analysis of C Programs Using Compiler Intermediate Languages
- Reachability-based acyclicity analysis by abstract interpretation
- Termination graphs for Java bytecode
- Matrix Interpretations on Polyhedral Domains.
- Inferring Lower Bounds for Runtime Complexity
- A path order for rewrite systems that compute exponential time functions
- Modular termination proofs of recursive Java bytecode programs by term rewriting
Cited In (6)
- Runtime complexity analysis of logically constrained rewriting
- Mechanising a type-safe model of multithreaded Java with a verified compiler
- Title not available (Why is that?)
- Constant runtime complexity of term rewriting is semi-decidable
- Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs
- \textsc{ComplexityParser}: an automatic tool for certifying poly-time complexity of Java programs
Uses Software
This page was built for publication: From Jinja bytecode to term rewriting: a complexity reflecting transformation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1640985)
