556 search results - page 51 / 112 » Checking Interval Properties of Computations |
126
click to vote
CONCUR
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing th...
125
click to vote
FMICS
2010
Springer
15 years 4 months ago
2010
Springer
Bitwise instructions, loops and indirect data access pose difficult challenges to the verification of microcontroller programs. In particular, it is necessary to show that an indir...
158
click to vote
APPROX
2004
Springer
15 years 9 months ago
2004
Springer
In standard property testing, the task is to distinguish between objects that have a property P and those that are ε-far from P, for some ε > 0. In this setting, it is perfec...
148
click to vote
IANDC
2007
15 years 4 months ago
2007
We present a model, task automata, for real time systems with non-uniformly recurring computation tasks. It is an extended version of timed automata with asynchronous processes th...
135
click to vote
CHARME
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Unbounded model checking of invariant properties is typically solved using symbolic reachability. However, BDD based reachability methods suffer from lack of robustness ...