automated black-box testing of functional correctness using function approximation
2004 (English)In: ISSTA 2004 - Proceedings of the ACM SIGSOFT International Symposium on Software Testing and Analysis, 2004, 143-153 p.Conference paper (Refereed)
We consider black-box testing of functional correctness as a special case of a satisfiability or constraint solving problem. We introduce a general method for solving this problem based on function approximation. We then describe some practical results obtained for an automated testing algorithm using approximation by piecewise polynomial functions.
Place, publisher, year, edition, pages
2004. 143-153 p.
Approximation, Black-box test, Constraint solving, Formal specification, Functional test, Satisfiability problem, Test coverage
Computer and Information Science
IdentifiersURN: urn:nbn:se:kth:diva-62878DOI: 10.1145/1007512.1007532ScopusID: 2-s2.0-23744513315ISBN: 1581138202OAI: oai:DiVA.org:kth-62878DiVA: diva2:481282
ACM SIGSOFT International Symposium on Software Testing and Analysis, ISSTA 2004; Boston, MA; 11 July 2004 through 14 July 2004
QC 201201242012-01-202012-01-202012-01-24Bibliographically approved