%A I. Balbin
%A P.C. Poole
%T A language for specifying forms
%J Proceedings of the 6th ACSC
%C Sydney
%D February 1983

%A I. Balbin
%A P.C. Poole
%A C.J. Stuart
%T On the specification and manipulation of forms
%J IFIP TC-2 Working Conference on System Methodologies
%C Kecskemet, Hungary
%D May 1983

%A I. Balbin
%T High level forms specification in office automation
%J M.Sc. thesis
%I Department of Computer Science, University of Melbourne
%D September 1983

%A I. Balbin
%T A users guide to FSL
%R TR 83/8
%I Department of Computer Science, University of Melbourne
%D 1983
%K TPS

%A J. Bauer
%A S. Faase
%A A. Finger
%A W. Goodhue
%T The automatic generation and execution of function test plans
for electric switching systems
%J Proceedings Software Quality Assurance Workshop
%C San Diego, CA
%D November 1978
%P 92-100
%K ATE GTE
%Y dap G

%A B. Dasarathy
%A C. Sekharan
%A R. Collins
%T Test generation for functional validation
%J Submitted to Sixth ICSE
%E GTE Laboratories, MA
%D 1982
%K TPG ATE
%Y dap G

%A A.M. Davis
%A W.J. Rataj
%T Requirements language processing for the effective testing of Real-Time
systems
%J Proceedings Software Quality Assurance Workshop
%C San Diego, CA
%D November 1978
%P 61-66
%K RLP GTE
%Y dap G

%A A.M. Davis
%A T.J. Miller
%A E. Rhode
%A B. Taylor
%T RLP : an automated tool for the processing of requirements
%J Proceedings of the COMPSAC'79
%D 1979
%P 289-299
%K GTE
%Y dap G

%A T.A. Dolotta
%A J.S. Licwinko
%A R.E. Menninger
%A W.D. Roome
%T The LEAP load and test driver
%J Proceedings 2nd ICSE
%C San Francisco
%D October 1976
%P 182-186,168
%Y dap L

%A Jacob Savir
%A Gary S. Ditlow
%A Paul H. Bardell
%T Random pattern testability
%J IEEETC
%V C-33
%N 1
%D January 1984
%P 79-90
%K hardware self test, detection probability, fault coverage
%X A new analytical method of computing fault coverage that is fast compared
with simulation.  If the fault coverage falls below a certain threshold, it
is possible to identify the "random-pattern-resistant" faults, modify the logic
to make them easy to detect, and thus, increase the fault coverage of the
random test.
%Y dap S

%A Kang G. Shin
%A Yahn-Hang Lee
%T Error detection process - model, design, and its impact on computer
performance
%J IEEETC
%V C-33
%N 6
%D June 1984
%P 529-540
%K error latency, reliable results, confidence probability
%X Due to error latency, undetected errors make computation results unreliable.
A model to (1) predict the probability of unreliable results (lack of
confidence), and (2) estimate loss of compuatation due to fault and/or error
(for timing analysis), is used.  Error recovery is considered.

%A J.W. Duran
%A S. Ntafos
%T A report on random testing
%J Proceedings 5th ICSE
%C San Diego, CA
%D March 1981
%P 179-183

%A Joe W. Duran
%A Simeon C. Ntafos
%T An evaluation of random testing
%J IEEETSE
%V SE-10
%N 4
%D July 1984
%P 438-444
%Y dap D

%A S.C. Ntafos
%A S. Louis Hakimi
%T On path cover problems in digraphs and applications to program testing
%J IEEETSE
%V SE-5
%N 5
%D September 1979
%P 520-529
%Y dap N

%A Thomas A. Thayer
%A Myron Lipow
%A Eldred C. Nelson
%T Software reliability
%S TRW Series of Software Technology 2
%I North-Holland
%D 1978
%X A sw reliability study by TRW for Rome Air Development Center of error
data on 4 sw projects.  TRW's Mathematical Theory of Software Reliability
(MTSR), the Nelson model, is presented.  Other models are surveyed.
%Y 001.642 T 338

%A Per Brinch Hansen
%T Testing a multiprogramming system
%J SP&E
%V 3
%D 1973
%P 145-150
%Y dap H, also Tutorial: Sw T & Vn Techniques, p272-277

