A General Testability Theory: Classes, Properties, Complexity, and Testing Reductions

@article{Rodrguez2014AGT,
  title={A General Testability Theory: Classes, Properties, Complexity, and Testing Reductions},
  author={I. Rodr{\'i}guez and Luis Llana and Pablo Rabanal},
  journal={IEEE Transactions on Software Engineering},
  year={2014},
  volume={40},
  pages={862-894}
}
In this paper we develop a general framework to reason about testing. The difficulty of testing is assessed in terms of the amount of tests that must be applied to determine whether the system is correct or not. Based on this criterion, five testability classes are presented and related. We also explore conditions that enable and disable finite testability, and their relation to testing hypotheses is studied. We measure how far incomplete test suites are from being complete, which allows us to… Expand
Introducing complexity to formal testing
How to Reduce the Cost of Passive Testing
  • César Andrés, A. Cavalli
  • Computer Science
  • 2012 IEEE 14th International Symposium on High-Assurance Systems Engineering
  • 2012
System Test Architecture Evaluation: A Probabilistic Modeling Approach
A survey on software testability
A formal framework to test soft and hard deadlines in timed systems
Implementation issues in optimization algorithms: do they matter?
Identifying characteristics of Java methods that may influence branch coverage: An exploratory study on open source projects
...
1
2
3
...

References

SHOWING 1-10 OF 36 REFERENCES
A General Testability Theory
A methodology of testing high-level Petri nets
Weak Mutation Testing and Completeness of Test Sets
  • W. Howden
  • Computer Science
  • IEEE Transactions on Software Engineering
  • 1982
...
1
2
3
4
...