A Dependency Pair Framework for Innermost Complexity Analysis of Term Rewrite Systems

No abstract is available for this paper.

• Publication year

  2011

• Venue

  CADE

• Publication date

  2011-07-31

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1007/978-3-642-22438-6_32
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Automated Implicit Computational Complexity Analysis (cid:63)

  2013cited by this paper
• Functional and Logic Programming

  2012cited by this paper
• Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications

  2011cited by this paper
• Automated termination proofs for haskell by term rewriting

  2011cited by this paper
• Revisiting Matrix Interpretations for Polynomial Derivational Complexity of Term Rewriting

  2010cited by this paper
• A New Intersection Model for Multitolerance Graphs , Hierarchy , and Efficient Algorithms

  2010cited by this paper
• Complexity Analysis by Graph Rewriting

  2010cited by this paper
• Automated Termination Analysis of Java Bytecode by Term Rewriting

  2010cited by this paper
• Modular Complexity Analysis via Relative Complexity

  2010influential reference
• Polynomially Bounded Matrix Interpretations

  2010cited by this paper
• Closing the Gap Between Runtime Complexity and Polytime Computability

  2010cited by this paper
• Model checking of software for microcontrollers

  2010cited by this paper
• The Recognition of Tolerance and Bounded Tolerance Graphs is NP-complete

  2009cited by this paper
• Dependency Pairs and Polynomial Path Orders

  2009cited by this paper
• Derandomizing Non-uniform Color-Coding I

  2009cited by this paper
• Max/Plus Tree Automata for Termination of Term Rewriting

  2009cited by this paper
• Parametrized Regular Infinite Games and Higher-Order Pushdown Strategies

  2009cited by this paper
• Automated Complexity Analysis Based on the Dependency Pair Method

  2008influential reference
• Complexity, Graphs, and the Dependency Pair Method

  2008influential reference
• Complexity Analysis of Term Rewriting Based on Matrix and Context Dependent Interpretations

  2008cited by this paper
• Characterizations of polynomial complexity classes with a better intensionality

  2008cited by this paper
• Automated Implicit Computational Complexity Analysis (System Description)

  2008cited by this paper
• Certifying a Tree Automata Completion Checker

  2008cited by this paper
• Monodi fragments of rst-order temporallogi s : 2000 { 2001

  2007cited by this paper
• Matrix Interpretations for Proving Termination of Term Rewriting

  2006cited by this paper
• Mechanizing and Improving Dependency Pairs

  2006influential reference
• Automating the Dependency Pair Method

  2005cited by this paper
• The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs

  2005cited by this paper
• Algorithms with polynomial interpretation termination proof

  2001influential reference
• Polynomial-time computation via local inference relations

  2000cited by this paper
• Termination of term rewriting using dependency pairs

  2000cited by this paper
• Linear types and non-size-increasing polynomial time computation

  1999cited by this paper
• Term rewriting and all that

  1998cited by this paper
• Termination Proofs and the Length of Derivations (Preliminary Version)

  1989cited by this paper
• Automated reasoning

  1987cited by this paper
• Under Consideration for Publication in Theory and Practice of Logic Programming Automated Termination Analysis for Logic Programs with Cut *

  year unknowncited by this paper

• Complexity Analysis for Call-by-Value Higher-Order Rewriting

  2023cites this paper
• Cost-Size Semantics for Call-By-Value Higher-Order Rewriting

  2023cites this paper
• Analyzing Innermost Runtime Complexity Through Tuple Interpretations

  2023cites this paper
• A modular cost analysis for probabilistic programs

  2020cites this paper
• Hard.

  2020cites this paper
• Inferring Lower Bounds for Runtime Complexity

  2015cites this paper
• Symbolic vs . Algorithmic Differentiation of GSL Integration Routines

  2015cites this paper
• Analysing the complexity of functional programs: higher-order meets first-order

  2015cites this paper
• HotBox: Testing Temperature Effects in Sensor Networks

  2014cites this paper
• Time-continuous behaviour comparison based on abstract models

  2014cites this paper
• Algorithmic Differentiation of Numerical Methods : Second-Order Tangent and Adjoint Solvers for Systems of Parametrized Nonlinear Equations

  2014cites this paper
• An Operational Semantics for Activity Diagrams using SMV

  2014cites this paper
• MontiArc - Architectural Modeling of Interactive Distributed and Cyber-Physical Systems

  2014cites this paper
• Sequence Level Salient Object Proposals for Generic Object Detection in Video

  2014cites this paper
• A Discrete Adjoint Model for OpenFOAM

  2013cites this paper
• Polynomial Path Orders

  2013cites this paper
• Small Polynomial Path Orders in TCT∗

  2013cites this paper
• Better Termination Proving through Cooperation

  2013cites this paper
• Analyzing Innermost Runtime Complexity of Term Rewriting by Dependency Pairs

  2013cites this paper
• C C ] 5 F eb 2 01 3 A Combination Framework for Complexity ∗

  2013influential citation
• SensorCloud: Towards the Interdisciplinary Development of a Trustworthy Platform for Globally Interconnected Sensors and Actuators

  2013cites this paper
• A combination framework for complexity

  2013cites this paper
• Tyrolean Complexity Tool: Features and Usage

  2013cites this paper
• SMC-MuSe: A Framework for Secure Multi-Party Computation on MultiSets

  2013cites this paper
• Algorithmic Differentiation of Numerical Methods : Tangent-Linear and Adjoint Solvers for Systems of Nonlinear Equations

  2012cites this paper
• Strategy Machines and their Complexity ( with addendum )

  2012cites this paper
• Polynomial Path Orders: A Maximal Model

  2012cites this paper
• Computing Game Metrics on Markov Decision Processes

  2012cites this paper
• Algorithmic Differentiation of Numerical Methods : Tangent-Linear and Adjoint Direct Solvers for Systems of Linear Equations

  2012cites this paper
• Strategy Machines and Their Complexity

  2012cites this paper
• Symbolic evaluation graphs and term rewriting: a general methodology for analyzing logic programs

  2012cites this paper
• A Complexity Preserving Transformation from Jinja Bytecode to Rewrite Systems

  2012cites this paper
• Bounded Termination of Monotonicity-Constraint Transition Systems

  2012cites this paper
• A new order-theoretic characterisation of the polytime computable functions☆

  2012cites this paper
• SAT encodings: from constraint-based termination analysis to circuit synthesis

  2012cites this paper
• Compiler-Generated Subgradient Code for McCormick Relaxations

  2011cites this paper
• A Linear Operational Semantics for Termination and Complexity Analysis of ISO Prolog

  2011cites this paper
• Automated Detection of Non-termination and NullPointerExceptions for Java Bytecode

  2011cites this paper
• Compositional Failure Detection in Structured Transition Systems

  2011cites this paper
• Juggrnaut - An Abstract JVM

  2011cites this paper
• The Derivational Complexity Induced by the Dependency Pair Method

  2009cites this paper