Termination of rewriting systems by polynomial interpretations and its implementation
Science of Computer Programming
Hilbert's tenth problem
A new recursion-theoretic characterization of the polytime functions
Computational Complexity
Proving the correctness of reactive systems using sized types
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Computability and complexity: from a programming perspective
Computability and complexity: from a programming perspective
Term rewriting and all that
Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
Journal of the ACM (JACM)
The strength of non-size increasing computation
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Static prediction of heap space usage for first-order functional programs
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On Lexicographic Termination Ordering with Space Bound Certifications
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
On Proving Termination by Innermost Termination
RTA '96 Proceedings of the 7th International Conference on Rewriting Techniques and Applications
A type system for bounded space and functional in-place update
Nordic Journal of Computing
The max-plus algebra of the natural numbers has no finite equational basis
Theoretical Computer Science
Max-plus quasi-interpretations
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
Efficient first order functional program interpreter with time bound certifications
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Feasible reactivity in a synchronous Π-calculus
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
The intensional content of Rice's theorem
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Arctic Termination ...Below Zero
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Max/plus tree automata for termination of term rewriting
Acta Cybernetica
A characterization of NCk by first order functional programs
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Global and local space properties of stream programs
FOPARA'09 Proceedings of the First international conference on Foundational and practical aspects of resource analysis
Collected size semantics for functional programs over lists
IFL'08 Proceedings of the 20th international conference on Implementation and application of functional languages
A characterization of alternating log time by first order functional programs
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Resource bound certification for a tail-recursive virtual machine
APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
Verification of ptime reducibility for system f terms via dual light affine logic
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
A polytime functional language from light linear logic
ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
| Hi-index | 0.00 |
Quasi-interpretations are a tool to bound the size of the values computed by a first-order functional program (or a term rewriting system) and thus a mean to extract bounds on its computational complexity. We study the synthesis of quasi-interpretations selected in the space of polynomials over the max-plus algebra. We prove that the synthesis problem is NP-hard under various conditions and in NP for the particular case of multi-linear quasi-interpretations when programs are specified by rules of bounded size. We provide a polynomial time algorithm to synthesize homogeneous quasi-interpretations of bounded degree and show how to extend the algorithm to synthesize (general) quasi-interpretations. The resulting algorithm generalizes certain syntactic and type theoretic conditions proposed in the literature to control time and space complexity.