| Improving the precision of INCA by preventing spurious cycles |
| Full text |
Pdf
(542 KB)
|
| Source
|
International Symposium on Software Testing and Analysis
archive
Proceedings of the 2000 ACM SIGSOFT international symposium on Software testing and analysis
table of contents
Portland, Oregon, United States
Pages: 191 - 200
Year of Publication: 2000
ISBN:1-58113-266-2
Also published in ...
|
|
Authors
|
|
Stephen F. Siegel
|
Dept. of Computer Science, Univ. of Massachusetts, Amherst, MA
|
|
George S. Avrunin
|
Dept. of Mathematics and Statistics, Univ. of Massachusetts, Amherst, MA
|
|
| Sponsor |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 2, Downloads (12 Months): 8, Citation Count: 0
|
|
|
ABSTRACT
The Inequality Necessary Condition Analyzer (INCA) is a finite-state verification tool that has been able to check properties of some very large concurrent systems. INCA checks a property of a concurrent system by generating a system of inequalities that must have integer solutions if the property can be violated. There may, however, be integer solutions to the inequalities that do not correspond to an execution violating the property. INCA thus accepts the possibility of an inconclusive result in exchange for greater tractability. We describe here a method for eliminating one of the two main sources of these inconclusive results.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
| |
2
|
|
| |
3
|
A. T. Chamillard, L. A. Clarke, and G. S. Avrunin. An empirical comparison of static concurrency analysis techniques. Technical Report 96-84, Department of Computer Science, University of Massachusetts, 1996. Revised May 1997.
|
 |
4
|
|
| |
5
|
|
 |
6
|
|
 |
7
|
|
| |
8
|
|
| |
9
|
K. Forester, C. MacFarlane, M. Cameron, and G. Bolcer. Chiron-1 user manual. Arcadia Document UCI-93-07, University of California, Irvine, Sept. 1993.
|
|