%A K.P. Eswaran
%A J.N. Gray
%A R.A. Lorie
%A I.L. Traiger
%T The notions of consistency and predicate locks in a database system
%J CACM
%V 19
%N 11
%D November 1976
%P 624-633
%K concurrency transaction
%Y dap E

%A R.G. Hamlet
%T Testing programs with the aid of a compiler
%J IEEETSE
%V SE-3
%N 4
%D July 1977
%P 279-290
%K SIMPL-T, finite sets of data, stmt exprn coverage
%X If finite input-out specifications are added to the syntax of programs,
these specifications (i.e. finite sets of test data) can be verified at
compile time.  Such tests may be maximal wrt statements or expressions.
A SIMPL-T compiler is thus modified.

%A Richard G. Hamlet
%T Testing programs with finite sets of data
%J The Computer Journal
%V 20
%N 3
%D August 1977
%P 232-237
%K compiler optimization, SIMPL-T
%X Companion paper to "Testing Programs with the Aid of a Compiler".
Presents a theory of programs which cannot be optimised wrt finite test sets.
Can a test set for program p be determined to be a subfuntion of {p}?
(Not effectively.)  Can the halting problem be separated from test set
generation?  (No)  Stmt maximal test sets cannot be generated.

%A E. Satterthwaite
%T Debugging tools for high level languages
%J SP&E
%V 2
%D July 1972
%P 197-217
%K ALGOL compiler, trace
%X Using ALGOL W a source language debugging tool is implemented
which features a selective trace, automatically controlled by execution
frequency counts.  Ref [10] in Hamlet, "Testing Progs w the Aid of a Compiler",
IEEETSE 1977.
%Y dap S

%A Victor R. Basili
%A Albert J. Turner
%T A transportable extendable compiler
%J SP&E
%V 5
%D July 1975
%P 269-278
%K SIMPL-T bootstrap
%X The SIMPL-T compiler and its transportable bootstrap are described.
Ref [11] in Hamlet, "Testing Progs w the Aid of a Compiler", IEEETSE 1977.
%Y dap B

%A Bogdan W. Wiszniewski
%T MOVE - a verifying tool for modular software
%J Microprocessing and Microprogramming
%V 14
%I Author: Institute of Computer Science,
Politechnika Gdanska, Gdansk, Poland.
Journal: North-Holland
%D 1984
%P 149-153
%K representative classes of computations
%X How to abstract representative classes of computations
from the code with help from the MOVE tool.

%A W.H. Jessop
%A J.R. Kane
%A S. Roy
%A J.M. Scanlon
%T ATLAS - an automated software testing system
%J Proceedings 2nd ICSE
%C San Francisco
%D October 1976
%P 629-635
%Y dap A

%A H.T. Kung
%A J.T. Robinson
%T On optimistic methods for concurrency control
%J TODS
%V 6
%N 2
%D June 1981
%P 213-226
%K database
%Y dap K

%A Susan B. Davidson
%T Optimism and consistency in partitioned distributed database systems
%J TODS
%V 9
%N 3
%D September 1984
%P 456-481
%K concurrent transaction
%X A protocol for transaction processing guarantees mutual consistency
between copies of data-items after repair is completed.  Network partitioning.
It is optimistic, and minimizing backout cost is discussed.
%Y dap D

%A Glenford J. Myers
%T Software reliability
%I WILEY
%C New York
%D April 1976
%P 169-259
%K external function testing, cause-effect graph
%Y 001.6425 M 992

%A Glenford J. Myers
%T The art of software testing
%I WILEY
%C New York
%D 1979
%X Eight chapters: A Self-Assessment Test
The Psychology and Economics of Program Testing
Program Inspections, Walkthroughs, and Reviews
Test-Case Design
Module Testing
Higher-Order Testing
Debugging
Test Tools and Other Techniques
%Y Monash H 001.6425 M996A

%A C.J. Stuart
%T Transaction processing using forms in a multi-user environment
%R TR 83/9
%I Department of Computer Science, University of Melbourne
%D 1983

%A R.W. Worrest
%T Using an automatic test executor to support parallel system and test
development
%J Proceedings of the IEEE Phoenix Conference on Computers and Communication
%D May 1982
%P 204-208
%K ATE GTE
%Y dap G

