A Note on Inconsistent Axioms in Rushby's "Systematic Formal Verification for Fault-Tolerant Time-Triggered Algorithms' May 2006 (vol. 32 no. 5) pp. 347-348
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TSE.2006.41
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. [1] J. Rushby, “Systematic Formal Verification for Fault-Tolerant Time-Triggered Algorithms,” IEEE Trans. Software Eng., vol. 25, no. 5, pp. 651-660, Sept. 1999.
Index Terms:
Formal methods, formal verification, time-triggered algorithms, synchronous systems, PVS.
Citation:
Lee Pike, "A Note on Inconsistent Axioms in Rushby's "Systematic Formal Verification for Fault-Tolerant Time-Triggered Algorithms'," IEEE Transactions on Software Engineering, vol. 32, no. 5, pp. 347-348, May 2006, doi:10.1109/TSE.2006.41 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||