Abstract
The formal verification of concurrent systems is usually seen as an example par excellence of the application of mathematical methods to computer science. Although the practical application of such verification methods will always be limited by the underlying forms of combinatorial explosion, recent years have shown remarkable progress in computer aided formal verification. They are making formal verification a practical proposition for a growing class of real-life applications, and have put formal methods on the agenda of industry, in particular in the areas where correctness is critical in one sense or another. Paradoxically, the results of this progress provide evidence that successful applications of formal verification have significant elements that do not fit the paradigm of pure mathematical reasoning. In this essay we argue that verification is part of an experimental paradigm in at least two senses. We submit that this observation has consequences for the ways in which we should research and apply formal methods.
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 subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Computing surveys symposium on computational complexity and the nature of computer science. ACM Computing Surveys, 27(1):5–61, 1995.
E. Brinksma. What is the method in formal methods? In Formal description Techniques, IV, IFIP Transactions C-2, pages 33–50. North-Holland, 1992.
J. Hartmanis. Turing award lecture: On computational complexity and the nature of computer science. ACM Computing Survays, 27(1):7–16, 1995.
P. Lukowicz, E. A. Heinz, L. Prechelt, and W. F. Tichy. Experimental evaluation in computer science: A quantitative study. Journal of Systems and Software, 28(1):9–18, January 1995.
Robin Milner. Is computing an experimental science. Technical Report ECS-LFCS-86-1, Laboratory for the Foundations of Computer Science, University of Edinburgh, 1986.
H. A. Simon. Sciences of the Artificial. MIT Press, 1981.
W. Turski. Essay on software engineering at the turn of the century. In Fundamental Approaches to Software Engineering, volume 1783 of Lecture Notes in Computer Science, pages 1–20. Springer-Verlag, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brinksma, E. (2000). Verification Is Experimentation!. In: Palamidessi, C. (eds) CONCUR 2000 — Concurrency Theory. CONCUR 2000. Lecture Notes in Computer Science, vol 1877. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44618-4_2
Download citation
DOI: https://doi.org/10.1007/3-540-44618-4_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67897-7
Online ISBN: 978-3-540-44618-7
eBook Packages: Springer Book Archive