| Daistish: systematic algebraic testing for OO programs in the presence of side-effects |
| Full text |
Pdf
(607 KB)
|
| Source
|
International Symposium on Software Testing and Analysis
archive
Proceedings of the 1996 ACM SIGSOFT international symposium on Software testing and analysis
table of contents
San Diego, California, United States
Pages: 53 - 61
Year of Publication: 1996
ISBN:0-89791-787-1
Also published in ...
|
|
Authors
|
|
Merlin Hughes
|
Department of Computer Science, University of North Carolina, Chapel Hill, NC
|
|
David Stotts
|
Department of Computer Science, University of North Carolina, Chapel Hill, NC
|
|
| Sponsor |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 2, Downloads (12 Months): 20, Citation Count: 5
|
|
|
ABSTRACT
Daistish is a tool that performs systematic algebraic testing similar to Gannon's DAISTS tool [2]. However, Daistish creates effective test drivers for programs in languages that use side effects to implement ADTs; this includes C++ and most other object-oriented languages. The functional approach of DAISTS does not apply directly in these cases. The approach in our work is most similar to the ASTOOT system of Doong and Frankl [1]; Daistish differs from ASTOOT by using Guttag-style algebraic specs (functional notation), by allowing aliasing of type names to tailor the application of parameters in test cases, and by retaining the abilities of DAISTS to compose new test points from existing ones. Daistish is a Perl script, and is compact and practical to apply. We describe the implementation and our experiments in both Eiffel and C++. Our work has concentrated on solving the semantics-specific issues of correctly duplicating objects for comparison; we have not worked on methods for selecting specific test cases.Daistish consists of a perl script and supporting documentation. The current distribution can be obtained via WWW at URLhttp://www.cs.unc.edu/~stotts/Daistish/
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
|
John Gannon , Paul McMullin , Richard Hamlet, Data Abstraction, Implementation, Specification, and Testing, ACM Transactions on Programming Languages and Systems (TOPLAS), v.3 n.3, p.211-223, July 1981
[doi> 10.1145/357139.357140]
|
| |
3
|
GVTTAG, J. Notes on type abstraction (version 2). IEEE Transactions on Software Engineering TR-SE 6, i (Jan. 1980), 13-23.
|
| |
4
|
GUTT^C, J. V., AND HORNINC, J. J. The algebraic specification of abstract data types. Acta Informatica 10 (1978), 27-52.
|
| |
5
|
GUTTAG, J. V., HORNING, J. J., AND WING, J. M. The Larch family of specification languages. IEEE Software 2, 5 (September 1985), 24-36.
|
 |
6
|
|
| |
7
|
|
| |
8
|
|
| |
9
|
PARNAS, D. L., AND WANG, Y. The trace assertion method of module interface specification. Technical Report 89-261, Queen's University, Kingston, Ontario, Oct. 1989.
|
 |
10
|
|
 |
11
|
|
| |
12
|
|
CITED BY 5
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Robert M. Hierons , Kirill Bogdanov , Jonathan P. Bowen , Rance Cleaveland , John Derrick , Jeremy Dick , Marian Gheorghe , Mark Harman , Kalpesh Kapoor , Paul Krause , Gerald Lüttgen , Anthony J. H. Simons , Sergiy Vilkomir , Martin R. Woodward , Hussein Zedan, Using formal specifications to support testing, ACM Computing Surveys (CSUR), v.41 n.2, p.1-76, February 2009
|
|