%A Mack W. Alford
%T A requirements engineering methodology for Real-Time processing requirements
%J IEEETSE
%V SE-3
%N 1
%D January 1977
%P 60-69
%K BMD TRW
%Y dap A

%A Harold N. Gabox
%A Shachindra N. Maheshwari
%A Leon J. Osterweil
%T On two problems in the generation of program test paths
%J IEEETSE
%V SE-2
%N 3
%D September 1976
%P 227-231
%K NP-complete
%Y dap O

%A Cindy Wilson
%A Leon J. Osterweil
%T Omega -- a data flow analysis tool for the c programming language
%J Proceedings of the COMPSAC'82
%D 1982
%P 9-18
%K static
%O Recommended by TYC.
%X Omega is a prototype system for the static data flow analysis
of C programs.  Difficulties with pointers are mentioned.
%Y dap O

%A Leon J. Osterweil
%A Lloyd D. Fosdick
%A Richard N. Taylor
%T Error and anomaly diagnosis through data flow analysis
%B "Computer Program Testing" 1981 pp35-63,
or "Program Test Methods" 1982
%E B. Chandrasekaran
%E S. Radicchi
%I North Holland
%K static, concurrency
%O Referenced in Omega.
%X Reviews static data flow.  Suggests an extension
for COBOL whereby a file must be opened, then accessed,
then closed.  For concurrent languages, suggests that
waiting for unsheduled or finished process and scheduling
a process in parallel with itself be anomalies.
%Y dap O, TYC has book.

%A Leon J. Osterweil
%A Lloyd D. Fosdick
%T DAVE - a validation error detection and documentation system for fortran
programs
%J SP&E
%D October-December 1976
%P 473-486
%K data flow
%Y dap O, also Tutorial: Sw T & Vn Techniques, p143-156

%A Jacek Jachner
%A Vinod K. Agarwal
%T Data flow anomaly detection
%J IEEETSE
%V SE-10
%N 4
%D July 1984
%P 432-437
%X Extends Fosdick & Osterweil, "Data Flow Analysis in Sw Reliability"
ACM Comput. Surveys, Sep 1976.
%Y dap J

%A F.T. Chan
%A T.Y. Chen
%T On data flow analysis across a subroutine boundary
%J Proceedings of International Computer Symposium 1980 (Vol. I)
%I Computer Centre, University of Hong Kong
%D 1980
%P 170-176
%K dynamic
%X Follows dynamic data flow as per J.C.Huang in
"Detection of Data Flow Anomaly Thro Prog Instrumentation",
IEEETSE SE-5 #3 May 1979.  Further, subroutine parameters
are to be classified by programmers through special comments
as (1) input & unaltered (in state DR, defined for reference
only, and when referenced in state RO, reference only),
(2) input-output (to be referenced {hence state DS: defined &
should be referenced} and also defined), (3) input-working (in
state DS, and to be assumed by the caller to be left as undefined)
or (4) output (to be defined).
%Y dap C, TYC

%A T.Y. Chen
%A H. Leung
%T The use of data flow analysis as an aid to developing fortran programs
%J Proceedings of the 9th Australian Computer Conference (1982)
%D 1982
%P 240-249
%K dynamic instrumentation
%X Experience with an implementation using states U, D, R & A,
*and* DS, DR & RO.
%Y dap C, TYC

%A H. Kao
%A T.Y. Chen
%T Data flow analysis for COBOL
%J SIGPLAN Notices
%V 19
%N 7
%D July 1984
%P 18-21
%X A file can be in state C (closed), O (opened), F (read),
W (write) or of course A (abnormal).  Further, an action applied
to a field is deemed to be applied to the whole record.
Has since been implemented as the dynamic tool COD.
%Y dap C, TYC

%A Sandra Rapps
%A Elaine J. Weyuker
%T Data flow analysis techniques for test data selection
%J Proceedings 6th ICSE
%D 1982
%P 272-278
%K static def/use graph
%Y dap W, TYC

%A Ira R. Forman
%T An algebra for data flow anomaly detection
%J Proceedings 7th ICSE
%D 1984
%P 278-286
%K static regular path expression analysis
%X A bit-based algebra is developed for anomaly detection by interpreting
the regular expression for the paths in a program.
%Y dap F, TYC

