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.
|Title of host publication||CONCUR 2000 - concurrency theory : proceedings 11th international conference, University Park PA, USA, august 22-25, 2000|
|Publication status||Published - 2000|
|Name||Lecture Notes in Computer Science|
Brinksma, E. (2000). Verification is experimentation! In C. Palamidessi (Ed.), CONCUR 2000 - concurrency theory : proceedings 11th international conference, University Park PA, USA, august 22-25, 2000 (pp. 17-24). (Lecture Notes in Computer Science; Vol. 1877). Springer. https://doi.org/10.1007/3-540-44618-4_2