We provide an overall description of the Ciao multiparadigm programming system
emphasizing some of the novel aspects and motivations behind its design and …

This paper surveys recent work on applying analysis and transformation techniques that
originate in the field of constraint logic programming (CLP) to the problem of verifying …

This paper describes an inter-procedural technique for computing symbolic bounds on the
number of statements a procedure executes in terms of its scalar inputs and user-defined …

The classical approach to automatic cost analysis consists of two phases. Given a program
and some measure of cost, the analysis first produces cost relations (CRs), ie, recursive …

Cost analysis statically approximates the cost of programs in terms of their input data size.
This paper presents, to the best of our knowledge, the first approach to the automatic cost …

We introduce Pentagons (Pntg), a weakly relational numerical abstract domain useful for the
validation of array accesses in byte-code and intermediate languages (IL). This abstract …

The classical approach to automatic cost analysis consists of two phases. Given a program
and some measure of cost, we first produce recurrence relations (RRs) which capture the …

We present a modular approach to automatic complexity analysis of integer programs.
Based on a novel alternation between finding symbolic time bounds for program parts and …

A central method for analyzing the asymptotic complexity of a functional program is to extract
and then solve a recurrence that expresses evaluation cost in terms of input size. The …

We present a modular approach to automatic complexity analysis. Based on a novel
alternation between finding symbolic time bounds for program parts and using these to infer …