%A P.E. Lauer
%T Synchronization of concurrent processes without globality assumptions
%J ???
%C Newcastle upon Tyne
%D 1981 ?
%P 66-80
%K COSY parallel Hoare
%Y dap Concurrency

%A Bengt Lundberg
%T On correctness of information models
%J Information Systems
%V 8
%N 2
%D 1983
%P 87-93
%K conceptual database consistency satisfiability completeness
%Y dap L

%A E.F. Miller\ Jr.
%A R.A. Melton
%T Automated generation of testcase datasets
%B Tutorial: Software Testing & Validation Techniques
%D 1978
%P 238-245
%O Reprinted from Proceedings 1975 International Conference on Reliable Software
%Y dap M

%A P.A. Pravil'shchikov
%A V.S. Shchepin
%T Compilation of structural programs in a dialogue mode with concurrent test
generation
%J Avtomatika i Telemekhanika
%V 40
%N 8
%D August 1979
%P 129-138
%K fault tree analysis
%O English Tr. "Automation and Remote Control", v 40 n 8 pt 2, pp1205-1213
%Y dap P  Monash H 629.805 A939

%A P.A. Pravil'shchikov
%T Design of program tests
%J Avtomatika i Telemekhanika
%N 5
%D May 1977
%P 147-160
%K combinatorial debugging
%Y dap P  Monash H 629.805 A939 English Tr. pp739-750

%A R.G. Hamlet
%T Theoretical issues in software engineering
%R TR 82/8
%I Department of Computer Science, University of Melbourne
%D September 1982

%A R.G. Hamlet
%T Testing of concurrent programs and partial specifications
%R TR 82/13
%I Department of Computer Science, University of Melbourne
%D December 1982

%A R.G. Hamlet
%T Overview of program testing
%R TR 82/14
%I Department of Computer Science, University of Melbourne
%D December 1982

%A R.G. Hamlet
%T Overview of program testing
%R TR 82/14
%I Department of Computer Science, University of Maryland
%D May 1982
%Y dap H

%A R.G. Hamlet
%T Three approaches to testing theory
%R TR 82/15
%I Department of Computer Science, University of Melbourne
%D December 1982
%Y dap H

%A R.G. Hamlet
%T Step-wise debugging
%R TR 82/16
%I Department of Computer Science, University of Melbourne
%D December 1982

%A D.A. Price
%T Functional requirements testing for concurrent programs
%E P.C. Poole
%I Honours Report
%D 1982

%T Tutorial: software testing & validation techniques
%E Edward Miller
%E William E. Howden
%I IEEE
%C New York
%D 1978
%Y 001.6425 M 613

%T Tutorial: software methodology
%E C.V. Ramamoorthy
%E Raymond T. Yeh
%I IEEE
%D 13-16 November 1978
%O COMPSAC'78 IEEE 2nd International Computer Software and Applications Conference
%Y 001.6425 R 141

%A William E. Howden
%T Completeness criteria for testing elementary program functions
%J Proceedings 5th IEEECSE
%D 1981
%P 235-243
%K branch, mutation analysis
%O UCSD
%Y dap H photocopy of some reprint p67-75

%A John A. Darringer
%A James C. King
%T Applications of symbolic execution to program testing
%J COMP
%I IEEE
%D April 1978
%P 51-59
%O IBM Thomas J. Watson Research Center
%Y dap D

%A A.G. Duncan
%A J.S. Hutchison
%T Using attributed grammars to test designs and implementations
%I IEEE
%C New York
%D 1981
%P 170-178
%K case generation
%O General Electric R & D Center
%Y dap D

%A Susan L. Gerhart
%A Lawrence Yelowitz
%T Observations of fallibility in applications of modern programming
methodologies
%J IEEETSE
%V SE-2
%N 3
%P 195-207
%K published algorithms
%Y dap G, also Tutorial: Software Methodology, pp334-346

%A Joe W. Duran
%A John J. Wiorkowski
%T Toward models for probabilistic program correctness
%P 39-44
%K probability, statistics
%Y dap D

%A Joe W. Duran
%A John J. Wiorkowski
%T Quantifying software validity by sampling
%J IEEE Transactions of Reliability
%V R-29
%N 2
%D June 1980
%P 141-144
%K probability, statistics
%Y dap D

