ACM Home Page
Please provide us with feedback. Feedback
An analysis of rule coverage as a criterion in generating minimal test suites for grammar-based software
Full text PdfPdf (192 KB)
Source Automated Software Engineering archive
Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering table of contents
Long Beach, CA, USA
SESSION: Testing I table of contents
Pages: 104 - 113  
Year of Publication: 2005
ISBN:1-59593-993-4
Authors
Mark Hennessy  National University of Ireland, Maynooth, Co. Kildare, Ireland
James F. Power  National University of Ireland, Maynooth, Co. Kildare, Ireland
Sponsors
ACM: Association for Computing Machinery
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGSOFT: ACM Special Interest Group on Software Engineering
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 13,   Downloads (12 Months): 75,   Citation Count: 2
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1101908.1101926
What is a DOI?

ABSTRACT

The term grammar-based software describes software whose input can be specified by a context-free grammar. This grammar may occur explicitly in the software, in the form of an input specification to a parser generator, or implicitly, in the form of a hand-written parser, or other input-verification routines. Grammar-based software includes not only programming language compilers, but also tools for program analysis, reverse engineering, software metrics and documentation generation. Such tools often play a crucial role in automated software development, and ensuring their completeness and correctness is a vital prerequisite for their us.In this paper we propose a strategy for the construction of test suites for grammar based software, and illustrate this strategy using the ISO CPP grammar. We use the concept of rule coverage as a pivot for the reduction of implementation-based and specification-based test suites, and demonstrate a significant decrease in the size of these suites. To demonstrate the validity of the approach, we use the reduced test suite to analyze three grammar-based tools for CPP++. We compare the effectiveness of the reduced test suite with the original suite in terms of code coverage and fault detection.


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
D. Acostachioaie. Doc++: Open source - open science - open systems. Circles Electronic Magazine, (36), 2000.
 
2
F. Bazzichi and I. Spadafora. An automatic generator for compiler testing. IEEE Trans. Softw. Eng., 8(4):343--353, 1982.
 
3
A. Celentano, S. Crespi-Reghizzi, P. D. Vigna, C. Ghezzi, G. Granata, and F. Savoretti. Compiler testing using a sentence generator. Software: Practice and Experience, 10(11):897--918, November 1980.
 
4
 
5
 
6
T. H. Gibbs, B. A. Malloy, and J. F. Power. Progression toward conformance of C++ language compilers. Dr. Dobbs Journal, 28(11):54--60, September 2003.
 
7
J. Harm and R. Lämmel. Two-dimensional Approximation Coverage. Informatica, 24(3), 2000.
8
 
9
 
10
M. Hennessy and J. F. Power. Generation strategies for test-suites of grammar-based software. Technical Report NUIM-CS-TR-2005-02, Department of Computer Science, National Univesity of Ireland, Maynooth, April 13 2005.
 
11
 
12
ISO/IEC JTC 1. International Standard: Programming Languages - C++. Number 14882:2003(E). American National Standards Institute, second edition, October 15 2003.
 
13
14
 
15
 
16
 
17
 
18
B. A. Malloy and J. F. Power. An interpretation of P urdom's algorithm for automatic generation of test cases. In 1st Annual International Conference on Computer and Information Science, Orlando, FL., 2001.
 
19
20
 
21
 
22
 
23
P. Purdom. A sentance generator for testing parsers. BIT, 12(3):366--375, 1972.
 
24
 
25
 
26
 
27
 
28
 
29


Collaborative Colleagues:
Mark Hennessy: colleagues
James F. Power: colleagues