Joseph M. Morris

According to our database1, Joseph M. Morris
  • authored at least 23 papers between 1979 and 2009.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2009
Term transformers: A new approach to state.
ACM Trans. Program. Lang. Syst., 2009

2008
Dually nondeterministic functions.
ACM Trans. Program. Lang. Syst., 2008

Modelling higher-order dual nondeterminacy.
Acta Inf., 2008

2007
Terms with unbounded demonic and angelic nondeterminacy.
Sci. Comput. Program., 2007

Dual unbounded nondeterminacy, recursion, and fixpoints.
Acta Inf., 2007

Plug-and-Play Nondeterminacy.
Proceedings of the B 2007: Formal Specification and Development in B, 2007

2006
A Lattice-Theoretic Model for an Algebra of Communicating Sequential Processes.
Proceedings of the Theoretical Aspects of Computing, 2006

2005
Software Refinement with Perfect Developer.
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.
Proceedings of the Mathematics of Program Construction, 7th International Conference, 2004

2002
A source of inconsistency in theories of nondeterministic functions.
Sci. Comput. Program., 2002

2001
A theory of bunches.
Acta Inf., 2001

1999
Specificational functions.
ACM Trans. Program. Lang. Syst., 1999

A Logic for Reasoning Equationally in the Presence of Partiality.
Sci. Comput. Program., 1999

1998
Partiality and Nondeterminacy in Program Proofs.
Formal Asp. Comput., 1998

1997
Non-Deterministic Expressions and Predicate Transformers.
Inf. Process. Lett., 1997

1990
Programming by Expression Refinement: a Sequence of Examples.
Structured Programming, 1990

Temporal Predicat Transformers and Fair Termination.
Acta Inf., 1990

1989
Well-founded induction and the invariance theorem for loops.
Inf. Process. Lett., 1989

Laws of Data Refinement.
Acta Inf., 1989

1987
A Theoretical Basis for Stepwise Refinement and the Programming Calculus.
Sci. Comput. Program., 1987

Varieties of Weakest Liberal Preconditions.
Inf. Process. Lett., 1987

1979
Traversing Binary Trees Simply and Cheaply.
Inf. Process. Lett., 1979

A Starvation-Free Solution to the Mutual Exclusion Problem.
Inf. Process. Lett., 1979


  Loading...