From Jinja bytecode to term rewriting: a complexity reflecting transformation
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 1650458 (Why is no real title available?)
- scientific article; zbMATH DE number 2161330 (Why is no real title available?)
- scientific article; zbMATH DE number 1889386 (Why is no real title available?)
- A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs
- A combination framework for complexity
- A new order-theoretic characterisation of the polytime computable functions
- A path order for rewrite systems that compute exponential time functions
- Amortised resource analysis with separation logic
- Analysing the complexity of functional programs: higher-order meets first-order
- Analyzing innermost runtime complexity of term rewriting by dependency pairs
- Automated Complexity Analysis Based on the Dependency Pair Method
- Automated termination analysis of Java bytecode by term rewriting
- Complexity, Graphs, and the Dependency Pair Method
- Constrained term rewriting tooL
- Cost analysis of object-oriented bytecode programs
- Inferring lower bounds for runtime complexity
- Joint spectral radius theory for automated complexity analysis of rewrite systems
- Lower runtime bounds for integer programs
- Matching logic: an alternative to Hoare/Floyd logic
- Matrix interpretations for proving termination of term rewriting
- Matrix interpretations on polyhedral domains
- Modular complexity analysis via relative complexity
- Modular termination proofs of recursive Java bytecode programs by term rewriting
- On proving termination of constrained term rewrite systems by eliminating edges from dependency graphs
- Polynomial path orders
- Proving Termination of Integer Term Rewriting
- Reachability-based acyclicity analysis by abstract interpretation
- Resource analysis of complex programs with cost equations
- Static Analysis
- Term Rewriting with Logical Constraints
- Termination Analysis of C Programs Using Compiler Intermediate Languages
- Termination graphs for Java bytecode
- Tyrolean Complexity Tool: Features and Usage.
- Verification, Model Checking, and Abstract Interpretation
- Verifying a Compiler for Java Threads
Cited in
(6)- Mechanising a type-safe model of multithreaded Java with a verified compiler
- scientific article; zbMATH DE number 2090085 (Why is no real title available?)
- Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs
- Constant runtime complexity of term rewriting is semi-decidable
- Runtime complexity analysis of logically constrained rewriting
- \textsc{ComplexityParser}: an automatic tool for certifying poly-time complexity of Java programs
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)
