From Jinja bytecode to term rewriting: a complexity reflecting transformation
type: Item
instance of: scholarly article
title: From Jinja bytecode to term rewriting: a complexity reflecting transformation
zbMATH Open document ID: 1395.68160
author: Georg Moser
author: Michael Schaper
published in: Information and Computation
publication date: 2018-06-14T00:00:00Z
Mathematics Subject Classification ID: 68Q30
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 6889848
zbMATH Keywords: program transformation
zbMATH Keywords: term rewriting
zbMATH Keywords: termination and resource analysis
zbMATH Keywords: automation
describes a project that uses: KITTeL
describes a project that uses: TcT
describes a project that uses: Ctrl
describes a project that uses: Jinja Threads
MaRDI profile type: Publication
full work available at URL: j.ic.2018.05.007
OpenAlex ID: W2805029593
cites work: Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems
cites work: Polynomial path orders
cites work: Matrix Interpretations on Polyhedral Domains.
cites work: A new order-theoretic characterisation of the polytime computable functions
cites work: Automated Complexity Analysis Based on the Dependency Pair Method
cites work: Complexity, Graphs, and the Dependency Pair Method
cites work: Analyzing innermost runtime complexity of term rewriting by dependency pairs
cites work: Modular Complexity Analysis via Relative Complexity
cites work: A combination framework for complexity
cites work: Inferring Lower Bounds for Runtime Complexity
cites work: Analysing the complexity of functional programs: higher-order meets first-order
cites work: Q2742791
cites work: Static Analysis
cites work: Verification, Model Checking, and Abstract Interpretation
cites work: Reachability-based acyclicity analysis by abstract interpretation
cites work: Tyrolean Complexity Tool: Features and Usage.
cites work: Verifying a Compiler for Java Threads
cites work: Lower Runtime Bounds for Integer Programs
cites work: Automated Termination Analysis of Java Bytecode by Term Rewriting
cites work: Q4799892
cites work: Termination Graphs for Java Bytecode
cites work: Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting
cites work: Q4671219
cites work: A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs
cites work: Termination Analysis of C Programs Using Compiler Intermediate Languages
cites work: On Proving Termination of Constrained Term Rewrite Systems by Eliminating Edges from Dependency Graphs
cites work: Term Rewriting with Logical Constraints
cites work: Proving Termination of Integer Term Rewriting
cites work: Constrained Term Rewriting tooL
cites work: Amortised Resource Analysis with Separation Logic
cites work: Cost analysis of object-oriented bytecode programs
cites work: Resource Analysis of Complex Programs with Cost Equations
cites work: Matching Logic: An Alternative to Hoare/Floyd Logic
cites work: Matrix interpretations for proving termination of term rewriting
cites work: A Path Order for Rewrite Systems that Compute Exponential Time Functions
DOI: 10.1016/J.IC.2018.05.007
Recommended article: Transforming derivational complexity of term rewriting to runtime complexity
Recommended article: Implementing term rewriting by jungle evaluation
Recommended article: Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting
Recommended article: Automated Termination Analysis of Java Bytecode by Term Rewriting
Recommended article: Q3490954
Recommended article: Q3805956
Recommended article: Term rewriting: Some experimental results
Recommended article: Q5435635
Recommended article: Processes, Terms and Cycles: Steps on the Road to Infinity
description: scientific article; zbMATH DE number 6889848