Benchmarking finite-state verifiers (original) (raw)
Abstract.
A variety of largely automated methods have been proposed for finite-state verification of computer systems. Although anecdotal accounts of success are widely reported, there is very little empirical data on the relative strengths and weaknesses of those methods across a broad range of analysis questions and systems. This information, however, is critical for the transfer of the technology from research to practice. We review some of the problems involved in obtaining this information and suggest several ways in which the community can facilitate empirical evaluation of finite-state verification tools.
Access this article
Subscribe and save
- Starting from 10 chapters or articles per month
- Access and download chapters and articles from more than 300k books and 2,500 journals
- Cancel anytime View plans
Buy Now
Price excludes VAT (USA)
Tax calculation will be finalised during checkout.
Instant access to the full article PDF.
Similar content being viewed by others
Author information
Authors and Affiliations
- Department of Mathematics and Statistics, University of Massachusetts, Amherst, MA 01003-4515, USA; E-mail: avrunin@math.umass.edu, , , , , , US
George S. Avrunin - Department of Information and Computer Science, University of Hawaii, Honolulu, HI 96822, USA; E-mail: corbett@hawaii.edu, , , , , , US
James C. Corbett - Department of Computing and Information Sciences, Kansas State University, Manhattan, KS 66506-2302, USA; E-mail: dwyer@cis.ksu.edu, , , , , , US
Matthew B. Dwyer
Authors
- George S. Avrunin
- James C. Corbett
- Matthew B. Dwyer
Rights and permissions
About this article
Cite this article
Avrunin, G., Corbett, J. & Dwyer, M. Benchmarking finite-state verifiers.STTT 2, 317–320 (2000). https://doi.org/10.1007/s100090050038
- Issue date: March 2000
- DOI: https://doi.org/10.1007/s100090050038