Constraint-Based Approaches to the Covering Test Problem
- 1 January 2005
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 172-186
- https://doi.org/10.1007/11402763_13
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Problems and algorithms for covering arraysDiscrete Mathematics, 2004
- Negative Effects of Modeling Techniques on Search PerformanceAnnals of Operations Research, 2003
- Generating small combinatorial test suites to cover input-output relationshipsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Global Constraints for Lexicographic OrderingsLecture Notes in Computer Science, 2002
- Breaking Row and Column Symmetries in Matrix ModelsLecture Notes in Computer Science, 2002
- 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
- Vector sets for exhaustive testing of logic circuitsIEEE Transactions on Information Theory, 1988
- Iterative Exhaustive Pattern Generation for Logic TestingIBM Journal of Research and Development, 1984
- Exhaustive Test Pattern Generation with Constant Weight VectorsIEEE Transactions on Computers, 1983