Verification Is Experimentation!

Research output: Contribution to conferencePaperAcademicpeer-review

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.
Original languageUndefined
Pages17-24
Number of pages8
Publication statusPublished - 2000
Event11th International Conference on Concurrency Theory, CONCUR 2000 - University Park, State College, United States
Duration: 22 Aug 200025 Aug 2000
Conference number: 11

Workshop

Workshop11th International Conference on Concurrency Theory, CONCUR 2000
Abbreviated titleCONCUR
CountryUnited States
CityState College
Period22/08/0025/08/00

Keywords

  • IR-63276
  • EWI-6441

Cite this

Brinksma, H. (2000). Verification Is Experimentation!. 17-24. Paper presented at 11th International Conference on Concurrency Theory, CONCUR 2000, State College, United States.
Brinksma, Hendrik. / Verification Is Experimentation!. Paper presented at 11th International Conference on Concurrency Theory, CONCUR 2000, State College, United States.8 p.
@conference{f189466e624c46b7901500ea5169e166,
title = "Verification Is Experimentation!",
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.",
keywords = "IR-63276, EWI-6441",
author = "Hendrik Brinksma",
year = "2000",
language = "Undefined",
pages = "17--24",
note = "null ; Conference date: 22-08-2000 Through 25-08-2000",

}

Brinksma, H 2000, 'Verification Is Experimentation!' Paper presented at 11th International Conference on Concurrency Theory, CONCUR 2000, State College, United States, 22/08/00 - 25/08/00, pp. 17-24.

Verification Is Experimentation! / Brinksma, Hendrik.

2000. 17-24 Paper presented at 11th International Conference on Concurrency Theory, CONCUR 2000, State College, United States.

Research output: Contribution to conferencePaperAcademicpeer-review

TY - CONF

T1 - Verification Is Experimentation!

AU - Brinksma, Hendrik

PY - 2000

Y1 - 2000

N2 - 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.

AB - 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.

KW - IR-63276

KW - EWI-6441

M3 - Paper

SP - 17

EP - 24

ER -

Brinksma H. Verification Is Experimentation!. 2000. Paper presented at 11th International Conference on Concurrency Theory, CONCUR 2000, State College, United States.