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

Robin M. Gallimore

dblp:18/4663 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 1990
—ORCID · none

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

Software engineering, systems software and programming languages · 2Applied, interdisciplinary, general and emerging computing · 1 · 1 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
1 paper
Requirements engineering and software design · 56% Software testing · 44%

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

TopicWeightPapersLastEvidence papers
Requirements engineering and software design
formal specification
0.011990
Formal Specification and Design Time Testing · IEEE Trans. Software Eng. 1990
Requirements engineering and software design › specification
executable specification language
0.011990
Formal Specification and Design Time Testing · IEEE Trans. Software Eng. 1990

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

dynamic validation · 0.0OBJ · 0.0
YearPublicationVenuePosition
1990 Formal Specification and Design Time Testing
abstract
It is shown how design time testing can be used in conjunction with formal specification. Emphasis is placed on the benefits of using an executable specification language OBJ, of having a design controlled by requirements specification, and of adherence to the regularity and uniformity hypotheses in dynamic validation. It is shown that such an approach offers positive benefits by providing early design validation and a controlled, disciplined design process.>
Christopher Paul Gerrard, Derek Coleman, Robin M. Gallimore
IEEE Trans. Software Eng.3
1989 UMIST OBJ: A Language for Executable Program Specifications
abstract
This paper defines the algebraic specification language implemented by the UMIST OBJ system. It also illustrates the use of the language for the definition of abstract, executable specifications of the behaviour of computer programs. The system implements an executable subset of J.A. Goguen's OBJ language, which is based on the algebraic definition of abstract data types. The language permits data type and operations to be defined abstractly, i.e. independently of any particular representation. Moreover, the definitions of an OBJ specification can be treated as an abstract program, by regarding the equations contained in a specification as a set of left-right rewrite rules which may be used to simplify terms. This makes the language useful for formulating and exploring the consequences of abstract designs, and developing relevant parts of the theory of the associated problem domain. The ability to exercise descriptions of the theory of a problem domain is a powerful tool for the programmer. By providing timely feedback on the correctness of design decisions, such use of the language encourages and reinforces the exploration of design possibilities. With these features, UMIST OBJ embodies the foundation of a framework for effective software engineering. It provides an accessible basis for both mechanisable formal notations for program description and semantically motivated support tools.
Robin M. Gallimore, Derek Coleman, Victoria Coleman
Comput. J.1
1979 An Assessment of Concurrent Pascal
abstract
Abstract This paper assesses Concurrent Pascal against its design aims. The language is shown to be suitable for writing reliable non‐trivial concurrent applications programs and operating systems. The major weakness of the language is its inability to provide an environment for other Concurrent Pascal programs. A new language construct, group, is proposed to remedy this difficulty.
Derek Coleman, Robin M. Gallimore, Jane W. Hughes, Malcolm S. Powell
Softw. Pract. Exp.2