| 2008 |
| 53 | EE | Andrej Bauer,
Michael W. Mislove:
Preface.
Electr. Notes Theor. Comput. Sci. 218: 1-4 (2008) |
| 2007 |
| 52 | EE | Michael W. Mislove,
Dusko Pavlovic,
James Worrell:
Labelled Markov Processes as Generalised Stochastic Relations.
Electr. Notes Theor. Comput. Sci. 172: 459-478 (2007) |
| 51 | EE | Michael W. Mislove:
Editor's Note.
Electr. Notes Theor. Comput. Sci. 174(8): 1 (2007) |
| 50 | EE | Michael W. Mislove:
Discrete random variables over domains.
Theor. Comput. Sci. 380(1-2): 181-198 (2007) |
| 2006 |
| 49 | EE | Dusko Pavlovic,
Michael W. Mislove,
James Worrell:
Testing Semantics: Connecting Processes and Process Logics.
AMAST 2006: 308-322 |
| 48 | EE | Martín Hötzel Escardó,
Achim Jung,
Michael W. Mislove:
Preface.
Electr. Notes Theor. Comput. Sci. 155: 1-3 (2006) |
| 47 | EE | Steve Brookes,
Michael W. Mislove:
Preface.
Electr. Notes Theor. Comput. Sci. 158: 1-2 (2006) |
| 46 | EE | Michael W. Mislove:
On Combining Probability and Nondeterminism.
Electr. Notes Theor. Comput. Sci. 162: 261-265 (2006) |
| 45 | EE | Michael W. Mislove:
Monoids over domains.
Mathematical Structures in Computer Science 16(2): 255-277 (2006) |
| 44 | EE | Sergei N. Artëmov,
Michael W. Mislove:
Preface.
Theor. Comput. Sci. 357(1-3): 1-3 (2006) |
| 2005 |
| 43 | EE | Michael W. Mislove:
Discrete Random Variables over Domains.
ICALP 2005: 1006-1017 |
| 42 | EE | Franck van Breugel,
Michael W. Mislove,
Joël Ouaknine,
James Worrell:
Domain theory, testing and simulation for labelled Markov processes.
Theor. Comput. Sci. 333(1-2): 171-197 (2005) |
| 2004 |
| 41 | EE | Michael W. Mislove,
Joël Ouaknine,
Dusko Pavlovic,
James Worrell:
Duality for Labelled Markov Processes.
FoSSaCS 2004: 393-407 |
| 40 | EE | Michael W. Mislove:
Editorial.
Electr. Notes Theor. Comput. Sci. 100: 1- (2004) |
| 39 | EE | Michael W. Mislove,
Joël Ouaknine,
James Worrell:
Axioms for Probability and Nondeterminism.
Electr. Notes Theor. Comput. Sci. 96: 7-28 (2004) |
| 38 | EE | Paul Gastin,
Michael W. Mislove:
A simple process algebra based on atomic actions with resources.
Mathematical Structures in Computer Science 14(1): 1-55 (2004) |
| 37 | EE | Keye Martin,
Michael W. Mislove,
James Worrell:
Measuring the probabilistic powerdomain.
Theor. Comput. Sci. 312(1): 99-119 (2004) |
| 36 | EE | Michael W. Mislove:
Mathematical Foundations of Programming Semantics: Papers from MFPS 14 and MFPS 16.
Theor. Comput. Sci. 315(1): 1-2 (2004) |
| 2003 |
| 35 | EE | Franck van Breugel,
Michael W. Mislove,
Joël Ouaknine,
James Worrell:
An Intrinsic Characterization of Approximate Probabilistic Bisimilarity.
FoSSaCS 2003: 200-215 |
| 2002 |
| 34 | EE | Keye Martin,
Michael W. Mislove,
James Worrell:
Measuring the Probabilistic Powerdomain.
ICALP 2002: 463-475 |
| 33 | EE | Stephen D. Brookes,
Michael W. Mislove:
Foreword - MFPS 1996.
Theor. Comput. Sci. 278(1-2): 1-2 (2002) |
| 32 | EE | Stephen D. Brookes,
Michael W. Mislove:
Dedication.
Theor. Comput. Sci. 278(1-2): 23 (2002) |
| 31 | EE | Paul Gastin,
Michael W. Mislove:
A truly concurrent semantics for a process algebra using resource pomsets.
Theor. Comput. Sci. 281(1-2): 369-421 (2002) |
| 2001 |
| 30 | EE | Stephen D. Brookes,
Michael W. Mislove:
Preface.
Electr. Notes Theor. Comput. Sci. 45: (2001) |
| 29 | | Giorgio Ausiello,
Donald Sannella,
Michael W. Mislove:
25 Years.
Theor. Comput. Sci. 250(1-2): (2001) |
| 2000 |
| 28 | EE | Michael W. Mislove:
Nondeterminism and Probabilistic Choice: Obeying the Laws.
CONCUR 2000: 350-364 |
| 27 | EE | Michael W. Mislove:
Models Supporting Nondeterminism and Probabilistic Choice.
IPDPS Workshops 2000: 993-1000 |
| 26 | EE | Klaus Keimel,
Michael W. Mislove,
Constantine Tsinakis:
Modern Algebra - Foreword.
Theor. Comput. Sci. 249(1): 1 (2000) |
| 1999 |
| 25 | | Paul Gastin,
Michael W. Mislove:
A Truly Concurrent Semantics for a Simple Parallel Programming Language.
CSL 1999: 515-529 |
| 24 | | Michael W. Mislove:
Trace Theory and State Explosion.
PDPTA 1999: 288-294 |
| 23 | EE | Michael W. Mislove:
Local Dcpos, Local Cpos and Local Completions.
Electr. Notes Theor. Comput. Sci. 20: (1999) |
| 22 | EE | Stephen D. Brookes,
Achim Jung,
Michael W. Mislove,
Andre Scedrov:
Preface.
Electr. Notes Theor. Comput. Sci. 20: (1999) |
| 1998 |
| 21 | EE | Michael W. Mislove:
Generalizing Domain Theory.
FoSSaCS 1998: 1-19 |
| 20 | EE | Rance Cleaveland,
Michael W. Mislove,
Philip S. Mulry:
Preface.
Electr. Notes Theor. Comput. Sci. 14: (1998) |
| 1997 |
| 19 | EE | Stephen D. Brookes,
Michael G. Main,
Austin Melton,
Michael W. Mislove:
Foreword.
Electr. Notes Theor. Comput. Sci. 6: (1997) |
| 18 | EE | Michael W. Mislove:
Using duality to solve domain equations.
Electr. Notes Theor. Comput. Sci. 6: (1997) |
| 1995 |
| 17 | EE | Michael W. Mislove:
Denotational models for unbounded nondeterminism.
Electr. Notes Theor. Comput. Sci. 1: (1995) |
| 16 | EE | Stephen D. Brookes,
Michael G. Main,
Austin Melton,
Michael W. Mislove:
Foreword and Dedication.
Electr. Notes Theor. Comput. Sci. 1: (1995) |
| 15 | | Karl Heinz Hofmann,
Michael W. Mislove:
All Compact Hausdorff Lambda Models are Degenerate.
Fundam. Inform. 22(1/2): 23-52 (1995) |
| 14 | | Michael W. Mislove,
Frank J. Oles:
Adjunctions Between Categories of Domains.
Fundam. Inform. 22(1/2): 93-116 (1995) |
| 13 | EE | Michael W. Mislove,
A. W. Roscoe,
Steve Schneider:
Fixed Points Without Completeness.
Theor. Comput. Sci. 138(2): 273-314 (1995) |
| 12 | EE | Michael W. Mislove,
Frank J. Oles:
Full Abstraction and Recursion.
Theor. Comput. Sci. 151(1): 207-256 (1995) |
| 1994 |
| 11 | | Stephen D. Brookes,
Michael G. Main,
Austin Melton,
Michael W. Mislove,
David A. Schmidt:
Mathematical Foundations of Programming Semantics, 9th International Conference, New Orleans, LA, USA, April 7-10, 1993, Proceedings
Springer 1994 |
| 1992 |
| 10 | | Stephen D. Brookes,
Michael G. Main,
Austin Melton,
Michael W. Mislove,
David A. Schmidt:
Mathematical Foundations of Programming Semantics, 7th International Conference, Pittsburgh, PA, USA, March 25-28, 1991, Proceedings
Springer 1992 |
| 9 | | Michael W. Mislove,
Frank J. Oles:
Full Abstraction and Unnested Recursion.
REX Workshop 1992: 384-397 |
| 1991 |
| 8 | | Michael W. Mislove,
Frank J. Oles:
A Simple Language Supporting Angelic Nondeterminism and Parallel Composition.
MFPS 1991: 77-101 |
| 7 | | Michael W. Mislove,
Lawrence S. Moss,
Frank J. Oles:
Non-Well-Founded Sets Modeled as Ideal Fixed Points
Inf. Comput. 93(1): 16-54 (1991) |
| 1990 |
| 6 | | Michael G. Main,
Austin Melton,
Michael W. Mislove,
David A. Schmidt:
Mathematical Foundations of Programming Semantics, 5th International Conference, Tulane University, New Orleans, Louisiana, USA, March 29 - April 1, 1989, Proceedings
Springer 1990 |
| 1989 |
| 5 | | Michael W. Mislove,
Lawrence S. Moss,
Frank J. Oles:
Non-Well-Founded Sets Obtained from Ideal Fixed Points
LICS 1989: 263-272 |
| 1988 |
| 4 | | Michael G. Main,
Austin Melton,
Michael W. Mislove,
David A. Schmidt:
Mathematical Foundations of Programming Language Semantics, 3rd Workshop, Tulane University, New Orleans, Louisiana, USA, April 8-10, 1987, Proceedings
Springer 1988 |
| 1987 |
| 3 | | Michael W. Mislove:
On the Smyth Power Domain.
MFPS 1987: 161-172 |
| 2 | EE | Jimmie D. Lawson,
Michael W. Mislove,
Hilary A. Priestley:
Ordered sets with no infinite antichains.
Discrete Mathematics 63(2-3): 225-230 (1987) |
| 1985 |
| 1 | | Michael W. Mislove:
Detecting Local Finite Breadth in Continuous Lattices and Semilattices.
Mathematical Foundations of Programming Semantics 1985: 205-214 |