A Note on Inconsistent Axioms in Rushby's "Systematic Formal Verification for Fault-Tolerant Time-Triggered Algorithms'

Authors:
Lee Pike
Affiliations:
-
Venue:
IEEE Transactions on Software Engineering
Year:
2006

Citing 2
Cited 2

Formal Verification for Fault-Tolerant Architectures: Prolegomena to the Design of PVS

IEEE Transactions on Software Engineering
Systematic Formal Verification for Fault-Tolerant Time-Triggered Algorithms

IEEE Transactions on Software Engineering

A formal approach to the verification of networks on chip

EURASIP Journal on Embedded Systems
Formalization and correctness of the PALS architectural pattern for distributed real-time systems

Theoretical Computer Science

Quantified Score

Hi-index	0.01

Visualization

Abstract

We describe some inconsistencies in John Rushby's axiomatization of time-triggered algorithms that he presented in these transactions and that he formally specifies and verifies in the mechanical theorem-prover PVS. We present corrections for these inconsistencies that have been checked for consistency in PVS.