218 search results - page 31 / 44 » Verifying Safety Properties with the TLA Proof System |
TACS
1997
Springer
15 years 3 months ago
1997
Springer
We present a type-based technique for the veri cation of deadlock-freedom in asynchronous concurrent systems. Our general approach is to start with a simple interaction category, i...
FORMATS
2004
Springer
15 years 5 months ago
2004
Springer
We propose an effective and complete method for verifying safety and properties of timed systems, which is based on predicate abstraction for g finite abstractions of timed autom...
130
click to vote
CADE
2007
Springer
16 years 1 days ago
2007
Springer
Manna and Pnueli have extensively shown how a mixture of first-order logic (FOL) and discrete Linear time Temporal Logic (LTL) is sufficient to precisely state verification problem...
109
click to vote
IFM
2005
Springer
15 years 5 months ago
2005
Springer
We present an embedding of the stable failures model of CSP in the PVS theorem prover. Our work, extending a previous embedding of the traces model of CSP in [6], provides a platfo...
ATVA
2010
Springer
15 years 25 days ago
2010
Springer
Abstract. This paper is concerned with a method for computing reachable sets of linear continuous systems with uncertain input. Such a method is required for verification of hybrid...