default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDUwe Nestmann
Person information
- affiliation: TU Berlin, Faculty of Electrical Engineering and Computer Science, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j25]Kirstin Peters, Uwe Nestmann, Christoph Wagner:
FTMPST: Fault-Tolerant Multiparty Session Types. Log. Methods Comput. Sci. 19(4) (2023)- [c57]Nadine Karsten
, Uwe Nestmann:
Store Locally, Prove Globally. ICTAC 2023: 351-369 - [c56]Nadine Karsten, Frederik Krogsdal Jacobsen, Kim Jana Eiken, Uwe Nestmann, Jørgen Villadsen:
ProofBuddy: A Proof Assistant for Learning and Monitoring. TFPIE 2023: 1-21 - 2022
- [j24]Benjamin Bisping, David N. Jansen, Uwe Nestmann:
Deciding All Behavioral Equivalences at Once: A Game for Linear-Time-Branching-Time Spectroscopy. Log. Methods Comput. Sci. 18(3) (2022) - [j23]Kirstin Peters, Uwe Nestmann, Anna Schmitt:
On distributability. Theor. Comput. Sci. 913: 151-173 (2022) - [c55]Nadine Karsten, Uwe Nestmann:
Beweiskompetenz durch Beweisassistenz. DELFI 2022: 227-228 - [c54]Kirstin Peters, Uwe Nestmann, Christoph Wagner:
Fault-Tolerant Multiparty Session Types. FORTE 2022: 93-113 - [i12]Kirstin Peters, Uwe Nestmann, Christoph Wagner:
Fault-Tolerant Multiparty Session Types (Technical Report). CoRR abs/2204.07728 (2022) - 2021
- [c53]Benjamin Bisping, Uwe Nestmann:
A Game for Linear-time-Branching-time Spectroscopy. TACAS (1) 2021: 3-19 - [i11]Benjamin Bisping, Uwe Nestmann:
Deciding All Behavioral Equivalences at Once: A Game for Linear-time-Branching-time Spectroscopy. CoRR abs/2109.15295 (2021) - 2020
- [j22]Benjamin Bisping, Uwe Nestmann, Kirstin Peters:
Coupled similarity: the first 32 years. Acta Informatica 57(3-5): 439-463 (2020) - [j21]Kirstin Peters, Uwe Nestmann:
Distributability of mobile ambients. Inf. Comput. 275: 104608 (2020) - [c52]Florian Kammüller, Uwe Nestmann:
Inter-Blockchain Protocols with the Isabelle Infrastructure Framework. FMBC@CAV 2020: 11:1-11:12
2010 – 2019
- 2019
- [c51]Kirstin Peters, Christoph Wagner, Uwe Nestmann:
Taming Concurrency for Verification Using Multiparty Session Types. ICTAC 2019: 196-215 - [c50]Benjamin Bisping, Uwe Nestmann:
Computing Coupled Similarity. TACAS (1) 2019: 244-261 - [i10]Kirstin Peters, Christoph Wagner, Uwe Nestmann:
Taming Concurrency for Verification Using Multiparty Session Types (Technical Report). CoRR abs/1908.06510 (2019) - 2018
- [j20]Youssef Arbach, David S. Karcher, Kirstin Peters, Uwe Nestmann:
Dynamic Causality in Event Structures. Log. Methods Comput. Sci. 14(1) (2018) - [c49]Alexander Wolf, Arno Wilhelm-Weidner, Uwe Nestmann:
A case study of flipped classroom for automata theory in secondary education. WiPSCE 2018: 23:1-23:6 - [c48]Kirstin Peters, Uwe Nestmann:
On the Distributability of Mobile Ambients. EXPRESS/SOS 2018: 104-121 - [i9]Youssef Arbach, David S. Karcher, Kirstin Peters, Uwe Nestmann:
Dynamic Causality in Event Structures. CoRR abs/1801.02857 (2018) - [i8]Kirstin Peters, Uwe Nestmann:
On the Distributability of Mobile Ambients (Technical Report). CoRR abs/1808.01599 (2018) - 2017
- [c47]Manuel Adameit, Kirstin Peters, Uwe Nestmann:
Session Types for Link Failures. FORTE 2017: 1-16 - [e5]Roland Meyer, Uwe Nestmann:
28th International Conference on Concurrency Theory, CONCUR 2017, September 5-8, 2017, Berlin, Germany. LIPIcs 85, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2017, ISBN 978-3-95977-048-4 [contents] - 2016
- [j19]Benjamin Bisping, Paul-David Brodmann, Tim Jungnickel, Christina Rickmann, Henning Seidler, Anke Stüber, Arno Wilhelm-Weidner, Kirstin Peters, Uwe Nestmann:
A Constructive Proof for FLP. Arch. Formal Proofs 2016 (2016) - [j18]Anne-Kathrin Schmuck, Sven Schneider, Jörg Raisch, Uwe Nestmann:
Supervisory control synthesis for deterministic context free specification languages - Enforcing controllability least restrictively. Discret. Event Dyn. Syst. 26(1): 5-32 (2016) - [j17]Daniele Gorla, Uwe Nestmann:
Full abstraction for expressiveness: history, myths and facts. Math. Struct. Comput. Sci. 26(4): 639-654 (2016) - [j16]Kirstin Peters, Uwe Nestmann:
Breaking symmetries. Math. Struct. Comput. Sci. 26(6): 1054-1106 (2016) - [j15]Kirstin Peters, Jens-Wolfhard Schicke-Uffmann, Ursula Goltz, Uwe Nestmann:
Synchrony versus causality in distributed systems. Math. Struct. Comput. Sci. 26(8): 1459-1498 (2016) - [c46]Christina Rickmann, Christoph Wagner, Uwe Nestmann, Stefan Schmid:
Topological Self-Stabilization with Name-Passing Process Calculi. CONCUR 2016: 19:1-19:15 - [c45]Benjamin Bisping, Paul-David Brodmann, Tim Jungnickel, Christina Rickmann, Henning Seidler, Anke Stüber, Arno Wilhelm-Weidner, Kirstin Peters, Uwe Nestmann:
Mechanical Verification of a Constructive Proof for FLP. ITP 2016: 107-122 - [i7]Manuel Adameit, Kirstin Peters, Uwe Nestmann:
Session Types for Link Failures (Technical Report). CoRR abs/1607.07286 (2016) - 2015
- [c44]Youssef Arbach, David Karcher, Kirstin Peters, Uwe Nestmann:
Dynamic Causality in Event Structures. FORTE 2015: 83-97 - [c43]David S. Karcher, Uwe Nestmann:
Higher-Order Dynamics in Event Structures. ICTAC 2015: 258-271 - [c42]Meike Hatzel, Christoph Wagner, Kirstin Peters, Uwe Nestmann:
Encoding CSP into CCS. EXPRESS/SOS 2015: 61-75 - [i6]Youssef Arbach, David Karcher, Kirstin Peters, Uwe Nestmann:
Dynamic Causality in Event Structures (Technical Report). CoRR abs/1504.00512 (2015) - [i5]Meike Hatzel, Christoph Wagner, Kirstin Peters, Uwe Nestmann:
Encoding CSP into CCS (Extended Version). CoRR abs/1508.01127 (2015) - 2014
- [c41]Sven Schneider, Anne-Kathrin Schmuck, Uwe Nestmann, Jörg Raisch:
Reducing an Operational Supervisory Control Problem by Decomposition for Deterministic Pushdown Automata. WODES 2014: 214-221 - [c40]Anne-Kathrin Schmuck, Sven Schneider, Jörg Raisch, Uwe Nestmann:
Extending Supervisory Controller Synthesis to Deterministic Pushdown Automata - Enforcing Controllability Least Restrictively. WODES 2014: 286-293 - [c39]Kirstin Peters, Tsvetelina Yonova-Karbe, Uwe Nestmann:
Matching in the Pi-Calculus. EXPRESS/SOS 2014: 16-29 - [c38]Christoph Wagner, Uwe Nestmann:
States in Process Calculi. EXPRESS/SOS 2014: 48-62 - [i4]Sven Schneider, Uwe Nestmann:
Enforcing Operational Properties including Blockfreeness for Deterministic Pushdown Automata. CoRR abs/1403.5081 (2014) - [i3]Kirstin Peters, Tsvetelina Yonova-Karbe, Uwe Nestmann:
Matching in the Pi-Calculus (Technical Report). CoRR abs/1407.6406 (2014) - 2013
- [c37]Kirstin Peters, Uwe Nestmann, Ursula Goltz:
On Distributability in Process Calculi. ESOP 2013: 310-329 - [c36]Youssef Arbach, Kirstin Peters, Uwe Nestmann:
Adding Priority to Event Structures. EXPRESS/SOS 2013: 17-31 - 2012
- [c35]Kirstin Peters, Uwe Nestmann:
Is It a "Good" Encoding of Mixed Choice? FoSSaCS 2012: 210-224 - [c34]Philipp Küfner, Uwe Nestmann, Christina Rickmann:
Formal Verification of Distributed Algorithms - From Pseudo Code to Checked Proofs. IFIP TCS 2012: 209-224 - [i2]Kirstin Peters, Uwe Nestmann:
Is it a "Good" Encoding of Mixed Choice? (Technical Report). CoRR abs/1201.1410 (2012) - 2011
- [c33]Sven Schneider, Uwe Nestmann:
Rigorous Discretization of Hybrid Systems Using Process Calculi. FORMATS 2011: 301-316 - [c32]Sven Abels, Stefan Brüggemann, Matthias Mertens, Uwe Nestmann, Joannis Vlachakis:
Vorwort. GI-Jahrestagung 2011: 395-396 - [c31]Hannes Lau, Uwe Nestmann:
Java Goes TLA+. TASE 2011: 117-124 - [c30]Kirstin Peters, Jens-Wolfhard Schicke, Uwe Nestmann:
Synchrony vs Causality in the Asynchronous Pi-Calculus. EXPRESS 2011: 89-103 - 2010
- [c29]Nadim Sarrouh, Oliver Blankenstein, Uwe Nestmann:
Service-Orientierte Unterstützung des nationalen Früherkennungsprogramms für Kinder. GI Jahrestagung (1) 2010: 229-234 - [c28]Nadim Sarrouh, Florian Eilers, Uwe Nestmann, Ina Schieferdecker:
Defamation-Free Networks through User-Centered Data Control. STM 2010: 179-193 - [c27]Kirstin Peters, Uwe Nestmann:
Breaking Symmetries. EXPRESS 2010: 136-150 - [i1]Kirstin Peters, Uwe Nestmann:
Breaking Symmetries. CoRR abs/1007.4172 (2010)
2000 – 2009
- 2009
- [j14]Luca Aceto, Jos C. M. Baeten, Wan J. Fokkink, Anna Ingólfsdóttir, Uwe Nestmann:
Preface. J. Log. Algebraic Methods Program. 78(4) (2009) - [c26]Morten Kühnrich, Uwe Nestmann:
On Process-Algebraic Proof Methods for Fault Tolerant Distributed Systems. FMOODS/FORTE 2009: 198-212 - [c25]Florian Eilers, Uwe Nestmann:
Deriving Trust from Experience. Formal Aspects in Security and Trust 2009: 36-50 - 2008
- [j13]Luca Aceto, Jos C. M. Baeten, Wan J. Fokkink, Anna Ingólfsdóttir, Uwe Nestmann:
Applying Concurrency Research in Industry Report on a Strategic Workshop. Bull. EATCS 94: 113-129 (2008) - [c24]Sven Schneider, Johannes Borgström, Uwe Nestmann:
Towards the Application of Process Calculi in the Domain of Peer-to-Peer Algorithms. SJTU-TUB Joint Workshop 2008: 97-104 - 2007
- [j12]Rachele Fuzzati, Massimo Merro, Uwe Nestmann:
Distributed Consensus, revisited. Acta Informatica 44(6): 377-425 (2007) - [j11]Sébastien Briais, Uwe Nestmann:
Open bisimulation, revisited. Theor. Comput. Sci. 386(3): 236-271 (2007) - [j10]Sébastien Briais, Uwe Nestmann:
A formal semantics for protocol narrations. Theor. Comput. Sci. 389(3): 484-511 (2007) - 2006
- [c23]Uwe Nestmann:
Welcome to the Jungle: A Subjective Guide to Mobile Process Calculi. CONCUR 2006: 52-63 - [c22]Daniel C. Bünzli, Rachele Fuzzati, Sergio Mena, Uwe Nestmann, Olivier Rütti, André Schiper, Pawel T. Wojciechowski:
Advances in the Design and Implementation of Group Communication Middleware. Research Results of the DICS Program 2006: 172-194 - 2005
- [j9]Uwe Nestmann, Björn Victor:
Guest editors' introduction: Special issue on The pi-calculus. J. Log. Algebraic Methods Program. 63(1): 1-2 (2005) - [j8]Johannes Borgström, Uwe Nestmann:
On bisimulations for the spi calculus. Math. Struct. Comput. Sci. 15(3): 487-552 (2005) - [j7]Flavio Corradini, Uwe Nestmann:
EDITORIAL: Selected papers of the tenth international workshop on expressiveness in concurrency (EXPRESS 2003). Theor. Comput. Sci. 330(3): 375-376 (2005) - [c21]Daniel C. Bünzli, Sergio Mena, Uwe Nestmann:
Protocol Composition Frameworks A Header-Driven Model. NCA 2005: 243-246 - [c20]Sébastien Briais, Uwe Nestmann:
A Formal Semantics for Protocol Narrations. TGC 2005: 163-181 - [c19]Sébastien Briais, Uwe Nestmann:
Open Bisimulation, Revisited. EXPRESS 2005: 109-123 - [c18]Rachele Fuzzati, Uwe Nestmann:
Much Ado About Nothing? APC 25 2005: 167-171 - 2004
- [c17]Johannes Borgström, Sébastien Briais, Uwe Nestmann:
Symbolic Bisimulation in the Spi Calculus. CONCUR 2004: 161-176 - [c16]Johannes Borgström, Uwe Nestmann, Luc Onana Alima, Dilian Gurov:
Verifying a Structured Peer-to-Peer Overlay Network: The Static Case. Global Computing 2004: 250-265 - [e4]Flavio Corradini, Uwe Nestmann:
Proceedings of the 10th International Workshop on Expressiveness in Concurrency, EXPRESS 2003, Marseille, France, September 2, 2003. Electronic Notes in Theoretical Computer Science 96, Elsevier 2004 [contents] - 2003
- [j6]Uwe Nestmann, Prakash Panangaden:
Guest Editors' Foreword. Nord. J. Comput. 10(2): 69 (2003) - [c15]Uwe Nestmann, Rachele Fuzzati:
Unreliable Failure Detectors via Operational Semantics. ASIAN 2003: 54-71 - [c14]Uwe Nestmann, Rachele Fuzzati, Massimo Merro:
Modeling Consensus in a Process Calculus. CONCUR 2003: 393-407 - [c13]Flavio Corradini, Uwe Nestmann:
Foreword: Proceedings of the 10th International Workshop on Expressiveness in Concurrency. EXPRESS 2003: 1-3 - [e3]Elie Najm, Uwe Nestmann, Perdita Stevens:
Formal Methods for Open Object-Based Distributed Systems, 6th IFIP WG 6.1 International Conference, FMOODS 2003, Paris, France, November 19.21, 2003, Proceedings. Lecture Notes in Computer Science 2884, Springer 2003, ISBN 3-540-20491-1 [contents] - 2002
- [j5]Uwe Nestmann, Hans Hüttel, Josva Kleist, Massimo Merro:
Aliasing Models for Mobile Objects. Inf. Comput. 175(1): 3-33 (2002) - [j4]Massimo Merro, Josva Kleist, Uwe Nestmann:
Mobile Objects as Mobile Processes. Inf. Comput. 177(2): 195-241 (2002) - [c12]Johannes Borgström, Uwe Nestmann:
On Bisimulations for the Spi Calculus. AMAST 2002: 287-303 - [c11]Sébastien Briais, Uwe Nestmann:
Mobile Objects "Must" Move Safely. FMOODS 2002: 129-146 - [c10]Uwe Nestmann, Prakash Panangaden:
Preface. EXPRESS 2002: 1-2 - [e2]Uwe Nestmann, Prakash Panangaden:
9th International Workshop on Expressiveness in Concurrency, EXPRESS 2002, Satellite Workshop from CONCUR 2002, Brno, Czech Republic, August 19, 2002. Electronic Notes in Theoretical Computer Science 68(2), Elsevier 2002 [contents] - 2000
- [j3]Uwe Nestmann:
What is a "Good" Encoding of Guarded Choice? Inf. Comput. 156(1-2): 287-319 (2000) - [j2]Uwe Nestmann, Benjamin C. Pierce:
Decoding Choice Encodings. Inf. Comput. 163(1): 1-59 (2000) - [c9]Massimo Merro, Josva Kleist, Uwe Nestmann:
Local pi-Calculus at Work: Mobile Objects as Mobile Processes. IFIP TCS 2000: 390-408
1990 – 1999
- 1999
- [c8]Uwe Nestmann, António Ravara:
Semantics of Objects as Processes (SOAP). ECOOP Workshops 1999: 314-325 - [c7]Uwe Nestmann, Hans Hüttel, Josva Kleist, Massimo Merro:
Aliasing Models for Object Migration. Euro-Par 1999: 1353-1368 - [c6]Uwe Nestmann:
Mobile Objects (a project overview). FBT 1999: 155-164 - 1998
- [j1]Uwe Nestmann, Björn Victor:
Calculi for Mobile Processes - Bibliography and Web Pages. Bull. EATCS 64 (1998) - [c5]Uwe Nestmann:
On the Expressive Power of Joint Input. EXPRESS 1998: 145-152 - [c4]Uwe Nestmann, Benjamin C. Pierce:
Preface. HLCL 1998: 291 - [e1]Uwe Nestmann, Benjamin C. Pierce:
3rd International Workshop on High-Level Concurrent Languages, HLCL 1998, Satellite Workshop of CONCUR 1998, Nice, France, September 12, 1998. Electronic Notes in Theoretical Computer Science 16(3), Elsevier 1998 [contents] - 1997
- [c3]Uwe Nestmann:
What is a 'good' encoding of guarded choice? EXPRESS 1997: 206-226 - 1996
- [b1]Uwe Nestmann:
On determinacy and nondeterminacy in concurrent programming. University of Erlangen-Nuremberg, 1996, pp. 1-254 - [c2]Uwe Nestmann, Benjamin C. Pierce:
Decoding Choice Encodings. CONCUR 1996: 179-194 - 1995
- [c1]Uwe Nestmann, Martin Steffen:
Correct Transformational Design of Concurrent Search Structures. Object Orientation with Parallelism and Persistence 1995: 23-42
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-15 21:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
