Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Michael W. Mislove
2010 – today
- 2013
[j42]Ed Blakey, Bob Coecke, Michael W. Mislove, Dusko Pavlovic: Information Security as a Resource. Inf. Comput. 226: 1-2 (2013)- 2012
[j41]Stephen D. Brookes, Achim Jung, Catherine Meadows, Michael W. Mislove, Prakash Panangaden: Dedication. Electr. Notes Theor. Comput. Sci. 286: 3 (2012)
[j40]Samson Abramsky, Michael W. Mislove, Catuscia Palamidessi: Preface. Theor. Comput. Sci. 430: 1-2 (2012)
[i1]Samson Abramsky, Jean Krivine, Michael W. Mislove: Information Flow and Its Applications (Dagstuhl Seminar 12352). Dagstuhl Reports 2(8): 99-112 (2012)- 2011
[j39]
[c17]- 2010
[j38]
[j37]
[c16]Aaron D. Jaggard, Catherine Meadows, Michael W. Mislove, Roberto Segala: Reasoning about Probabilistic Security Using Task-PIOAs. ARSPA-WITS 2010: 2-22
2000 – 2009
- 2009
[j36]Samson Abramsky, Michael W. Mislove, Catuscia Palamidessi: Preface. Electr. Notes Theor. Comput. Sci. 249: 1-2 (2009)- 2008
[j35]- 2007
[j34]Michael W. Mislove, Dusko Pavlovic, James Worrell: Labelled Markov Processes as Generalised Stochastic Relations. Electr. Notes Theor. Comput. Sci. 172: 459-478 (2007)
[j33]
[j32]Michael W. Mislove: Discrete random variables over domains. Theor. Comput. Sci. 380(1-2): 181-198 (2007)- 2006
[j31]Martín Hötzel Escardó, Achim Jung, Michael W. Mislove: Preface. Electr. Notes Theor. Comput. Sci. 155: 1-3 (2006)
[j30]
[j29]Michael W. Mislove: On Combining Probability and Nondeterminism. Electr. Notes Theor. Comput. Sci. 162: 261-265 (2006)
[j28]Michael W. Mislove: Monoids over domains. Mathematical Structures in Computer Science 16(2): 255-277 (2006)
[j27]
[c15]Dusko Pavlovic, Michael W. Mislove, James Worrell: Testing Semantics: Connecting Processes and Process Logics. AMAST 2006: 308-322- 2005
[j26]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)
[c14]- 2004
[j25]Michael W. Mislove, Joël Ouaknine, James Worrell: Axioms for Probability and Nondeterminism. Electr. Notes Theor. Comput. Sci. 96: 7-28 (2004)
[j24]
[j23]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)
[j22]Keye Martin, Michael W. Mislove, James Worrell: Measuring the probabilistic powerdomain. Theor. Comput. Sci. 312(1): 99-119 (2004)
[j21]Michael W. Mislove: Mathematical Foundations of Programming Semantics: Papers from MFPS 14 and MFPS 16. Theor. Comput. Sci. 315(1): 1-2 (2004)
[c13]Michael W. Mislove, Joël Ouaknine, Dusko Pavlovic, James Worrell: Duality for Labelled Markov Processes. FoSSaCS 2004: 393-407- 2003
[c12]Franck van Breugel, Michael W. Mislove, Joël Ouaknine, James Worrell: An Intrinsic Characterization of Approximate Probabilistic Bisimilarity. FoSSaCS 2003: 200-215- 2002
[j20]Stephen D. Brookes, Michael W. Mislove: Foreword - MFPS 1996. Theor. Comput. Sci. 278(1-2): 1-2 (2002)
[j19]
[j18]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)
[c11]Keye Martin, Michael W. Mislove, James Worrell: Measuring the Probabilistic Powerdomain. ICALP 2002: 463-475- 2001
[j17]Stephen D. Brookes, Michael W. Mislove: Preface. Electr. Notes Theor. Comput. Sci. 45: 463-464 (2001)
[j16]Giorgio Ausiello, Donald Sannella, Michael W. Mislove: 25 Years. Theor. Comput. Sci. 250(1-2) (2001)- 2000
[j15]Michael W. Mislove: Semantic models for concurrency. ACM SIGSOFT Software Engineering Notes 25(1): 65-66 (2000)
[j14]Klaus Keimel, Michael W. Mislove, Constantine Tsinakis: Modern Algebra - Foreword. Theor. Comput. Sci. 249(1): 1 (2000)
[c10]
[c9]Michael W. Mislove: Models Supporting Nondeterminism and Probabilistic Choice. IPDPS Workshops 2000: 993-1000
1990 – 1999
- 1999
[j13]Michael W. Mislove: Local Dcpos, Local Cpos and Local Completions. Electr. Notes Theor. Comput. Sci. 20: 399-412 (1999)
[j12]Stephen D. Brookes, Achim Jung, Michael W. Mislove, Andre Scedrov: Preface. Electr. Notes Theor. Comput. Sci. 20: 512-513 (1999)
[c8]Paul Gastin, Michael W. Mislove: A Truly Concurrent Semantics for a Simple Parallel Programming Language. CSL 1999: 515-529
[c7]- 1998
[j11]Rance Cleaveland, Michael W. Mislove, Philip S. Mulry: Preface. Electr. Notes Theor. Comput. Sci. 14: 1-2 (1998)
[c6]- 1997
[j10]Stephen D. Brookes, Michael G. Main, Austin Melton, Michael W. Mislove: Foreword. Electr. Notes Theor. Comput. Sci. 6: 1-2 (1997)
[j9]Michael W. Mislove: Using duality to solve domain equations. Electr. Notes Theor. Comput. Sci. 6: 255-271 (1997)- 1995
[j8]Michael W. Mislove: Denotational models for unbounded nondeterminism. Electr. Notes Theor. Comput. Sci. 1: 393-410 (1995)
[j7]Stephen D. Brookes, Michael G. Main, Austin Melton, Michael W. Mislove: Foreword and Dedication. Electr. Notes Theor. Comput. Sci. 1: 557-558 (1995)
[j6]Karl Heinz Hofmann, Michael W. Mislove: All Compact Hausdorff Lambda Models are Degenerate. Fundam. Inform. 22(1/2): 23-52 (1995)
[j5]Michael W. Mislove, Frank J. Oles: Adjunctions Between Categories of Domains. Fundam. Inform. 22(1/2): 93-116 (1995)
[j4]Michael W. Mislove, A. W. Roscoe, Steve Schneider: Fixed Points Without Completeness. Theor. Comput. Sci. 138(2): 273-314 (1995)
[j3]Michael W. Mislove, Frank J. Oles: Full Abstraction and Recursion. Theor. Comput. Sci. 151(1): 207-256 (1995)- 1994
[e4]Stephen D. Brookes, Michael G. Main, Austin Melton, Michael W. Mislove, David A. Schmidt (Eds.): Mathematical Foundations of Programming Semantics, 9th International Conference, New Orleans, LA, USA, April 7-10, 1993, Proceedings. Lecture Notes in Computer Science 802, Springer 1994, ISBN 3-540-58027-1- 1992
[c5]Michael W. Mislove, Frank J. Oles: Full Abstraction and Unnested Recursion. REX Workshop 1992: 384-397
[e3]Stephen D. Brookes, Michael G. Main, Austin Melton, Michael W. Mislove, David A. Schmidt (Eds.): Mathematical Foundations of Programming Semantics, 7th International Conference, Pittsburgh, PA, USA, March 25-28, 1991, Proceedings. Lecture Notes in Computer Science 598, Springer 1992, ISBN 3-540-55511-0- 1991
[j2]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)
[c4]Michael W. Mislove, Frank J. Oles: A Simple Language Supporting Angelic Nondeterminism and Parallel Composition. MFPS 1991: 77-101- 1990
[e2]Michael G. Main, Austin Melton, Michael W. Mislove, David A. Schmidt (Eds.): Mathematical Foundations of Programming Semantics, 5th International Conference, Tulane University, New Orleans, Louisiana, USA, March 29 - April 1, 1989, Proceedings. Lecture Notes in Computer Science 442, Springer 1990, ISBN 3-540-97375-3
1980 – 1989
- 1989
[c3]Michael W. Mislove, Lawrence S. Moss, Frank J. Oles: Non-Well-Founded Sets Obtained from Ideal Fixed Points. LICS 1989: 263-272- 1988
[e1]Michael G. Main, Austin Melton, Michael W. Mislove, David A. Schmidt (Eds.): Mathematical Foundations of Programming Language Semantics, 3rd Workshop, Tulane University, New Orleans, Louisiana, USA, April 8-10, 1987, Proceedings. Lecture Notes in Computer Science 298, Springer 1988, ISBN 3-540-19020-1- 1987
[j1]Jimmie D. Lawson, Michael W. Mislove, Hilary A. Priestley: Ordered sets with no infinite antichains. Discrete Mathematics 63(2-3): 225-230 (1987)
[c2]- 1985
[c1]Michael W. Mislove: Detecting Local Finite Breadth in Continuous Lattices and Semilattices. Mathematical Foundations of Programming Semantics 1985: 205-214- 1980
[b1]Gerhard Gierz, Karl Heinrich Hofmann, Klaus Keimel, Jimmie D. Lawson, Michael W. Mislove: A compendium of continous lattices. Springer 1980, ISBN 978-3-540-10111-6, pp. I-XX, 1-371
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-04-24 23:07 CEST by the dblp team



