Structural testing based on minimum kernels
2005 (English)In: Proceedings -Design, Automation and Test in Europe, DATE '05 / [ed] Wehn, N; Benini, L, IEEE Computer Society, 2005, 1168-1173 p.Conference paper (Refereed)
Structural testing techniques, such as statement and branch coverage, play an important role in improving dependability of software systems. However, finding a set of tests which guarantees high coverage is a time-consuming task. In this paper we present a technique for structural testing based on kernel computation. A kernel satisfies the property that any set of tests which executes all vertices (edges) of the kernel executes all vertices (edges) of the program's flowgraph. We present a linear-time algorithm for computing minimum kernels based on pre- and post-dominator relations of a flowgraph.
Place, publisher, year, edition, pages
IEEE Computer Society, 2005. 1168-1173 p.
, Design, Automation, and Test in Europe Conference and Exhibition. Proceedings, ISSN 1530-1591 ; 2
Algorithms, Computation theory, Computer systems
Computer and Information Science
IdentifiersURN: urn:nbn:se:kth:diva-42779DOI: 10.1109/DATE.2005.284ISI: 000228086900230ScopusID: 2-s2.0-33646942157ISBN: 0-7695-2288-2ISBN: 978-076952288-3OAI: oai:DiVA.org:kth-42779DiVA: diva2:447744
Design, Automation and Test in Europe Conference and Exhibition (DATE 05) Location: Munich, Germany Date: Mar 07-11, 2005
QC 201110132011-10-132011-10-122012-09-26Bibliographically approved