PROW: A Pairwise algorithm with constRaints, Order and Weight
Authors:
- Beatriz Pérez LamanchaBLBeatriz Pérez Lamancha
- Macario PoloMPMacario Polo
- Mario PiattiniMario Piattini
- 1 January 2015
- journal article
- Published by Elsevier in Journal of Systems and Software
- Vol. 99, 1-19
Abstract
No abstract availableKeywords
Funding Information
- Spanish Ministry of Economy and Competitiveness
- European Fund for Regional Development (TIN2012-37493-C03-01)
This publication has 15 references indexed in Scilit:
- A density‐based greedy algorithm for higher strength covering arraysSoftware Testing, Verification and Reliability, 2008
- A Logic-Based Approach to Combinatorial Testing with Constraints2008
- The density algorithm for pairwise interaction testingSoftware Testing, Verification and Reliability, 2007
- Prioritized interaction testing for pair-wise coverage with seeding and constraintsInformation and Software Technology, 2006
- On the effectiveness of the test-first approach to programmingIEEE Transactions on Software Engineering, 2005
- Combination testing strategies: a surveySoftware Testing, Verification and Reliability, 2005
- Test case prioritization: a family of empirical studiesIEEE Transactions on Software Engineering, 2002
- State generation and automated class testingSoftware Testing, Verification and Reliability, 2000
- The AETG system: an approach to testing based on combinatorial designIEEE Transactions on Software Engineering, 1997
- The combinatorial design approach to automatic test generationIEEE Software, 1996