The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - September/October (1999 vol.25)
pp: 651-660
ABSTRACT
<p><b>Abstract</b>—Many critical real-time applications are implemented as time-triggered systems. We present a systematic way to derive such time-triggered implementations from algorithms specified as functional programs (in which form their correctness and fault-tolerance properties can be formally and mechanically verified with relative ease). The functional program is first transformed into an untimed synchronous system and, then, to its time-triggered implementation. The first step is specific to the algorithm concerned, but the second is generic and we prove its correctness. This proof has been formalized and mechanically checked with the PVS verification system. The approach provides a methodology that can ease the formal specification and assurance of critical fault-tolerant systems.</p>
INDEX TERMS
Formal methods, formal verification, time-triggered algorithms, synchronous systems, PVS.
CITATION
John Rushby, "Systematic Formal Verification for Fault-Tolerant Time-Triggered Algorithms", IEEE Transactions on Software Engineering, vol.25, no. 5, pp. 651-660, September/October 1999, doi:10.1109/32.815324
15 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool