Corpus ID: 6604896

Tighter Loop Bound Analysis (Technical report)

@article{Cadek2016TighterLB,
  title={Tighter Loop Bound Analysis (Technical report)},
  author={Pavel Cadek and Jan Strej{\vc}ek and Marek Trt{\'i}k},
  journal={ArXiv},
  year={2016},
  volume={abs/1605.03636}
}
  • Pavel Cadek, Jan Strejček, Marek Trtík
  • Published 2016
  • Computer Science
  • ArXiv
  • We present a new algorithm for computing upper bounds on the number of executions of each program instruction during any single program run. The upper bounds are expressed as functions of program input values. The algorithm is primarily designed to produce bounds that are relatively tight, i.e. not unnecessarily blown up. The upper bounds for instructions allow us to infer loop bounds, i.e.~upper bounds on the number of loop iterations. Experimental results show that the algorithm implemented… CONTINUE READING
    1 Citations

    Figures, Tables, and Topics from this paper.

    Explore Further: Topics Discussed in This Paper

    Tighter Loop Bound Analysis
    • 3
    • PDF

    References

    SHOWING 1-10 OF 34 REFERENCES
    Symbolic Loop Bound Computation for WCET Analysis
    • 52
    • PDF
    Automatic Derivation of Loop Bounds and Infeasible Paths for WCET Analysis Using Abstract Execution
    • 204
    • PDF
    Abstracting path conditions
    • 22
    • PDF
    Difference constraints: an adequate abstraction for complexity analysis of imperative programs
    • 14
    • PDF