Muffy Thomas

15 papers A 1C 2Journal 2Unranked 9
YearRankTypeTitle / Venue / Authors
1998 J jnl
Interactive Theorem Proving: An Empirical Study of User Activity.
J. Symb. Comput.
J. Stuart Aitken, Philip D. Gray, Thomas F. Melham, Muffy Thomas
1997 — conf
Symbolic Bisimulation for Full LOTOS.
AMAST
Carron Shankland, Muffy Thomas
1995 — conf
Experiences in applying formal methods to the analysis of software and system requirements.
WIFT
David Hamilton, Richard Covington, John Kelly, Carron Kirkwood, Muffy Thomas, Alan R. Flora-Holmquist, Mark G. Staskauskas, Steven P. Miller, Mandayam K. Srivas, George Cleland, Donald MacKenzie
1995 — conf
Experiences with specification and verification in LOTOS: a report on two case studies.
WIFT
Carron Kirkwood, Muffy Thomas
1994 — conf
Verification Techniques for LOTOS.
FME
Ursula Martin, Muffy Thomas
1993 J jnl
Solving Divergence in Knuth-Bendix Completion by Enriching Signatures.
Theor. Comput. Sci.
Muffy Thomas, Phil Watson
1992 C conf
A translator for ASN.1 into LOTOS.
FORTE
Muffy Thomas
1991 — conf
Solving Divergence in Knuth-Bendix Completion by Enriching Signatures.
AMAST
Muffy Thomas, Phil Watson
1990 A conf
Generalising Diverging Sequences of Rewrite Rules by Synthesising New Sorts.
Functional Programming
Muffy Thomas, Phil Watson
1989 C conf
From 1 Notation to Another One: An ACT-ONE Semantics for ASN.1.
FORTE
Muffy Thomas
1989 — conf
Inductive Inference for Solving Divergence in Knuth-Bendix Completion.
AII
Muffy Thomas, Klaus P. Jantke
1988 — —
The imperative implementation of algebraic data types.
Muffy Thomas
1988 — conf
Towards a Termination Ordering for Loop Programs.
ADT
Muffy Thomas
1987 — conf
Implementing Algebraically Specified Abstract Data Types in an Imperative Programming Language.
TAPSOFT, Vol.2
Muffy Thomas
1986 — conf
The Storage and Access Structure of Algebraically Specified Data Types.
ADT
Muffy Thomas