Introduction to discrete mathematics for software engineering
Introduction to discrete mathematics for software engineering
Theoretical comparison of testing methods
TAV3 Proceedings of the ACM SIGSOFT '89 third symposium on Software testing, analysis, and verification
Black-box testing: techniques for functional testing of software and systems
Black-box testing: techniques for functional testing of software and systems
Towards a formal semantics of Parnas tables
Proceedings of the 17th international conference on Software engineering
A normal form for function rings of piecewise functions
Journal of Symbolic Computation
On a formal semantics of tabular expressions
Science of Computer Programming
Z: An Introduction to Formal Methods
Z: An Introduction to Formal Methods
Predicate Logic for Software Engineering
IEEE Transactions on Software Engineering
Programming and Computing Software
Document based rational software development
Knowledge-Based Systems
An experimental assessment of module documentation-based testing
Information and Software Technology
The use of mathematics in software quality assurance
Frontiers of Computer Science in China
Hi-index | 0.00 |
We consider the problem of generating a set of test cases from a black box specification. We focus on stress testing, i.e. picking test cases that seem most likely to reveal program bugs. Our approach assumes that so-called interesting points, i.e. points in a function's domain where properties change, e.g. maxima, are likely to reveal any problems and examine how we can determine the interesting points for a function defined by a complex expression if we know the interesting points for the functions named in that expression.