AbstractWe propose a size analysis procedure that combines testing and type checking to automatically obtain static output-on-input size dependencies for first-order functions. Attention is restricted to functions for which the size of the result is strictly polynomial, not necessarily monotone, in the sizes of the arguments.To infer a size dependency, the procedure generates hypotheses for increasing degrees of polynomials. For each degree, a polynomial is defined by a finite number of points. Based on interpolation theory, in this paper we establish an upper bound on the number of test runs and a correct choice of test data that guarantees that all polynomials representing sizes of output lists can be found. The resulting hypothesis is th...
A few typos corrected.A polynomial identity testing algorithm must determine whether an input polyno...
Abstract. Dependent types are useful for statically checking detailed specifications of programs and...
Many contemporary proof assistants based on dependent type theories such as Coq and Agda are founded...
AbstractWe propose a size analysis procedure that combines testing and type checking to automaticall...
Abstract. We present a size-aware type system for first-order shapely functions. Here, a function is...
Abstract. Size analysis can play an important role in optimising mem-ory management and in preventin...
We present a size-aware type system for first-order shapely functiondefinitions. Here, a function de...
Size analysis can be an important part of heap consumption analysis. This paper is a part of ongoing...
Contains fulltext : 72206.pdf (preprint version ) (Open Access)16th International ...
We describe a general method for testing whether a function on n input variables has a concise repre...
Contains fulltext : 36493.pdf (author's version ) (Open Access)20 p
AbstractApproaches to static analysis based on nonstandard type systems have received considerable i...
International audienceThe sup-interpretation method is proposed as a new tool to control memory reso...
In a previous paper, the sup-interpretation method was proposed as a new tool to control memory reso...
AbstractWe propose a linear type system with recursion operators for inductive datatypes which ensur...
A few typos corrected.A polynomial identity testing algorithm must determine whether an input polyno...
Abstract. Dependent types are useful for statically checking detailed specifications of programs and...
Many contemporary proof assistants based on dependent type theories such as Coq and Agda are founded...
AbstractWe propose a size analysis procedure that combines testing and type checking to automaticall...
Abstract. We present a size-aware type system for first-order shapely functions. Here, a function is...
Abstract. Size analysis can play an important role in optimising mem-ory management and in preventin...
We present a size-aware type system for first-order shapely functiondefinitions. Here, a function de...
Size analysis can be an important part of heap consumption analysis. This paper is a part of ongoing...
Contains fulltext : 72206.pdf (preprint version ) (Open Access)16th International ...
We describe a general method for testing whether a function on n input variables has a concise repre...
Contains fulltext : 36493.pdf (author's version ) (Open Access)20 p
AbstractApproaches to static analysis based on nonstandard type systems have received considerable i...
International audienceThe sup-interpretation method is proposed as a new tool to control memory reso...
In a previous paper, the sup-interpretation method was proposed as a new tool to control memory reso...
AbstractWe propose a linear type system with recursion operators for inductive datatypes which ensur...
A few typos corrected.A polynomial identity testing algorithm must determine whether an input polyno...
Abstract. Dependent types are useful for statically checking detailed specifications of programs and...
Many contemporary proof assistants based on dependent type theories such as Coq and Agda are founded...