Abstract
In this talk, a short history of NASA Langley’s research in formal methods is presented. The talk begins with an examination of the attempted formal verification of the SIFT (Software Implemented Fault Tolerance) operating system in the late 1970s. The primary goal of the SIFT verification project was to verify an operating system for a fault-tolerant, distributed, real-time, avionics computing platform. The SIFT project was deemed a failure because it did not meet its primary objective. However, important results in the field of computer science were obtained from the SIFT project including fault tolerant clock synchronization, Byzantine agreement (interactive consistency), and others.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAuthor information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Butler, R. (2002). Formal Methods at NASA Langley. In: Carreño, V.A., Muñoz, C.A., Tahar, S. (eds) Theorem Proving in Higher Order Logics. TPHOLs 2002. Lecture Notes in Computer Science, vol 2410. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45685-6_1
Download citation
DOI: https://doi.org/10.1007/3-540-45685-6_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44039-0
Online ISBN: 978-3-540-45685-8
eBook Packages: Springer Book Archive