We present ABC, a software tool for automatically computing symbolic upper bounds on the number of iterations of nested program loops. The system combines static analysis of programs with symbolic summation techniques to derive loop invariant relations between program variables. Iteration bounds are obtained from the inferred invariants, by replacing variables with bounds on their greatest values. We have successfully applied ABC to a large number of examples. The derived symbolic bounds express non-trivial polynomial relations over loop variables. We also report on results to automatically infer symbolic expressions over harmonic numbers as upper bounds on loop iteration counts
Symbolic execution is a program analysis technique that is used for many purposes, one of which is t...
Optimizing parallel compilers need to be able to analyze nested loop programs with parametric affine...
AbstractThis paper is concerned with constructing, for each expression in a given program text, a sy...
We present ABC, a software tool for automatically computing symbolic upper bounds on the number of i...
This talk describes how a combination of symbolic computation techniques with first-order theorem pr...
This paper describes an inter-procedural technique for computing symbolic bounds on the number of st...
We describe methods that are able to count the number of integer solutions to selected free varia...
Provably correct software is one of the key challenges in our software-driven society. Program verif...
In 2008, Ben-Amram, Jones and Kristiansen showed that for a simple programming language|representing...
A fundamental problem that arises frequently in quantita-tive program analysis (e.g., resource usage...
Constructing a complete control-flow graph (CGF) and computing upper bounds on loops of a computing ...
In order to produce efficient parallel programs, optimizing compilers need to include an analysis of...
In 2008, Ben-Amram, Jones and Kristiansen showed that for a simple programming language - representi...
Software has become ubiquitous and its impact is still increasing. The more software is created, th...
We present abstract acceleration techniques for computing loop in-variants for numerical programs wi...
Symbolic execution is a program analysis technique that is used for many purposes, one of which is t...
Optimizing parallel compilers need to be able to analyze nested loop programs with parametric affine...
AbstractThis paper is concerned with constructing, for each expression in a given program text, a sy...
We present ABC, a software tool for automatically computing symbolic upper bounds on the number of i...
This talk describes how a combination of symbolic computation techniques with first-order theorem pr...
This paper describes an inter-procedural technique for computing symbolic bounds on the number of st...
We describe methods that are able to count the number of integer solutions to selected free varia...
Provably correct software is one of the key challenges in our software-driven society. Program verif...
In 2008, Ben-Amram, Jones and Kristiansen showed that for a simple programming language|representing...
A fundamental problem that arises frequently in quantita-tive program analysis (e.g., resource usage...
Constructing a complete control-flow graph (CGF) and computing upper bounds on loops of a computing ...
In order to produce efficient parallel programs, optimizing compilers need to include an analysis of...
In 2008, Ben-Amram, Jones and Kristiansen showed that for a simple programming language - representi...
Software has become ubiquitous and its impact is still increasing. The more software is created, th...
We present abstract acceleration techniques for computing loop in-variants for numerical programs wi...
Symbolic execution is a program analysis technique that is used for many purposes, one of which is t...
Optimizing parallel compilers need to be able to analyze nested loop programs with parametric affine...
AbstractThis paper is concerned with constructing, for each expression in a given program text, a sy...