1686 search results - page 3 / 338 » Programs as polygraphs: computability and complexity |
CORR
2010
Springer
13 years 1 months ago
2010
Springer
am analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of te...
ICLP
2009
Springer
14 years 6 months ago
2009
Springer
FSTTCS
2008
Springer
13 years 7 months ago
2008
Springer
A sup-interpretation is a tool which provides upper bounds on the size of the values computed by the function symbols of a program. Sup-interpretations have shown their interest to...
POPL
2009
ACM
14 years 6 months ago
2009
ACM
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 qu...
EUROGP
2001
Springer
13 years 10 months ago
2001
Springer
Recent theory work has shown that a Genetic Program (GP) used to produce programs may have output that is bounded above by the GP itself [l]. This paper presents proofs that show t...