Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Paul R. McMullin

dblp:00/1123 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
0since 2021 · last 1983
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 4 · 3 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
2 papers
Software testing · 75% Requirements engineering and software design · 20% Programming languages and type systems · 5%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Software testing
specification-based testing
0.021983
Combining Testing with Formal Specifications: A Case Study · IEEE Trans. Software Eng. 1983
Data-Abstraction Implementation, Specification, and Testing · ACM Trans. Program. Lang. Syst. 1981
Software testing › specification-based testing
algebraic specification testing
0.011983
Combining Testing with Formal Specifications: A Case Study · IEEE Trans. Software Eng. 1983
Requirements engineering and software design
formal specification
0.011983
Combining Testing with Formal Specifications: A Case Study · IEEE Trans. Software Eng. 1983
Software testing
test oracle
0.011981
Data-Abstraction Implementation, Specification, and Testing · ACM Trans. Program. Lang. Syst. 1981
Programming languages and type systems › specification language
algebraic specification
0.011981
Data-Abstraction Implementation, Specification, and Testing · ACM Trans. Program. Lang. Syst. 1981
Software testing
structural testing
0.011981
Data-Abstraction Implementation, Specification, and Testing · ACM Trans. Program. Lang. Syst. 1981

Methods — techniques the papers use, named apart from their topics

algebraic axioms · 0.0test driver generation · 0.0data abstraction · 0.0
YearPublicationVenuePosition
1983 Combining Testing with Formal Specifications: A Case Study
abstract
This paper describes our experience specifying, implementing, and validating a record-oriented text editor similar to one discussed in [7]. Algebraic axioms served as the specification notation; and the implementation was tested with a compiler-based system that uses the axioms to test implementations with a finite collection of test cases. Formal specifications were sometimes difficult to produce, but helped reveal errors during unit testing. Thorough exercising of the implementations by the specifications resulted in few errors persisting until integration.
Paul R. McMullin, John D. Gannon
IEEE Trans. Software Eng.1
1982 Implementing a Compiler-Based Test Tool
abstract
Abstract DAISTS (Data Abstraction Implementation, Specification and Testing System)1 is a compiler tool‐base for program development. The compiler combines an automated ‘oracle’, which checks consistency conditions derived from algebraic specifications of modules, with run‐time routines that judge the quality of a user's test data according to statement and expression coverage criteria. This paper describes some of the implementation techniques used in DAISTS.
Paul R. McMullin, John D. Gannon, Mark D. Weiser
Softw. Pract. Exp.1
1981 Evaluating a data abstraction testing system based on formal specifications
Paul R. McMullin, John D. Gannon
J. Syst. Softw.1
1981 Data-Abstraction Implementation, Specification, and Testing
abstract
A compiler-based system DAISTS that combines a data-abstraction implementation language (derived from the SIMULA class) with specification by algebraic axioms is described.The compiler, presented with two independent syntactic objects in the axioms and implementing code, compiles a "program" that consists of the former as test driver for the latter.Data points, in the form of expressions using the abstract functions and constant values, are fed to this program to determine if the implementation and axioms agree.Along the way, structural testing measures can be applied to both code and axioms to evaluate the test data.Although a successful test does not conclusively demonstrate the consistency of axioms and code, in practice the tests are seldom successful, revealing errors.The advantage over conventional programming systems is threefold:(1) The presence of the axioms eliminates the need for a test oracle; only inputs need be supplied.(2) Testing is automated: a user writes axioms, implementation, and test points; the system writes the test drivers.(3) The results of tests are often surprising and helpful because it is difficult to get away with "trivial" tests: what is not significant for the code is liable to be a severe test of the axioms, and vice versa.
John D. Gannon, Paul R. McMullin, Richard G. Hamlet
ACM Trans. Program. Lang. Syst.2