Uwe Nestmann
Uwe Nestmann
Professor of Computer Science, TU Berlin
Verified email at tu-berlin.de - Homepage
Title
Cited by
Cited by
Year
What is a “good” encoding of guarded choice?
U Nestmann
Information and computation 156 (1-2), 287-319, 2000
1432000
Decoding choice encodings
U Nestmann, BC Pierce
International Conference on Concurrency Theory, 179-194, 1996
1321996
Decoding choice encodings
U Nestmann, BC Pierce
Information and Computation 163 (1), 1-59, 2000
1112000
Symbolic bisimulation in the spi calculus
J Borgström, S Briais, U Nestmann
International Conference on Concurrency Theory, 161-176, 2004
662004
On Bisimulations for the Spi Calculus*
J Borgström, U Nestmann
International Conference on Algebraic Methodology and Software Technology …, 2002
612002
Modeling consensus in a process calculus
U Nestmann, R Fuzzati, M Merro
International Conference on Concurrency Theory, 399-414, 2003
582003
A formal semantics for protocol narrations
S Briais, U Nestmann
Theoretical Computer Science 389 (3), 484-511, 2007
332007
Full abstraction for expressiveness: history, myths and facts
D Gorla, U Nestmann
Mathematical Structures in Computer Science 26 (4), 639-654, 2016
322016
On distributability in process calculi
K Peters, U Nestmann, U Goltz
European Symposium on Programming, 310-329, 2013
312013
On determinacy and nondeterminacy in concurrent programming
U Nestmann
Inst. für Math. Maschinen und Datenverarbeitung (Informatik), 1996
301996
Verifying a structured peer-to-peer overlay network: The static case
J Borgström, U Nestmann, L Onana, D Gurov
International Workshop on Global Computing, 250-265, 2004
292004
Formal verification of distributed algorithms
P Küfner, U Nestmann, C Rickmann
IFIP International Conference on Theoretical Computer Science, 209-224, 2012
272012
Is it a “good” encoding of mixed choice?
K Peters, U Nestmann
International Conference on Foundations of Software Science and …, 2012
272012
On the expressive power of joint input
U Nestmann
Electronic Notes in Theoretical Computer Science 16 (2), 145-152, 1998
251998
Welcome to the jungle: A subjective guide to mobile process calculi
U Nestmann
International Conference on Concurrency Theory, 52-63, 2006
242006
Mobile objects as mobile processes
M Merro, J Kleist, U Nestmann
Information and Computation 177 (2), 195-241, 2002
242002
Typing confluence
U Nestmann, M Steffen
In Second International ERCIM Workshop on Formal Methods in Industrial …, 1997
241997
Synchrony vs causality in the asynchronous pi-calculus
K Peters, JW Schicke, U Nestmann
arXiv preprint arXiv:1108.4469, 2011
212011
Unreliable failure detectors via operational semantics
U Nestmann, R Fuzzati
Annual Asian Computing Science Conference, 54-71, 2003
202003
Dynamic causality in event structures
Y Arbach, D Karcher, K Peters, U Nestmann
International Conference on Formal Techniques for Distributed Objects …, 2015
162015
The system can't perform the operation now. Try again later.
Articles 1–20