501 search results - page 58 / 101 » Using Abstraction to Verify Arbitrary Temporal Properties |
225
click to vote
FAABS
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. The design of reactive systems must comply with logical correctness (the system does what it is supposed to do) and timeliness (the system has to satisfy a set of tempora...
145
click to vote
CONCUR
2006
Springer
15 years 9 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...
166
click to vote
CAV
2000
Springer
15 years 10 months ago
2000
Springer
We introduce discrete pushdown timed automata that are timed automata with integer-valued clocks augmented with a pushdown stack. A con guration of a discrete pushdown timed automa...
190
click to vote
ATVA
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. Model-checking alternating-time properties has recently attracted much interest in the verification of distributed protocols. While checking the validity of a specificati...
160
click to vote
FOSSACS
2009
Springer
16 years 19 days ago
2009
Springer
Bisimulation between processes has been proven a successful method for formalizing security properties. We argue that in certain cases, a scheduler that has full information on the...