%A Shashi Phoha
%T A software quality assurance methodology for air force projects
%I The MITRE Corporation
%K probability, statistics, path analysis
%Y dap P

%A Tsun S. Chow
%T Testing software design modeled by Finite-State machines
%J IEEETSE
%V SE-4
%N 3
%D May 1978
%P 178-187
%K cover
%O Bell, IL
%Y dap C

%A Peter C. Bates
%A Jack C. Wileden
%T High-Level debugging of distributed systems: the behavioral abstraction
approach
%J The Journal of Systems and Software
%V 3
%D 1983
%P 255-264
%Y dap B

%A Debra J. Richardson
%A Lori A. Clarke
%T On the effectiveness of the partition analysis method
%J Workshop on Effectiveness of Testing and Proving Methods
%C Avalon CA
%D 11-13 May 1982
%Y dap R

%A Thomas J. Ostrand
%A Elaine J. Weyuker
%T The use of revealing subdomains
%I Sperry Univac
%C Pennsylvania
%K partition
%O ???? Avalon Workshop? 1982?
%Y dap O

%A Elaine J. Weyuker
%A Thomas J. Ostrand
%T Theories of program testing and the application of revealing subdomains
%J IEEETSE
%D May 1980
%P 236-246
%K partition, Goodenough & Gerhart
%Y dap O

%A Larry J. Morell
%A Richard G. Hamlet
%T An error elimination testing strategy
%J Workshop on Effectiveness of Testing and Proving Methods
%C Avalon CA
%D 11-13 May 1982
%Y dap H

%A Richard G. Hamlet
%T "Determining" tests
%I Department of Computer Science, University of Maryland
%K cover, reliability
%Y dap H

%A John S. Gourlay
%T Specification testing
%I Ohio State University
%K predicate calculus, generation
%Y dap G

%A Robert L. Probert
%A Hasan Ural
%T Incremental improvement of specifications by testing
%I Department of Computer Science, University of Ottawa
%C Ottawa, Ontario
%K boundary-interior, Naur line editor problem
%Y dap P

%A Paul R. McMullin
%A John D. Gannon
%T Combining testing with formal specifications: a case study
%I Department of Computer Science, University of Maryland
%K DAISTS
%Y dap M

%A John D. Gannon
%A Paul R. McMullin
%A Richard G. Hamlet
%T Data-Abstraction implementation, specification, and testing
%J TOPLAS
%V 3
%N 3
%D July 1981
%P 211-223
%K DAISTS
%Y dap H (stapled in with Reliability Theory of Program Testing, Hamlet)

%A Richard G. Hamlet
%T Reliability theory of program testing
%J ACTA
%V better check
%D 1981
%P 31-43
%Y dap H (stapled in with DAISTS)

%A Steven J. Zeil
%T Blindness expressions as a measure of testing effectiveness
%I University of Massachusetts
%O very short, Avalon Workshop? 1982
%Y dap Z

%A Kenneth A. Foster
%T Error sensitive test cases analysis (ESTCA)
%J IEEETSE
%V SE-6
%N 3
%D May 1980
%P 258-264
%Y dap F

%A John B. Goodenough
%A Susan L. Gerhart
%T Toward a theory of test data selection
%J IEEETSE
%D June 1975
%P 156-173
%Y dap G, also Tutorial: Software Testing & Validation Techniques, pp20-37

%A William E. Howden
%T Reliability of the path analysis testing strategy
%J IEEETSE
%V SE-2
%N 3
%D September 1976
%P 208-215
%Y dap H, also Tutorial: Sw Testing & Validation Techniques, pp38-45

%A J.C. Huang
%T An approach to program testing
%J COMPSUR
%V 7
%N 3
%D September 1975
%P 113-128
%K case generation, path analysis, digraph, counters,
stmt coverage, minimally thorough
%O Reprinted: Tutorial: Sw T & Vn Techniques, pp246-261.
Tutorial: Sw Methodology, pp318-333
%X A "minimally thorough" test is a set of test cases for which every
statement in the program is executed at least once (statement coverage).
A program can be instrumented with counters at the beginning of each of its
branches (edges of the graph) to ensure this.  If a particular branch is to
be executed, a path predicate can be found by dragging branch predicates
backward.  A solution to the path predicate is test data.
%Y dap H

