We stand with Ukraine  

Joseph M. Morris

According to our database1, Joseph M. Morris authored at least 24 papers between 1979 and 2009.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2009
Term transformers: A new approach to state.
[BibTeX]
[DOI]
Joseph M. Morris
,
Alexander Bunkenburg
,
Malcolm Tyrrell
ACM Trans. Program. Lang. Syst., 2009

2008
Dually nondeterministic functions.
[BibTeX]
[DOI]
Joseph M. Morris
,
Malcolm Tyrrell
ACM Trans. Program. Lang. Syst., 2008

Modelling higher-order dual nondeterminacy.
[BibTeX]
[DOI]
Joseph M. Morris
,
Malcolm Tyrrell
Acta Informatica, 2008

2007
Terms with unbounded demonic and angelic nondeterminacy.
[BibTeX]
[DOI]
Joseph M. Morris
,
Malcolm Tyrrell
Sci. Comput. Program., 2007

Dual unbounded nondeterminacy, recursion, and fixpoints.
[BibTeX]
[DOI]
Joseph M. Morris
,
Malcolm Tyrrell
Acta Informatica, 2007

Plug-and-Play Nondeterminacy.
[BibTeX]
[DOI]
Joseph M. Morris
Proceedings of the B 2007: Formal Specification and Development in B, 2007

2006
A Lattice-Theoretic Model for an Algebra of Communicating Sequential Processes.
[BibTeX]
[DOI]
Malcolm Tyrrell
,
Joseph M. Morris
,
Andrew Butterfield
,
Arthur Hughes
Proceedings of the Theoretical Aspects of Computing, 2006

2005
Software Refinement with Perfect Developer.
[BibTeX]
[DOI]
Gareth Carter
,
Rosemary Monahan
,
Joseph M. Morris
Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods (SEFM 2005), 2005

2004
Augmenting Types with Unbounded Demonic and Angelic Nondeterminacy.
[BibTeX]
[DOI]
Joseph M. Morris
Proceedings of the Mathematics of Program Construction, 7th International Conference, 2004

2002
A source of inconsistency in theories of nondeterministic functions.
[BibTeX]
[DOI]
Joseph M. Morris
,
Alexander Bunkenburg
Sci. Comput. Program., 2002

2001
A theory of bunches.
[BibTeX]
[DOI]
Joseph M. Morris
,
Alexander Bunkenburg
Acta Informatica, 2001

1999
Specificational functions.
[BibTeX]
[DOI]
Joseph M. Morris
,
Alexander Bunkenburg
ACM Trans. Program. Lang. Syst., 1999

A Logic for Reasoning Equationally in the Presence of Partiality.
[BibTeX]
[DOI]
Joseph M. Morris
,
Alexander Bunkenburg
Sci. Comput. Program., 1999

1998
Partiality and Nondeterminacy in Program Proofs.
[BibTeX]
[DOI]
Joseph M. Morris
,
Alexander Bunkenburg
Formal Aspects Comput., 1998

1997
Non-Deterministic Expressions and Predicate Transformers.
[BibTeX]
[DOI]
Joseph M. Morris
Inf. Process. Lett., 1997

1990
Programming by Expression Refinement: a Sequence of Examples.
[BibTeX]
Joseph M. Morris
Struct. Program., 1990

Temporal Predicat Transformers and Fair Termination.
[BibTeX]
[DOI]
Joseph M. Morris
Acta Informatica, 1990

1989
Well-founded induction and the invariance theorem for loops.
[BibTeX]
[DOI]
Joseph M. Morris
Inf. Process. Lett., 1989

Laws of Data Refinement.
[BibTeX]
[DOI]
Joseph M. Morris
Acta Informatica, 1989

1987
A Theoretical Basis for Stepwise Refinement and the Programming Calculus.
[BibTeX]
[DOI]
Joseph M. Morris
Sci. Comput. Program., 1987

Varieties of Weakest Liberal Preconditions.
[BibTeX]
[DOI]
Joseph M. Morris
Inf. Process. Lett., 1987

1981
The design of a language-directed editor for block-structured languages.
[BibTeX]
[DOI]
Joseph M. Morris
,
Mayer D. Schwartz
Proceedings of the ACM SIGPLAN SIGOA Symposium on Text Manipulation, 1981

1979
Traversing Binary Trees Simply and Cheaply.
[BibTeX]
[DOI]
Joseph M. Morris
Inf. Process. Lett., 1979

A Starvation-Free Solution to the Mutual Exclusion Problem.
[BibTeX]
[DOI]
Joseph M. Morris
Inf. Process. Lett., 1979


  Loading...