Activities per year
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 reallife 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.
Original language  English 

Title of host publication  CONCUR 2000 — Concurrency Theory 
Subtitle of host publication  11th International Conference University Park, PA, USA, August 22–25, 2000, Proceedings 
Editors  Catuscia Palamidessi 
Publisher  Springer 
Pages  1724 
Number of pages  8 
ISBN (Electronic)  9783540446187 
ISBN (Print)  9783540678977 
DOIs  
Publication status  Published  2000 
Event  11th International Conference on Concurrency Theory, CONCUR 2000  University Park, State College, United States Duration: 22 Aug 2000 → 25 Aug 2000 Conference number: 11 
Publication series
Name  Lecture Notes in Computer Science 

Publisher  Springer 
Volume  1877 
ISSN (Print)  03029743 
Workshop
Workshop  11th International Conference on Concurrency Theory, CONCUR 2000 

Abbreviated title  CONCUR 
Country/Territory  United States 
City  State College 
Period  22/08/00 → 25/08/00 
Keywords
 Formal methods
 Mathematical object
 Formal verification
 Combinatorial explosion
 Brute force approach
Fingerprint
Dive into the research topics of 'Verification Is Experimentation!'. Together they form a unique fingerprint.Activities
 1 Oral presentation

Verification is Experimentation!
Hendrik Brinksma (Invited speaker)
23 Aug 2000Activity: Talk or presentation › Oral presentation
Research output
 1 Citations
 1 Article

Verification is experimentation!
Brinksma, E., 2001, In: International journal on software tools for technology transfer. 3, 2, p. 107217 111 p.Research output: Contribution to journal › Article › Academic › peerreview
7 Citations (Scopus)9 Downloads (Pure)