Abstract
A formal method is a mathematically-based technique used to describe properties of hardware and software systems. It provides a framework within which large, complex systems may be specified, designed, analyzed, and verified in a systematic rather than ad hoc manner. A method is formal if it has a sound mathematical basis, typically given by a formal specification language
In my talk I will review the seeds and early development of formal methods. Citing notable case studies, I will survey the state of the art in the areas in which researchers and engineers most recently have made the greatest strides: software specification, model checking, and theorem proving. To close, I will suggest future research directions that should result in the most promising payoffs for practitioners
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
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wing, J.M. (1998). Formal Methods: Past, Present, and Future. In: Hsiang, J., Ohori, A. (eds) Advances in Computing Science ASIAN 98. ASIAN 1998. Lecture Notes in Computer Science, vol 1538. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49366-2_17
Download citation
DOI: https://doi.org/10.1007/3-540-49366-2_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65388-2
Online ISBN: 978-3-540-49366-2
eBook Packages: Springer Book Archive