Theoretical Computer Science
Handbook of theoretical computer science (vol. B)
Termination proofs by multiset path orderings imply primitive recursive derivation lengths
Theoretical Computer Science - Selected papers of the Second International Conference on algebraic and logic programming, Nancy, France, October 1–3, 1990
A new recursion-theoretic characterization of the polytime functions
Computational Complexity
Some undecidable termination problems for semi-Thue systems
RTA-93 Selected papers of the fifth international conference on Rewriting techniques and applications
On the combinatorial and algebraic complexity of quantifier elimination
Journal of the ACM (JACM)
LOGSPACE and PTIME characterized by programming languages
Theoretical Computer Science - Special issue on mathematical foundations of programming semantics
Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
Journal of the ACM (JACM)
Journal of the ACM (JACM)
A Type System for Bounded Space and Functional In-Place Update--Extended Abstract
ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
Generalizing Cook's Transformation to Imperative Stack Programs
Proceedings of the Colloquium in Honor of Arto Salomaa on Results and Trends in Theoretical Computer Science
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
Termination of Rewrite Systems by Elementary Interpretations
Proceedings of the Third International Conference on Algebraic and Logic Programming
Ramified Recurrence and Computational Complexity II: Substitution and Poly-Space
CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
Linear Types and Non Size-Increasing Polynomial Time Computation
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Analysing the implicit complexity of programs
Information and Computation - Special issue: ICC '99
Algorithms with polynomial interpretation termination proof
Journal of Functional Programming
Relationships between nondeterministic and deterministic tape complexities
Journal of Computer and System Sciences
Max-plus quasi-interpretations
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
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 analysis by sup-interpretation
FLOPS'06 Proceedings of the 8th international conference on Functional and Logic Programming
Characterizations of polynomial complexity classes with a better intensionality
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
A flow calculus of mwp-bounds for complexity analysis
ACM Transactions on Computational Logic (TOCL)
Polynomial size analysis of first-order functions
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
Quasi-interpretation synthesis by decomposition an application to higher-order programs
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Upper bounds on stream I/O using semantic interpretations
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Global and local space properties of stream programs
FOPARA'09 Proceedings of the First international conference on Foundational and practical aspects of resource analysis
Static complexity analysis of higher order 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
Course of value distinguishes the intentionality of programming languages
Proceedings of the Second Symposium on Information and Communication Technology
Resource analysis by sup-interpretation
FLOPS'06 Proceedings of the 8th international conference on Functional and Logic Programming
Elementary linear logic revisited for polynomial time and an exponential time hierarchy
APLAS'11 Proceedings of the 9th Asian conference on Programming Languages and Systems
A short introduction to implicit computational complexity
ESSLLI'10 Proceedings of the 2010 conference on ESSLLI 2010, and ESSLLI 2011 conference on Lectures on Logic and Computation
Synthesis of sup-interpretations: A survey
Theoretical Computer Science
| Hi-index | 5.23 |
This paper presents in a reasoned way our works on resource analysis by quasi-interpretations. The controlled resources are typically the runtime, the runspace or the size of a result in a program execution. Quasi-interpretations allow the analysis of system complexity. A quasi-interpretation is a numerical assignment, which provides an upper bound on computed functions and which is compatible with the program operational semantics. The quasi-interpretation method offers several advantages: (i) It provides hints in order to optimize an execution, (ii) it gives resource certificates, and (iii) finding quasi-interpretations is decidable for a broad class which is relevant for feasible computations. By combining the quasi-interpretation method with termination tools (here term orderings), we obtained several characterizations of complexity classes starting from Ptime and Pspace.