Testing Software Design Modeled by Finite-State Machines
IEEE Transactions on Software EngineeringPublished 1 May 1978
Tsun S. Chow
Citations1,415
SJR quartileQ1
SJR score1.45
SNIP2.43
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
The method is based on a result in automata theory and can be applied to software testing and its error-detecting capability is compared with that of other approaches.
Abstract
We propose a method of testing the correctness of control structures that can be modeled by a finite-state machine. Test results derived from the design are evaluated against the specification. No "executable" prototype is required. The method is based on a result in automata theory and can be applied to software testing. Its error-detecting capability is compared with that of other approaches. Application experience is summarized.
Keywords
Computer Science
Cambridge University Press eBooksSwitching and Finite Automata Theory
1,780 Citations2009Zvi Kohavi, Niraj K. Jha
Theories are made easier to understand with 200 illustrative examples, and students can test their understanding with over 350 end-of-chapter review questions.
ACM SIGPLAN NoticesToward a theory of test data selection
520 Citations1975John B. Goodenough, Susan L. Gerhart
CERN Document Server (European Organization for Nuclear Research)Compiler construction for digital computers
451 Citations1971David Gries
The techniques involved in writing compilers for high-level languages such as FORTRAN or PL/1, as well as semantic routines, are described.
Fault detecting experiments for sequential circuits
427 Citations1964F. C. Hennine
The design of experimental procedures for determining whether or not a sequential switching circuit is operating in accordance with a given state-table description are described.
IEEE Transactions on Software EngineeringReliability of the Path Analysis Testing Strategy
399 Citations1976William E. Howden
It is proved that an effective testing strategy which is reliable for all programs cannot be constructed and a method for analyzing the reliability of path testing is introduced.
ACM Computing SurveysAn Approach to Program Testing
230 Citations1975J. C. Huang
This tutorial describes the problems involved and the methods that can be used to satisfy the test requirement of selecting test cases in such a way that each and every branch in the flowchart will be traversed at least once during the test.
IEEE Transactions on ComputersMethodology for the Generation of Program Test Data
195 Citations1975William E. Howden
The methodology is a model of the test data generation process and can be used to characterize the basic problems of testData generation and build an automatic test data Generation system.
Toward a theory of test data selection
92 Citations1975John B. Goodenough, Susan L. Gerhart
The authors prove a fundamental theorem showing that properly structured tests are capable of demonstrating the absence of errors in a program.
International Conference on Software EngineeringA software reliability assessment based on a structural and behavioral analysis of programs
39 Citations1976Simone Pimont, J. C. Rault
This paper defines a practical procedure to perform an assessment of program reliability using structured programming techniques and considers that a certain degree of verification is attained with a given set of tests, according to the number of paths actually traversed.
IRE Transactions on Communications SystemsState-Transition Programming Techniques and Their Use in Producing Teleprocessing Device-Control Programs
10 Citations1972Dennis M. Birke
A method of using state-transition diagrams for writing and implementing control programs for teleprocessing devices is presented and generalizations and extensions of the technique are suggested.