Results 1  10
of
32
Quasiinterpretations a way to control resources
, 2011
"... This paper presents in a reasoned way our works on resource analysis by quasiinterpretations. The controlled resources are typically the runtime, the runspace or the size of a result in a program execution. Quasiinterpretations allow analyzing system complexity. A quasiinterpretation is a numeric ..."
Abstract

Cited by 34 (13 self)
 Add to MetaCart
This paper presents in a reasoned way our works on resource analysis by quasiinterpretations. The controlled resources are typically the runtime, the runspace or the size of a result in a program execution. Quasiinterpretations allow analyzing system complexity. A quasiinterpretation is a numerical assignment, which provides an upper bound on computed functions and which is compatible with the program operational semantics. Quasiinterpretation method offers several advantages: (i) It provides hints in order to optimize an execution, (ii) it gives resource certificates, and (iii) finding quasiinterpretations is decidable for a broad class which is relevant for feasible computations. By combining the quasiinterpretation method with termination tools (here term orderings), we obtained several characterizations of complexity classes starting from Ptime and Pspace.
Resource analysis by supinterpretation
 In FLOPS 2006, volume 3945 of LNCS
, 2006
"... Abstract. We propose a new method to control memory resources by static analysis. For this, we introduce the notion of supinterpretation which bounds from above the size of function outputs. This method applies to first order functional programming with pattern matching. This work is related to qua ..."
Abstract

Cited by 24 (10 self)
 Add to MetaCart
Abstract. We propose a new method to control memory resources by static analysis. For this, we introduce the notion of supinterpretation which bounds from above the size of function outputs. This method applies to first order functional programming with pattern matching. This work is related to quasiinterpretations but we are now able to determine resources of more algorithms and it is easier to perform an analysis with this new tools. 1
A PolyTime Functional Language from Light Linear Logic
 in "ESOP 2010", LNCS
"... We introduce a typed functional programming language LPL(acronym for Light linear Programming Language) in which all valid programs run in polynomial time, and which is complete for polynomial time functions. LPL is based on lambdacalculus, with constructors for algebraic datatypes, pattern matchi ..."
Abstract

Cited by 16 (4 self)
 Add to MetaCart
(Show Context)
We introduce a typed functional programming language LPL(acronym for Light linear Programming Language) in which all valid programs run in polynomial time, and which is complete for polynomial time functions. LPL is based on lambdacalculus, with constructors for algebraic datatypes, pattern matching and recursive definitions, and thus allows for a natural programming style. The validity of LPL programs is checked through typing and a syntactic criterion on recursive definitions. The higher order type system is designed from the ideas of Light linear logic: stratification, to control recursive calls, and weak exponential connectives §,!, to control duplication of arguments. 1
Bounded Linear Logic, Revisited
, 2009
"... We present QBAL, an extension of Girard, Scedrov and Scott’s bounded linear logic. The main novelty of the system is the possibility of quantifying over resource variables. This generalization makes bounded linear logic considerably more flexible, while preserving soundness and completeness for poly ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
We present QBAL, an extension of Girard, Scedrov and Scott’s bounded linear logic. The main novelty of the system is the possibility of quantifying over resource variables. This generalization makes bounded linear logic considerably more flexible, while preserving soundness and completeness for polynomial time. In particular, we provide compositional embeddings of Leivant’s RRW and Hofmann’s LFPL into QBAL.
A characterization of Alternating log time by first order functional programs
"... ..."
(Show Context)
Derivational Complexity is an Invariant Cost Model ⋆
"... Abstract. We show that in the context of orthogonal term rewriting systems, derivational complexity is an invariant cost model, both in innermost and in outermost reduction. This has some interesting consequences for (asymptotic) complexity analysis, since many existing methodologies only guarantee ..."
Abstract

Cited by 8 (5 self)
 Add to MetaCart
Abstract. We show that in the context of orthogonal term rewriting systems, derivational complexity is an invariant cost model, both in innermost and in outermost reduction. This has some interesting consequences for (asymptotic) complexity analysis, since many existing methodologies only guarantee bounded derivational complexity. 1
Quasiinterpretations
, 2004
"... This paper presents in a reasoned way our works on resource analysis by quasiinterpretations. The controlled resources are typically the runtime, the runspace or the size of a result in a program execution. Quasiinterpretations assign to each program symbol a numerical function which is compatible ..."
Abstract

Cited by 8 (7 self)
 Add to MetaCart
(Show Context)
This paper presents in a reasoned way our works on resource analysis by quasiinterpretations. The controlled resources are typically the runtime, the runspace or the size of a result in a program execution. Quasiinterpretations assign to each program symbol a numerical function which is compatible with the computationnal semantics. The quasiinterpretation method offers several advantages. It allows to predict system complexity, may provide hints in order to optimize the execution, it gives resource certificates, and finally, can be automated. We propose a method to determine if a program admits or not a quasiinterpretation in a broad class which is relevant for feasible computations. By combining the quasiinterpretation method with termination tools (here term orderings), we have obtained several characterizations of complexity classes starting from Ptime and Pspace.
VERIFICATION OF PTIME REDUCIBILITY FOR SYSTEM F TERMS: TYPE INFERENCE IN DUAL LIGHT AFFINE LOGIC.
, 2007
"... In a previous work we introduced Dual light affine logic (DLAL) ([BT04]) as a variant of Light linear logic suitable for guaranteeing complexity properties on lambda calculus terms: all typable terms can be evaluated in polynomial time by beta reduction and all Ptime functions can be represented. In ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
In a previous work we introduced Dual light affine logic (DLAL) ([BT04]) as a variant of Light linear logic suitable for guaranteeing complexity properties on lambda calculus terms: all typable terms can be evaluated in polynomial time by beta reduction and all Ptime functions can be represented. In the present work we address the problem of typing lambdaterms in secondorder DLAL. For that we give a procedure which, starting with a term typed in system F, determines whether it is typable in DLAL and outputs a concrete typing if there exists any. We show that our procedure can be run in time polynomial in the size of the original Church typed system F term.