Feasible test path selection by principal slicing
ESEC '97/FSE-5 Proceedings of the 6th European SOFTWARE ENGINEERING conference held jointly with the 5th ACM SIGSOFT international symposium on Foundations of software engineering
Prose + Test Cases = Specifications
TOOLS '00 Proceedings of the Technology of Object-Oriented Languages and Systems (TOOLS 34'00)
A Domain Coverage Metric for the Validation of Behavioral VHDL Descriptions
ITC '00 Proceedings of the 2000 IEEE International Test Conference
Automatic Test Generation using Checkpoint Encoding and Antirandom Testing
ISSRE '97 Proceedings of the Eighth International Symposium on Software Reliability Engineering
Adaptive Random Testing Through Dynamic Partitioning
QSIC '04 Proceedings of the Quality Software, Fourth International Conference
Domain Strategy and Coverage Metric for Validation
ISQED '05 Proceedings of the 6th International Symposium on Quality of Electronic Design
Identification of Categories and Choices in Activity Diagrams
QSIC '05 Proceedings of the Fifth International Conference on Quality Software
Constraint based structural testing criteria
Journal of Systems and Software
Adaptive random testing by balancing
Proceedings of the 2nd international workshop on Random testing: co-located with the 22nd IEEE/ACM International Conference on Automated Software Engineering (ASE 2007)
Towards the determination of typical failure patterns
Fourth international workshop on Software quality assurance: in conjunction with the 6th ESEC/FSE joint meeting
An upper bound on software testing effectiveness
ACM Transactions on Software Engineering and Methodology (TOSEM)
Distributing test cases more evenly in adaptive random testing
Journal of Systems and Software
Using formal specifications to support testing
ACM Computing Surveys (CSUR)
A tool-based approach for software testing and validation
AFIPS '84 Proceedings of the July 9-12, 1984, national computer conference and exposition
Enhanced lattice-based adaptive random testing
Proceedings of the 2009 ACM symposium on Applied Computing
Adaptive random testing based on distribution metrics
Journal of Systems and Software
Adaptive Random Testing: The ART of test case diversity
Journal of Systems and Software
Sleuth: a domain based testing tool
ITC'94 Proceedings of the 1994 international conference on Test
Adaptive random testing: an illusion of effectiveness?
Proceedings of the 2011 International Symposium on Software Testing and Analysis
Generating test cases for web services using extended finite state machine
TestCom'06 Proceedings of the 18th IFIP TC6/WG6.1 international conference on Testing of Communicating Systems
ASIAN'04 Proceedings of the 9th Asian Computing Science conference on Advances in Computer Science: dedicated to Jean-Louis Lassez on the Occasion of His 5th Cycle Birthday
Automatic conformance testing of web services
FASE'05 Proceedings of the 8th international conference, held as part of the joint European Conference on Theory and Practice of Software conference on Fundamental Approaches to Software Engineering
On the improvement of a fault classification scheme with implications for white-box testing
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Software—Practice & Experience
Augmented dynamic symbolic execution
Proceedings of the 27th IEEE/ACM International Conference on Automated Software Engineering
An orchestrated survey of methodologies for automated software test case generation
Journal of Systems and Software
Hi-index | 0.01 |
This paper presents a testing strategy desiged to detect errors in the control flow of a computer program, and the conditions under which this strategy is reliable are given and characterized. The control flow statements in a computer progam partition the input space into a set of mutually exclusive domains, each of which corresponds to a particular program path and consists of input data points which cause that path to be executed. The testing strategy generates test points to examine the boundaries of a domain to detect whether a domain error has occurred, as either one or more of these boundaries will have shifted or else the corresponding predicate relational operator has changed. If test points can be chosen within e of each boundary, under the appropriate assumptions, the strategy is shown to be reliable in detecting domain errons of magnitude greater than ?. Moreover, the number of test points required to test each domain grows only linearly with both the dimensionality of the input space and the number of predicates along the path being tested.