Runtime Complexity Analysis of Logically Constrained Rewriting
Authors:
- 13 February 2021
- book chapter
- Published by Springer Nature
- p. 37-55
Abstract
No abstract availableKeywords
All Related Versions
This publication has 36 references indexed in Scilit:
- Computation takes time, but how much?Communications of the ACM, 2014
- On the Inference of Resource Usage Upper and Lower BoundsACM Transactions on Computational Logic, 2013
- Analyzing Innermost Runtime Complexity of Term Rewriting by Dependency PairsJournal of Automated Reasoning, 2013
- Term Rewriting with Logical Constraints2013
- Symbolic Evaluation Graphs and Term Rewriting — A General Methodology for Analyzing Logic ProgramsLecture Notes in Computer Science, 2013
- Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis2008
- The worst-case execution-time problem—overview of methods and survey of toolsACM Transactions on Embedded Computing Systems, 2008
- Z3: An Efficient SMT Solver2008
- Automated Complexity Analysis Based on the Dependency Pair MethodLecture Notes in Computer Science, 2007
- A Complete Method for the Synthesis of Linear Ranking Functions2004