ACM Home Page
Please provide us with feedback. Feedback
A formal analysis of requirements-based testing
Full text PdfPdf (488 KB)
Source
International Symposium on Software Testing and Analysis archive
Proceedings of the eighteenth international symposium on Software testing and analysis table of contents
Chicago, IL, USA
SESSION: Testing #1 table of contents
Pages 47-56  
Year of Publication: 2009
ISBN:978-1-60558-338-9
Authors
Charles Pecheur  Université catholique de Louvain, Louvain la Neuve, Belgium
Franco Raimondi  University College London, London, United Kingdom
Guillaume Brat  RIACS - NASA Ames, Mountain View, CA, USA
Sponsors
SIGSOFT: ACM Special Interest Group on Software Engineering
SIGPLAN: ACM Special Interest Group on Programming Languages
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 28,   Downloads (12 Months): 66,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1572272.1572279
What is a DOI?

ABSTRACT

The aim of requirements-based testing is to generate test cases from a set of requirements for a given system or piece of software. In this paper we propose a formal semantics for the generation of test cases from requirements by revising and extending the results presented in previous works (e.g.: [21, 20, 13]). We give a syntactic characterisation of our method, defined inductively over the syntax of LTL formulae, and prove that this characterisation is sound and complete, given some restrictions on the formulae that can be used to encode requirements. We provide various examples to show the applicability of our approach.


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
R. Armoni, L. Fix, A. Flaisher, O. Grumberg, N. Piterman, A. Tiemeyer, and M. Y. Vardi. Enhanced vacuity detection in linear temporal logic. In CAV 2003, Boulder, CO, USA, volume 2725 of Lecture Notes in Computer Science, pages 368--380. Springer, 2003.
 
2
G. Brat, C. Pecheur, and F. Raimondi. A formal analysis of requirements-based testing and its applications to the verification of spin, nusmv, and pddl domains. Technical report, NASA, March 2009.
 
3
J. J. Chilenski. An investigation of three forms of the modified condition decision coverage (MCDC) criterion. Technical report DOT/FAA/AR-01/18DOT/FAA/AR-01/18, Federal Aviation Administration, 2001.
 
4
J. J. Chilenski and S. P. Miller. Applicability of modified condition/decision coverage to software testing. Software Engineering Journal, pages 193--200, 1994.
 
5
 
6
 
7
8
 
9
C. Eisner et al. Reasoning with temporal logic on truncated paths. In Proceedings of CAV '03, volume 2725 of Lecture Notes in Computer Science. Springer Verlag, 2003.
 
10
A. Gerevini and D. Long. Plan constraints and preferences in pddl3: The language of the fifth international planning competition. Technical report, Dept. of Electronics and Automation, University of Brescia, August 2005.
 
11
 
12
 
13
 
14
 
15
J. Penix, C. Pecheur, and K. Havelund. Using model checking to validate AI planner domain models. In Proceedings of the 23rd Annual Software Engineering Workshop, NASA Goddard, 1998.
 
16
 
17
RTCA. Software Considerations in Airborne Systems and Equipment Certification, 1992.
 
18
S. W. Squyres et al. The Opportunity Rover's Athena Science Investigation at Meridiani Planum, Mars. Science, 306:1698--1703, 2004.
 
19
S. W. Squyres et al. The Spirit Rover's Athena Science Investigation at Gusev Crater, Mars. Science, 305:794--799, 2004.
 
20
L. Tan, O. Sokolsky, and I. Lee. Specification-based testing with linear temporal logic. In Proceedings of the IEEE International Conference on Information Reuse and Integration (IRI04). IEEE Society, 2004.
21

Collaborative Colleagues:
Charles Pecheur: colleagues
Franco Raimondi: colleagues
Guillaume Brat: colleagues