AbstractTemporal 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
Automated reasoning systems often suffer from redundancy: similar parts of derivations are repeated ...
To calculate the WCET of a program, safe upper bounds on the number of loop iterations for all loops...
This paper addresses the problem of proving a given invariance property phi of a loop in a numeric p...
Abstract. Most of the properties established during program verification are either invariants or de...
International audienceWorst-case execution time (WCET) estimation tools are complex pieces of softwa...
Abstract. Worst-case execution time (WCET) estimation tools are complex pieces of software performin...
International audienceWe present a new numerical abstract domain. This domain automatically detects ...
Abstract—Verification of web applications is a very important problem, and verifying loops is necess...
Geometric heuristics for the quantifier elimination approach presented by Kapur (2004) are investiga...
ABSTRACT V R Pratt has shown that the real and integer feastbdlty of sets of linear mequallUes ofthe...
Static Worst-Case Execution Time (WCET) ana-lysis is a technique to derive upper bounds for the ex-e...
This paper describes a sound technique that combines the precision of theorem proving with the loop-...
We present abstract acceleration techniques for computing loop in-variants for numerical programs wi...
An important problem in automatic parallelization of scientific programs is to generate loops from a...
this paper, we study and improve three recently proposed algorithms for identifying loops in an irre...
Automated reasoning systems often suffer from redundancy: similar parts of derivations are repeated ...
To calculate the WCET of a program, safe upper bounds on the number of loop iterations for all loops...
This paper addresses the problem of proving a given invariance property phi of a loop in a numeric p...
Abstract. Most of the properties established during program verification are either invariants or de...
International audienceWorst-case execution time (WCET) estimation tools are complex pieces of softwa...
Abstract. Worst-case execution time (WCET) estimation tools are complex pieces of software performin...
International audienceWe present a new numerical abstract domain. This domain automatically detects ...
Abstract—Verification of web applications is a very important problem, and verifying loops is necess...
Geometric heuristics for the quantifier elimination approach presented by Kapur (2004) are investiga...
ABSTRACT V R Pratt has shown that the real and integer feastbdlty of sets of linear mequallUes ofthe...
Static Worst-Case Execution Time (WCET) ana-lysis is a technique to derive upper bounds for the ex-e...
This paper describes a sound technique that combines the precision of theorem proving with the loop-...
We present abstract acceleration techniques for computing loop in-variants for numerical programs wi...
An important problem in automatic parallelization of scientific programs is to generate loops from a...
this paper, we study and improve three recently proposed algorithms for identifying loops in an irre...
Automated reasoning systems often suffer from redundancy: similar parts of derivations are repeated ...
To calculate the WCET of a program, safe upper bounds on the number of loop iterations for all loops...
This paper addresses the problem of proving a given invariance property phi of a loop in a numeric p...