We consider the following problem: given a program, find tight asymptoticbounds on the values of some variables at the end of the computation (or at anygiven program point) in terms of its input values. We focus on the case ofpolynomially-bounded variables, and on a weak programming language for which wehave recently shown that tight bounds for polynomially-bounded variables arecomputable. These bounds are sets of multivariate polynomials. While theircomputability has been settled, the complexity of this program-analysis problemremained open. In this paper, we show the problem to be PSPACE-complete. Themain contribution is a new, space-efficient analysis algorithm. This algorithmis obtained in a few steps. First, we develop an algorithm for...
We propose a static analysis for computing polynomial invariants for imperative programs. The analys...
Vector Addition Systems with States (VASS) provide a well-known and fundamental model for the analys...
ABSTRACT V R Pratt has shown that the real and integer feastbdlty of sets of linear mequallUes ofthe...
We consider the following problem: given a program, find tight asymptotic bounds on the values of s...
In 2008, Ben-Amram, Jones and Kristiansen showed that for a simple programming language|representing...
In 2008, Ben-Amram, Jones and Kristiansen showed that for a simple programming language - representi...
The problem of integer programming in bounded variables, over constraints with no more than twovari...
In 1979 Valiant showed that the complexity class VPe of families with polynomially bounded formula s...
In 1979 Valiant showed that the complexity class VP_e of families with polynomially bounded formula ...
We present ABC, a software tool for automatically computing symbolic upper bounds on the number of i...
Algebraic proof systems, such as Polynomial Calculus (PC) and Polynomial Calculus with Resolution (P...
We consider the fundamental problem of reachability analysis over imperative programs with real vari...
Intuitively, if we can prove that a program terminates, we expect some conclusion re-garding its com...
We propose an abstract interpretation based method to compute polynomial invariants for imperative p...
In this paper we study the complexity of the problems: given a loop, described by linear constraints...
We propose a static analysis for computing polynomial invariants for imperative programs. The analys...
Vector Addition Systems with States (VASS) provide a well-known and fundamental model for the analys...
ABSTRACT V R Pratt has shown that the real and integer feastbdlty of sets of linear mequallUes ofthe...
We consider the following problem: given a program, find tight asymptotic bounds on the values of s...
In 2008, Ben-Amram, Jones and Kristiansen showed that for a simple programming language|representing...
In 2008, Ben-Amram, Jones and Kristiansen showed that for a simple programming language - representi...
The problem of integer programming in bounded variables, over constraints with no more than twovari...
In 1979 Valiant showed that the complexity class VPe of families with polynomially bounded formula s...
In 1979 Valiant showed that the complexity class VP_e of families with polynomially bounded formula ...
We present ABC, a software tool for automatically computing symbolic upper bounds on the number of i...
Algebraic proof systems, such as Polynomial Calculus (PC) and Polynomial Calculus with Resolution (P...
We consider the fundamental problem of reachability analysis over imperative programs with real vari...
Intuitively, if we can prove that a program terminates, we expect some conclusion re-garding its com...
We propose an abstract interpretation based method to compute polynomial invariants for imperative p...
In this paper we study the complexity of the problems: given a loop, described by linear constraints...
We propose a static analysis for computing polynomial invariants for imperative programs. The analys...
Vector Addition Systems with States (VASS) provide a well-known and fundamental model for the analys...
ABSTRACT V R Pratt has shown that the real and integer feastbdlty of sets of linear mequallUes ofthe...