NDLI: Formal analysis of the effectiveness and predictability of random testing

Please wait, while we are loading the content...

Proving memory safety of floating-point computations by combining static and dynamic program analysis

Directed test generation for effective fault localization

Generating test cases for specification mining

Automatic detection of unsafe component loadings

Automated analysis of load testing results

Mutation-driven generation of unit tests and oracles

Parallel symbolic execution for structural test generation

Formal analysis of the effectiveness and predictability of random testing

Analyzing concurrency bugs using dual slicing

Software fault prediction tool

Strict control dependence and its effect on dynamic information flow analyses

Automated fixing of programs with contracts

Modeling consumer-perceived web application fault severities for testing

Learning from 6,000 projects: lightweight cross-project anomaly detection

OCAT: object capture-based automated testing

Exploiting program dependencies for scalable multiple-path symbolic execution

A study on agility and testing processes in software organizations

N-version disassembly: differential testing of x86 disassemblers

ASSURE: automated support for secure and usable requirements engineering

Analysis of invariants for efficient bounded verification

Causal inference for statistical fault localization

Perturbing numerical calculations for statistical analysis of floating-point program (in)stability

Testing system virtual machines

On test repair using symbolic execution

The Google FindBugs fixit

Automatically identifying critical input regions and code in applications

Formal analysis of the effectiveness and predictability of random testing

Content Provider	ACM Digital Library
Author	Briand, Lionel Iqbal, Muhammad Zohaib Arcuri, Andrea
Abstract	There has been a lot of work to shed light on whether random testing is actually a useful testing technique. Despite its simplicity, several successful real-world applications appear in the literature. Although it is not going to solve all possible testing problems, random testing is an essential tool in the hands of software testers. In this paper, we address general questions about random testing, such as how long random testing needs on average to achieve testing targets (e.g., coverage), how does it scale and how likely is it to yield similar results if we re-run random testing on the same testing problem. Due to its simplicity that makes the mathematical analysis of random testing tractable, we provide precise and rigorous answers to these questions. Our formal results can be applied to most types of software and testing criteria. Simulations are carried out to provide further support to our formal results. The obtained results are then used to assess the validity of empirical analyses reported in the literature. Results show that random testing is more effective and predictable than previously thought.
Starting Page	219
Ending Page	230
Page Count	12
File Format	PDF
ISBN	9781605588230
DOI	10.1145/1831708.1831736
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2010-07-12
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Random testing Predictability Schur function Theory Coupon collector
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Random Testing: Theoretical Results and Practical Implications

Optimization Results for a Generalized Coupon Collector Problem

The generalized coupon collector problem (2008).

Some new aspects of the coupon collector’s problem (2004)

Extreme Value Distributions for Random Coupon Collector and Birthday Problems

For the coupon collector’s.

Some new aspects of the coupon collector’s problem (2004)

On the Predictability of Random Tests for Object-Oriented Software

Coupon collecting and transversals of hypergraphs.

Formal analysis of the effectiveness and predictability of random testing

Similar Documents

Random Testing: Theoretical Results and Practical Implications

Optimization Results for a Generalized Coupon Collector Problem

The generalized coupon collector problem (2008).

Some new aspects of the coupon collector’s problem (2004)

Extreme Value Distributions for Random Coupon Collector and Birthday Problems

For the coupon collector’s.

Some new aspects of the coupon collector’s problem (2004)

On the Predictability of Random Tests for Object-Oriented Software

Coupon collecting and transversals of hypergraphs.

Formal analysis of the effectiveness and predictability of random testing