4 search results - page 1 / 1 » Proving Invariants of I O Automata with TAME |
ASE
2002
13 years 4 months ago
2002
This paper describes a specialized interface to PVS called TAME (Timed Automata Modeling Environment) which provides automated support for proving properties of I/O automata. A maj...
FTCS
1998
13 years 6 months ago
1998
Most RAID controllers implemented in industry are complicated and di cult to reason about. This complexity has led to software and hardware systems that are di cult to debug and h...
CAV
1993
Springer
13 years 9 months ago
1993
Springer
Abstract. This paper presents a scalable approach to reasoning formally about distributed algorithms. It uses results about I O automata to extract a set of proof obligations for s...
CSFW
1999
IEEE
13 years 9 months ago
1999
IEEE
The combination of two security protocols, a simple shared-key communication protocol and the Di e-Hellman key distribution protocol, is modeled formally and proved correct. The m...