A hierarchical approach to program testing
ACM SIGPLAN NoticesPublished 1 January 1980
Janusz Łaski
Citations9
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
A real-environment interactive testing procedure is presented which is based upon a hierarchical decomposition of a program into levels of abstraction based on a program model which involves both control and data flow.
Abstract
A real-environment interactive testing procedure is presented which is based upon a hierarchical decomposition of a program into levels of abstraction. Such a decomposition is defined in terms of a program model which involves both control and data flow. The testing strategy adopted is supposed to follow a typical progress of a programmer who carries out a series of experiments with his program. Several semantical and structural issues involved are discussed.
Keywords
Computer Science
Communications of the ACMSymbolic execution and program testing
2,991 Citations1976James C. King
A particular system called EFFIGY which provides symbolic execution for program testing and debugging is described, which interpretively executes programs written in a simple PL/I style programming language.
ACM SIGPLAN NoticesToward a theory of test data selection
520 Citations1975John B. Goodenough, Susan L. Gerhart
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.
SIAM Journal on ComputingA Simple Algorithm for Global Data Flow Analysis Problems
135 Citations1975Matthew S. Hecht, Jeffrey D. Ullman
A simple, iterative bit propagation algorithm for solving global data flow analysis problems such as “available expressions” and “live variables” is presented and shown to be quite comparable in speed to the corresponding interval analysis algorithm.
ACM SIGPLAN NoticesTesting large software with automated software evaluation systems
127 Citations1975C. V. Ramamoorthy, S. F. Ho
IEEE Transactions on Software EngineeringTheoretical and Empirical Studies of Program Testing
122 Citations1978William E. Howden
Two approaches to the study of program testing are described and the differences between the two approaches are discussed and their relative advantages and disadvantages are compared.
IEEE Transactions on Software EngineeringObservations of Fallibility in Applications of Modern Programming Methodologies
93 Citations1976S. Gerhart, L. Yelowitz
Errors, inconsistencies, or confusing points are noted in a variety of published algorithms, many of which are being used as examples in formulating or teaching principles of such modern programming methodologies as formal specification, systematic construction, and correctness proving.
IEEE Transactions on Software EngineeringThe Logic of Computer Programming
64 Citations1978Zohar Manna, Richard Waldinger
Techniques derived from mathematical logic promise to provide an alternative to the conventional methodology for constructing, debugging, and optimizing computer programs.
Communications of the ACMTest data as an aid in proving program correctness
45 Citations1978Matthew M. Geller
Elsevier eBooksInformation Processing
40 Citations2008Rick E. Ingram, Dana Steidtmann +1 more
This chapter serves to validate important aspects of cognitive models, but also offers promise for helping to identify risk variables that might be targeted in prevention efforts.
SIAM Journal on ComputingA Comparison of Two Algorithms for Global Data Flow Analysis
20 Citations1976Ken Kennedy
The problem of determining the points in a program at which variables are “live” (will be used again) is introduced and discussed and two solutions, one which uses a simple iterative algorithm and an algorithm based on “Cocke–Allen interval” analysis are presented and analyzed.
Software Practice and ExperienceDebugging techniques
20 Citations1979Søren Lauesen
This paper discusses several techniques for improving debugging efficiency, and it is suggested that top‐down debugging is more efficient if combined with some of the other techniques.
Journal of the ACMComplexity of Synthesizing Inductive Assertions
13 Citations1977Ben Wegbreit
A new class is obtained for which assertion synthesis reqmres at least nondetermimstlc polynomial ume ~s strongly conlectured to require determlmstlc exponenual time, and it appears that the general problem of asserUon synthesis Is at least exponentml.