%A J.C. Huang
%A Melody Ho
%A Ted Law
%T A simulator for real-time software debugging and testing
%J SP&E
%V 14
%N 9
%D September 1984
%P 845-855
%K Z80 microprocessor
%X A real-time simulator which executes Z80 assembler language
and monitors concurrent processes.

%A J.C. Huang
%T Detection of data flow anomaly through program instrumentation
%J IEEETSE
%V SE-5
%N 3
%D May 1979
%P 226-236
%K dynamic
%Y dap H

%A Barbara Liskov
%A Robert Scheifler
%T Guardians and actions: linguistic support for robust, distributed programs
%J TOPLAS
%V 5
%N 3
%D July 1983
%P 381-404
%K concurrent transaction processing database atomicity
%Y dap L

%A Nancy G. Leveson
%A Peter R. Harvey
%T Software fault analysis tree
%J The Journal of Systems and Software
%V 3
%D 1983
%P 173-181
%K safety
%Y dap L

%A R.J. Peterson
%T TESTER/1: an abstract model for the automatic synthesis of program test case
specifications
%J Proceedings of the Symposium on Computer Software Engineering
%C New York
%D 20-22 April 1976
%P 465-484
%K digraph, functional, cover
%Y dap P

%A David J. Panzl
%T Automatic software test drivers
%J COMP
%D April 1978
%P 44-50
%Y dap P, also Tutorial: Sw T & Vn Techniques, p266-271

%A David J. Panzl
%T Automatic revision of formal test procedures
%J Proceedings 3rd ICSE
%P 320-326
%O late 1978 or 1979, must check up
%Y dap P

%A W.-M. Dehnert
%T Structured parallel programming - specification tools for distributed
systems
%J Real-Time Data Handling And Process Control
%E H. Meyer
%C West Berlin
%D 23-25 October 1979
%K guarded processes, PARCs
%O Proceedings of the First European Symposium
%Y dap D, RMIT

%A Volkmar H. Haase
%T Specification and construction of real-time programs with "PARCs"
%J Angewandte Informatik  (Applied Informatics)
%V 22
%N 5
%D May 1980
%P 179-188
%K guarded processes
%X A PARC is a parallel construct which uses global control (monitor-like
synchronization instead of semaphores) to activate parallel processes on
given conditions.
%Y dap H, Monash H 510.7805 A587

%A Richard A. DeMillo
%A Richard J. Lipton
%A Frederick G. Sayward
%T Hints on test data selection: help for the practicing programmer
%J COMP
%D April 1978
%P 34-41
%K coupling effect
%Y dap D

%A Claude Jard
%A Gregor v. Bochmann
%T An approach to testing specifications
%J The Journal of Systems and Software
%V 3
%D 1983
%P 315-323
%K consistency, extended fsm, distributed mutual exclusion protocol,
design validation, automated test module construction
%X A testing module compares a trace of interactions obtained from an
execution of the refined specification with the reference specification.
Nondeterminism in the reference specification is limited using an extended
finite state transition model.
%Y dap J

%A Hugh Noble
%T The automatic generation of test data for a relational database
%J Information Systems
%V 8
%N 2
%D 1983
%P 79-86
%K linkage, QIKSYS, attibute
%X A linkage is a set of interdependent relations.  Together with relations,
tuples, attributes and attribute-values, this provides a hierarchy of
structures within which one may specify and generate data which are not only
valid with respect to attribute domains, but preserve dependencies.  The
experimental system QIKSYS illustrates this.
%Y dap N

%A Anany Levitin
%T Halstead's software science: can it be a basis for software engineering?
%I Villanova University, PA
%X No
%Y dap S (Sw Science)

%A J.-L. Lassez
%A D. van der Knijff
%A John Shepherd
%A C. Lassez
%T A critical examination of software science
%J The Journal of Systems and Software
%V 2
%D 1981
%P 105-112
%Y dap S

%A Norman F. Salt
%T Defining software science counting strategies
%C Toronto, Ontario
%Y dap S

%A Clarence A. Ellis
%A Gary J. Nutt
%T Office information systems and computer science
%J COMPSUR
%V 12
%N 1
%D March 1980
%P 27-60
%Y dap E

%A N.J. Denil
%T A business language
%J IBM Journal of Research & Development
%V 24
%N 6
%D November 1980
%P 732-747
%Y isaac, dap D