• Home
  • Search
  • Comparing partition and random testing via majorization and schur functions
  • Cite Icon47
  • https://doi.org/10.1109/tse.2003.1166591Copy DOI Icon

Comparing partition and random testing via majorization and schur functions

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

The comparison of partition and random sampling methods for software testing has received considerable attention in the literature. A standard criterion for comparisons between random and partition testing based on their expected efficacy in program debugging is the probability of detecting at least one failure causing input in the program's domain. We investigate the relative effectiveness of partition testing versus random testing through the powerful mathematical technique of majorization, which was introduced by Hardy et al. (1952). The tools of majorization and the concepts of Schur (convex and concave) functions (1923) enable us to derive general conditions under which partition testing is superior to random testing and, consequently, to give further insights into the value of partition testing strategies.

Similar Papers
  • Conference Article
  • Citations11

On some reliability estimation problems in random and partition testing

  • May 17, 1991
  • M.Z Tsoukalas +2
  • Research Article
  • Citations140

On the relationship between partition and random testing

  • Jan 01, 1994
  • IEEE Transactions on Software Engineering
  • T.Y Chen +1
  • Conference Article
  • Citations95

Partition testing does not inspire confidence

  • Jul 19, 1988
  • D Hamlet +1
  • PDF
  • Research Article
  • Citations17

ARTDL: Adaptive Random Testing for Deep Learning Systems

  • Jan 01, 2020
  • IEEE Access
  • Min Yan +2
  • Conference Article

Software Testing Comparison and Selection Strategy

  • Sep 01, 2013
  • Xiao-Yun Zheng +2
  • Conference Article
  • Citations3

Applying Feedback Information for Random Partition Testing

  • Jun 01, 2018
  • Arnaldo Marulitua Sinaga
  • Research Article
  • Citations98

General test result checking with log file analysis

  • Jul 01, 2003
  • IEEE Transactions on Software Engineering
  • J.H Andrews +1
  • Conference Article

Specifying constraints with message sequence specifications

  • Dec 07, 1999
  • Yongzhong Tu +2
  • Conference Article
  • Citations10

Combinatorial and MC/DC Coverage Levels of Random Testing

  • Jul 01, 2017
  • Sergiy Vilkomir +3
  • Conference Article
  • Citations9

Probabilistic Adaptive Random Testing

  • Oct 01, 2006
  • Proceedings of the ... International Conference on Quality Software/Proceedings
  • Kwok Chan +2
  • Conference Article
  • Citations8

Adaptive random testing by static partitioning

  • May 16, 2015
  • Korosh Koochekian Sabor +1
  • Conference Article
  • Citations59

On the statistical properties of the F-measure

  • Sep 08, 2004
  • Swinburne Research Bank (Swinburne University of Technology)
  • Tsong Yueh Chen +2
  • Research Article
  • Citations17

Systematic scenario test case generation for nuclear safety systems

  • Sep 12, 2012
  • Information and Software Technology
  • Wan-Hui Tseng +1
  • Conference Article
  • Citations23

Lightweight Automated Testing with Adaptation-Based Programming

  • Nov 01, 2012
  • Alex Groce +6
  • Dissertation
  • Citations5

Studies of different variations of Adaptive Random Testing

  • Jan 01, 2006
  • David Peter Towey
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.