Normalisation of Loops with Covariant Variables
Author(s) -
Marianne de Michiel,
Armelle Bonenfan,
Hugues Cassé
Publication year - 2012
Publication title -
electronic notes in theoretical computer science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.242
H-Index - 60
ISSN - 1571-0661
DOI - 10.1016/j.entcs.2012.11.005
Subject(s) - computer science , property (philosophy) , covariant transformation , computation , simple (philosophy) , loop (graph theory) , domain (mathematical analysis) , component (thermodynamics) , binary number , algorithm , theoretical computer science , mathematics , arithmetic , mathematical analysis , philosophy , physics , geometry , epistemology , combinatorics , thermodynamics
Temporal property verification is utterly important to ensure safety of critical real-time systems. A main component of this verification is the computation of Worst Case Execution Time (WCET) that requires, in turn, the determination of loop bounds. Although a lot of efforts have been performed in this domain, it remains relatively common cases which are unsolved. For example, to our knowledge, no fast automatic method can cope with the loop bound of a simple binary search look-up. In this paper, we present an approach to solve such loops by using arithmetico-geometric series, that is, loops with arithmetic and/or geometric incrementation with several variables. We have implemented and experimented this approach in our tool oRange
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom