Results 1  10
of
3,541
Fast and Efficient Generation of Loop Bounds
 PROCEEDINGS OF PARCO '93, ELSEVIER SCIENCE PUBLISHERS (NORTH
, 1993
"... Current loop generation techniques are based on FourierMotzkin pairwaise elimination, which is known to be very memory and computationintensive. In this paper we explore an alternative way: the use of parametric linear programming, which allows to separate the computation of distinct loop bounds ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
bounds and leads to a parallel algorithm for loop generation.
TestBased Inference of Polynomial LoopBound Functions
, 2010
"... This paper presents an interpolationbased method of inferring arbitrary degree loopbound functions for Java programs. Given a loop, by its “loopbound function ” we mean a function with the numeric program variables as its parameters, that is used to bound the number of loopiterations. Using our ..."
Abstract

Cited by 9 (4 self)
 Add to MetaCart
This paper presents an interpolationbased method of inferring arbitrary degree loopbound functions for Java programs. Given a loop, by its “loopbound function ” we mean a function with the numeric program variables as its parameters, that is used to bound the number of loopiterations. Using our
Formal Verification of Loop Bound Estimation for WCET Analysis
"... Worstcase execution time (WCET) estimation tools are complex pieces of software performing tasks such as computation on control flow graphs (CFGs) and bound calculation. In this paper, we present a formal verification (in Coq) of a loop bound estimation. It relies on program slicing and bound calcu ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Worstcase execution time (WCET) estimation tools are complex pieces of software performing tasks such as computation on control flow graphs (CFGs) and bound calculation. In this paper, we present a formal verification (in Coq) of a loop bound estimation. It relies on program slicing and bound
DataFlow Based Detection of Loop Bounds
 In Workshop on ExecutionTime Analysis (WCET
, 2007
"... To calculate the WCET of a program, safe upper bounds on the number of loop iterations for all loops in the program are needed. As the manual annotation of all loops with such bounds is difficult and time consuming, the WCET analyzer aiT originally developed by Saarland University and AbsInt GmbH us ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
To calculate the WCET of a program, safe upper bounds on the number of loop iterations for all loops in the program are needed. As the manual annotation of all loops with such bounds is difficult and time consuming, the WCET analyzer aiT originally developed by Saarland University and AbsInt Gmb
Quantum complexity theory
 in Proc. 25th Annual ACM Symposium on Theory of Computing, ACM
, 1993
"... Abstract. In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s model of a quantum Turing machine (QTM) [Proc. Roy. Soc. London Ser. A, 400 (1985), pp. 97–117]. This constructi ..."
Abstract

Cited by 574 (5 self)
 Add to MetaCart
–117]. This construction is substantially more complicated than the corresponding construction for classical Turing machines (TMs); in fact, even simple primitives such as looping, branching, and composition are not straightforward in the context of quantum Turing machines. We establish how these familiar primitives can
Loopus A Tool for Computing Loop Bounds for C Programs
"... We describe the current state of our tool Loopus which computes loop bounds for C programs. In this onepage abstract we describe the current state of our tool Loopus which automatically computes loop bounds for C programs. Loopus can also be seen as contribution towards solving the termination prob ..."
Abstract
 Add to MetaCart
We describe the current state of our tool Loopus which computes loop bounds for C programs. In this onepage abstract we describe the current state of our tool Loopus which automatically computes loop bounds for C programs. Loopus can also be seen as contribution towards solving the termination
Automatic Derivation of Loop Bounds and Infeasible Paths for WCET Analysis Using Abstract Execution
 In RTSS
, 2006
"... Static WorstCase Execution Time (WCET) analysis is a technique to derive upper bounds for the execution times of programs. Such bounds are crucial when designing and verifying realtime systems. A key component for statically deriving safe and tight WCET bounds is information on the possible prog ..."
Abstract

Cited by 50 (10 self)
 Add to MetaCart
present a method for deriving such flow information called abstract execution. This method can automatically calculate loop bounds, bounds for including nested loops, as well as many types of infeasible paths. Our evaluations show that it can calculate WCET estimates automatically, without any user
Two–Loop Bound–State Calculations and Squared Decay Rates
, 2003
"... Abstract We discuss the ǫmethod as used in various recent QED boundstate calculations by considering mathematical model examples. Recently obtained results for higherorder selfenergy binding corrections at the twoloop level are reviewed. Problems associated with the interpretation of squared de ..."
Abstract
 Add to MetaCart
Abstract We discuss the ǫmethod as used in various recent QED boundstate calculations by considering mathematical model examples. Recently obtained results for higherorder selfenergy binding corrections at the twoloop level are reviewed. Problems associated with the interpretation of squared
Loop Bound Analysis based on a Combination of Program Slicing, Abstract Interpretation, and Invariant Analysis †
"... Static WorstCase Execution Time (WCET) analysis is a technique to derive upper bounds for the execution times of programs. Such bounds are crucial when designing and verifying realtime systems. A key component for static derivation of precise WCET estimates is upper bounds on the number of times d ..."
Abstract

Cited by 22 (3 self)
 Add to MetaCart
different loops can be iterated. In this paper we present an approach for deriving upper loop bounds based on a combination of standard program analysis techniques. The idea is to bound the number of different states in the loop which can influence the exit conditions. Given that the loop terminates
Scanning Polyhedra with DO Loops
, 1991
"... Supercompilers perform complex program transformations which often result in new loop bounds. This paper shows that, under the usual assumptions in automatic parallelization, most transformations on loop nests can be expressed as affine transformations on integer sets de ned by polyhedra and that th ..."
Abstract

Cited by 216 (5 self)
 Add to MetaCart
Supercompilers perform complex program transformations which often result in new loop bounds. This paper shows that, under the usual assumptions in automatic parallelization, most transformations on loop nests can be expressed as affine transformations on integer sets de ned by polyhedra
Results 1  10
of
3,541