NDLI: An application of graph theory to software test data selection (SOEN, Vol. 3, Issue. 5)

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

Volume 3, Issue 5, November 1978

Applied quality assurance methodology

Software Configuration Management

Computing failure

A Software Quality Improvement Program

A comparison of software assurance methods

Error modelling applications in software quality assurance

Toward models for probabilistic program correctness

The establishment and use of measures to evaluate the quality of software designs

A Requirements Tracing Tool

Requirements language processing for the effective testing of real-time systems

Relating software requirements and design

Design feedback and its use in software design aid systems

Nassi-Shneiderman charts an alternative to flowcharts for design

A software quality assurance experiment

The automatic generation and execution of function test plans for electronic switching systems

Software acceptance testing that goes beyond the book

An application of graph theory to software test data selection

Software quality assurance tools

The evolution of a Source Code Control System

A mini-computer based library control system

A framework for the measurement of software quality

A measurement of structure for unstructured programming languages

Are current approaches sufficient for measuring software quality?

Using performance metrics in system design

Responding to MIL-S-52779

The value of a proper software quality assurance methodology

A quantitative evaluation of the effectiveness of quality assurance as experienced on a large-scale software development effort

An example of software quality assurance techniques used in a successful large scale software development

Volume 3, Issue 4, October 1978

Volume 3, Issue 3, July 1978

Volume 3, Issue 2, April 1978

Volume 3, Issue 1, January 1978

An application of graph theory to software test data selection (SOEN, Vol. 3, Issue. 5)

Content Provider	ACM Digital Library
Author	Stickney, M. E.
Abstract	Graph theory is playing an increasingly important role in the design, analysis, and testing of computer programs. It's importance is derived from the fact that flow of control and flow of data for any program can be expressed in terms of directed graphs. From the graph representing the flow of control, called the program graph, many others can be derived that either partially or completely preserve the program control structure. One derived graph known as a cyclomatic tree is of particular value in program testing. It is so named because the number of leaves of the tree is equal to the cyclomatic number of the program graph. A thorough treatment of cyclomatic numbers is provided in [3]. A program called the Complexity/Path Analyzer (CPA) has been developed that builds and utilizes a program cyclomatic tree to provide test planning information, automatically place software counters called probes as discussed in [9] and [10] in a program, and provide selected parameters such as program length and program graph cyclomatic number. The paper discusses the features and derivation of cyclomatic trees as well as their value and application to testing and test data generation. A cyclomatic tree provides a test planner with information useful for planning program tests. In particular, it furnishes test data selection criteria for developing tests that are minimally thorough as defined by Huang in [9]. A test data selection criterion will be defined as minimally thorough if any complete test with respect to the criterion is at least minimally thorough. The term complete is used as defined by Goodenhough and Gerhart in [13]. A test is defined to be a non empty sequence of test cases. Each test case consists of an element selected from the input domain of the program being tested. The paper discusses the merits of one particular technique selected to achieve a minimally thorough test data selection criteria. Part of the technique is automated by the CPA program.
Starting Page	111
Ending Page	115
Page Count	5
File Format	PDF
ISSN	01635948
DOI	10.1145/953579.811109
Journal	ACM SIGSOFT Software Engineering Notes (SOEN)
Volume Number	3
Issue Number	5
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1979-04-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

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