| 2008 | 
|---|
| 22 | EE | Joseph M. Morris,
Malcolm Tyrrell:
Dually nondeterministic functions.
ACM Trans. Program. Lang. Syst. 30(6):  (2008) | 
| 21 | EE | Joseph M. Morris,
Malcolm Tyrrell:
Modelling higher-order dual nondeterminacy.
Acta Inf. 45(6): 441-465 (2008) | 
| 2007 | 
|---|
| 20 | EE | Joseph M. Morris:
Plug-and-Play Nondeterminacy.
B 2007: 289-292 | 
| 19 | EE | Joseph M. Morris,
Malcolm Tyrrell:
Dual unbounded nondeterminacy, recursion, and fixpoints.
Acta Inf. 44(5): 323-344 (2007) | 
| 18 | EE | Joseph M. Morris,
Malcolm Tyrrell:
Terms with unbounded demonic and angelic nondeterminacy.
Sci. Comput. Program. 65(2): 159-172 (2007) | 
| 2006 | 
|---|
| 17 | EE | Malcolm Tyrrell,
Joseph M. Morris,
Andrew Butterfield,
Arthur Hughes:
A Lattice-Theoretic Model for an Algebra of Communicating Sequential Processes.
ICTAC 2006: 123-137 | 
| 2005 | 
|---|
| 16 | EE | Gareth Carter,
Rosemary Monahan,
Joseph M. Morris:
Software Refinement with Perfect Developer.
SEFM 2005: 363-373 | 
| 2004 | 
|---|
| 15 | EE | Joseph M. Morris:
Augmenting Types with Unbounded Demonic and Angelic Nondeterminacy.
MPC 2004: 274-288 | 
| 2003 | 
|---|
| 14 |  | Joseph M. Morris,
Benjamin Aziz,
Frédéric Oehl:
6th International Workshop on Formal Methods, IWFM 2003, Dublin City University. 11 July, 2003
BCS 2003 | 
| 2002 | 
|---|
| 13 | EE | Joseph M. Morris,
Alexander Bunkenburg:
A source of inconsistency in theories of nondeterministic functions.
Sci. Comput. Program. 43(1): 77-89 (2002) | 
| 2001 | 
|---|
| 12 | EE | Joseph M. Morris,
Alexander Bunkenburg:
A theory of bunches.
Acta Inf. 37(8): 541-561 (2001) | 
| 1999 | 
|---|
| 11 | EE | Joseph M. Morris,
Alexander Bunkenburg:
Specificational functions.
ACM Trans. Program. Lang. Syst. 21(3): 677-701 (1999) | 
| 10 |  | Joseph M. Morris,
Alexander Bunkenburg:
A Logic for Reasoning Equationally in the Presence of Partiality.
Sci. Comput. Program. 34(2): 141-158 (1999) | 
| 1998 | 
|---|
| 9 |  | Joseph M. Morris,
Alexander Bunkenburg:
Partiality and Nondeterminacy in Program Proofs.
Formal Asp. Comput. 10(1): 76-96 (1998) | 
| 1997 | 
|---|
| 8 | EE | Joseph M. Morris:
Non-Deterministic Expressions and Predicate Transformers.
Inf. Process. Lett. 61(5): 241-246 (1997) | 
| 1990 | 
|---|
| 7 |  | Joseph M. Morris:
Programming by Expression Refinement: a Sequence of Examples.
Structured Programming 11(4): 189-198 (1990) | 
| 1989 | 
|---|
| 6 |  | Joseph M. Morris:
Laws of Data Refinement.
Acta Inf. 26(4): 287-308 (1989) | 
| 5 |  | Joseph M. Morris:
Temporal Predicat Transformers and Fair Termination.
Acta Inf. 27(4): 287-313 (1989) | 
| 1987 | 
|---|
| 4 |  | Joseph M. Morris:
Varieties of Weakest Liberal Preconditions.
Inf. Process. Lett. 25(3): 207-210 (1987) | 
| 3 |  | Joseph M. Morris:
A Theoretical Basis for Stepwise Refinement and the Programming Calculus.
Sci. Comput. Program. 9(3): 287-306 (1987) | 
| 1979 | 
|---|
| 2 |  | Joseph M. Morris:
A Starvation-Free Solution to the Mutual Exclusion Problem.
Inf. Process. Lett. 8(2): 76-80 (1979) | 
| 1 |  | Joseph M. Morris:
Traversing Binary Trees Simply and Cheaply.
Inf. Process. Lett. 9(5): 197-200 (1979) |