Seguir
Uwe Nestmann
Uwe Nestmann
Professor of Computer Science, TU Berlin
Dirección de correo verificada de tu-berlin.de - Página principal
Título
Citado por
Citado por
Año
What is a “good” encoding of guarded choice?
U Nestmann
Information and computation 156 (1-2), 287-319, 2000
1582000
Decoding choice encodings
U Nestmann, BC Pierce
International Conference on Concurrency Theory, 179-194, 1996
1401996
Decoding choice encodings
U Nestmann, BC Pierce
Information and Computation 163 (1), 1-59, 2000
1152000
Symbolic bisimulation in the spi calculus
J Borgström, S Briais, U Nestmann
International Conference on Concurrency Theory, 161-176, 2004
712004
On Bisimulations for the Spi Calculus*
J Borgström, U Nestmann
International Conference on Algebraic Methodology and Software Technology …, 2002
682002
Modeling consensus in a process calculus
U Nestmann, R Fuzzati, M Merro
International Conference on Concurrency Theory, 399-414, 2003
612003
Full abstraction for expressiveness: history, myths and facts
D Gorla, U Nestmann
Mathematical Structures in Computer Science 26 (4), 639-654, 2016
532016
Formal verification of distributed algorithms: From pseudo code to checked proofs
P Küfner, U Nestmann, C Rickmann
Theoretical Computer Science: 7th IFIP TC 1/WG 2.2 International Conference …, 2012
452012
On distributability in process calculi
K Peters, U Nestmann, U Goltz
European Symposium on Programming, 310-329, 2013
432013
Is it a “good” encoding of mixed choice?
K Peters, U Nestmann
International Conference on Foundations of Software Science and …, 2012
352012
A formal semantics for protocol narrations
S Briais, U Nestmann
Theoretical Computer Science 389 (3), 484-511, 2007
352007
Welcome to the jungle: A subjective guide to mobile process calculi
U Nestmann
International Conference on Concurrency Theory, 52-63, 2006
332006
On determinacy and nondeterminacy in concurrent programming
U Nestmann
Inst. für Math. Maschinen und Datenverarbeitung (Informatik), 1996
331996
Dynamic causality in event structures
Y Arbach, DS Karcher, K Peters, U Nestmann
Logical Methods in Computer Science 14, 2018
302018
Verifying a structured peer-to-peer overlay network: The static case
J Borgström, U Nestmann, L Onana, D Gurov
Global Computing: IST/FET International Workshop, GC 2004 Rovereto, Italy …, 2005
302005
On the expressive power of joint input
U Nestmann
Electronic Notes in Theoretical Computer Science 16 (2), 145-152, 1998
291998
Typing confluence
U Nestmann, M Steffen
In Second International ERCIM Workshop on Formal Methods in Industrial …, 1997
261997
Synchrony vs causality in the asynchronous pi-calculus
K Peters, JW Schicke, U Nestmann
arXiv preprint arXiv:1108.4469, 2011
242011
Session types for link failures
M Adameit, K Peters, U Nestmann
Formal Techniques for Distributed Objects, Components, and Systems: 37th …, 2017
232017
Unreliable failure detectors via operational semantics
U Nestmann, R Fuzzati
Annual Asian Computing Science Conference, 54-71, 2003
232003
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20