Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Comparing FiniteState Verification Techniques for Concurrent Software
 

Summary: Comparing Finite­State Verification Techniques
for Concurrent Software
George S. Avrunin  James C. Corbett + Matthew B. Dwyer #
Corina S. P–as–areanu # Stephen F. Siegel 
November 15, 1999
Abstract
Finite­state verification provides software developers with a powerful tool to
detect errors. Many different analysis techniques have been proposed and imple­
mented, and the limited amount of empirical data available shows that the per­
formance of these techniques varies enormously from system to system. Before
this technology can be transferred from research to practice, the community must
provide guidance to developers on which methods are best for different kinds of
systems. We describe a substantial case study in which several finite­state verifi­
cation tools were applied to verify properties of the Chiron user interface system,
a real Ada program of substantial size. Our study provides important data com­
paring these different analysis methods, and points out a number of difficulties in
conducting fair comparisons of finite­state verification tools.
1 INTRODUCTION
Automated or partially­automated techniques for checking the correctness of concur­
rent programs range from formal verification that the program satisfies a complete spec­

  

Source: Avrunin, George S. - Department of Mathematics and Statistics, University of Massachusetts at Amherst
Massachusetts at Amherst, University of - Architecture and Language Implementation
Pasareanu, Corina - Robust Software Engineering Group, Carnegie Mellon University Silicon Valley

 

Collections: Computer Technologies and Information Sciences; Mathematics