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...
We formalize the notion and initiate the investigation of approximate testing for arbitrary forms of...
This paper introduces a new methodology for the complexity analysis of higher-order functional progr...
This paper introduces a new methodology for the complexity analysis of higher-order functional progr...
AbstractWe propose a size analysis procedure that combines testing and type checking to automaticall...
Contains fulltext : 72206.pdf (preprint version ) (Open Access)16th International ...
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...
Abstract. We present a size-aware type system for first-order shapely functions. Here, a function is...
Contains fulltext : 36493.pdf (author's version ) (Open Access)20 p
Contains fulltext : 36644.pdf (publisher's version ) (Closed access)32 p
Abstract. Dependent types are useful for statically checking detailed specifications of programs and...
We describe a general method for testing whether a function on n input variables has a concise repre...
Many contemporary proof assistants based on dependent type theories such as Coq and Agda are founded...
International audienceSized types have been developed to make termination checking more perspicuous,...
Given a function f: F m → F over a finite field F, a low degree tester tests its proximity to an m-v...
We formalize the notion and initiate the investigation of approximate testing for arbitrary forms of...
This paper introduces a new methodology for the complexity analysis of higher-order functional progr...
This paper introduces a new methodology for the complexity analysis of higher-order functional progr...
AbstractWe propose a size analysis procedure that combines testing and type checking to automaticall...
Contains fulltext : 72206.pdf (preprint version ) (Open Access)16th International ...
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...
Abstract. We present a size-aware type system for first-order shapely functions. Here, a function is...
Contains fulltext : 36493.pdf (author's version ) (Open Access)20 p
Contains fulltext : 36644.pdf (publisher's version ) (Closed access)32 p
Abstract. Dependent types are useful for statically checking detailed specifications of programs and...
We describe a general method for testing whether a function on n input variables has a concise repre...
Many contemporary proof assistants based on dependent type theories such as Coq and Agda are founded...
International audienceSized types have been developed to make termination checking more perspicuous,...
Given a function f: F m → F over a finite field F, a low degree tester tests its proximity to an m-v...
We formalize the notion and initiate the investigation of approximate testing for arbitrary forms of...
This paper introduces a new methodology for the complexity analysis of higher-order functional progr...
This paper introduces a new methodology for the complexity analysis of higher-order functional progr...