Uwe Nestmann

Orcid: 0000-0002-8520-5448

Affiliations:
  • TU Berlin, Faculty of Electrical Engineering and Computer Science, Germany


According to our database1, Uwe Nestmann authored at least 85 papers between 1995 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
FTMPST: Fault-Tolerant Multiparty Session Types.
Log. Methods Comput. Sci., 2023

ProofBuddy: A Proof Assistant for Learning and Monitoring.
Proceedings of the Proceedings Twelfth International Workshop on Trends in Functional Programming in Education, 2023

Store Locally, Prove Globally.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2023, 2023

2022
On distributability.
Theor. Comput. Sci., 2022

Deciding All Behavioral Equivalences at Once: A Game for Linear-Time-Branching-Time Spectroscopy.
Log. Methods Comput. Sci., 2022

Fault-Tolerant Multiparty Session Types (Technical Report).
CoRR, 2022

Fault-Tolerant Multiparty Session Types.
Proceedings of the Formal Techniques for Distributed Objects, Components, and Systems, 2022

Beweiskompetenz durch Beweisassistenz.
Proceedings of the DELFI 2022, 2022

2021
Deciding All Behavioral Equivalences at Once: A Game for Linear-time-Branching-time Spectroscopy.
CoRR, 2021

A Game for Linear-time-Branching-time Spectroscopy.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2021

2020
Coupled similarity: the first 32 years.
Acta Informatica, 2020

Inter-Blockchain Protocols with the Isabelle Infrastructure Framework.
Proceedings of the 2nd Workshop on Formal Methods for Blockchains, 2020

2019
Taming Concurrency for Verification Using Multiparty Session Types (Technical Report).
CoRR, 2019

Computing Coupled Similarity.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2019

Taming Concurrency for Verification Using Multiparty Session Types.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2019 - 16th International Colloquium, Hammamet, Tunisia, October 31, 2019

2018
Dynamic Causality in Event Structures.
Log. Methods Comput. Sci., 2018

On the Distributability of Mobile Ambients.
Proceedings of the Proceedings Combined 25th International Workshop on Expressiveness in Concurrency and 15th Workshop on Structural Operational Semantics, 2018

On the Distributability of Mobile Ambients (Technical Report).
CoRR, 2018

A case study of flipped classroom for automata theory in secondary education.
Proceedings of the 13th Workshop in Primary and Secondary Computing Education, 2018

2017
Session Types for Link Failures.
Proceedings of the Formal Techniques for Distributed Objects, Components, and Systems, 2017

2016
Synchrony versus causality in distributed systems.
Math. Struct. Comput. Sci., 2016

Breaking symmetries.
Math. Struct. Comput. Sci., 2016

Full abstraction for expressiveness: history, myths and facts.
Math. Struct. Comput. Sci., 2016

Supervisory control synthesis for deterministic context free specification languages - Enforcing controllability least restrictively.
Discret. Event Dyn. Syst., 2016

Session Types for Link Failures (Technical Report).
CoRR, 2016

A Constructive Proof for FLP.
Arch. Formal Proofs, 2016

Mechanical Verification of a Constructive Proof for FLP.
Proceedings of the Interactive Theorem Proving - 7th International Conference, 2016

Topological Self-Stabilization with Name-Passing Process Calculi.
Proceedings of the 27th International Conference on Concurrency Theory, 2016

2015
Encoding CSP into CCS.
Proceedings of the Combined 22th International Workshop on Expressiveness in Concurrency and 12th Workshop on Structural Operational Semantics, 2015

Encoding CSP into CCS (Extended Version).
CoRR, 2015

Dynamic Causality in Event Structures (Technical Report).
CoRR, 2015

Higher-Order Dynamics in Event Structures.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2015, 2015

2014
States in Process Calculi.
Proceedings of the Proceedings Combined 21st International Workshop on Expressiveness in Concurrency, 2014

Enforcing Operational Properties including Blockfreeness for Deterministic Pushdown Automata.
CoRR, 2014

Matching in the Pi-Calculus.
Proceedings of the Proceedings Combined 21st International Workshop on Expressiveness in Concurrency, 2014

Matching in the Pi-Calculus (Technical Report).
CoRR, 2014

Reducing an Operational Supervisory Control Problem by Decomposition for Deterministic Pushdown Automata.
Proceedings of the 12th International Workshop on Discrete Event Systems, 2014

Extending Supervisory Controller Synthesis to Deterministic Pushdown Automata - Enforcing Controllability Least Restrictively.
Proceedings of the 12th International Workshop on Discrete Event Systems, 2014

2013
Adding Priority to Event Structures.
Proceedings of the Proceedings Combined 20th International Workshop on Expressiveness in Concurrency and 10th Workshop on Structural Operational Semantics, 2013

On Distributability in Process Calculi.
Proceedings of the Programming Languages and Systems, 2013

2012
Is it a "Good" Encoding of Mixed Choice? (Technical Report)
CoRR, 2012

Formal Verification of Distributed Algorithms - From Pseudo Code to Checked Proofs.
Proceedings of the Theoretical Computer Science, 2012

Is It a "Good" Encoding of Mixed Choice?
Proceedings of the Foundations of Software Science and Computational Structures, 2012

2011
Synchrony vs Causality in the Asynchronous Pi-Calculus
Proceedings of the Proceedings 18th International Workshop on Expressiveness in Concurrency, 2011

Java Goes TLA+.
Proceedings of the 5th IEEE International Symposium on Theoretical Aspects of Software Engineering, 2011

Vorwort.
Proceedings of the 41. Jahrestagung der Gesellschaft für Informatik, 2011

Rigorous Discretization of Hybrid Systems Using Process Calculi.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2011

2010
Defamation-Free Networks through User-Centered Data Control.
Proceedings of the Security and Trust Management - 6th International Workshop, 2010

Service-Orientierte Unterstützung des nationalen Früherkennungsprogramms für Kinder.
Proceedings of the 40. Jahrestagung der Gesellschaft für Informatik, Service Science - Neue Perspektiven für die Informatik, INFORMATIK 2010, Leipzig, Germany, September 27, 2010

2009
Preface.
J. Log. Algebraic Methods Program., 2009

Deriving Trust from Experience.
Proceedings of the Formal Aspects in Security and Trust, 6th International Workshop, 2009

On Process-Algebraic Proof Methods for Fault Tolerant Distributed Systems.
Proceedings of the Formal Techniques for Distributed Systems, 2009

2008
Applying Concurrency Research in Industry Report on a Strategic Workshop.
Bull. EATCS, 2008

Towards the Application of Process Calculi in the Domain of Peer-to-Peer Algorithms.
Proceedings of the Autonomous Systems, 2008

2007
A formal semantics for protocol narrations.
Theor. Comput. Sci., 2007

Distributed Consensus, revisited.
Acta Informatica, 2007

2006
Advances in the Design and Implementation of Group Communication Middleware.
Proceedings of the Dependable Systems: Software, Computing, Networks, 2006

Welcome to the Jungle: A Subjective Guide to Mobile Process Calculi.
Proceedings of the CONCUR 2006 - Concurrency Theory, 17th International Conference, 2006

2005
EDITORIAL: Selected papers of the tenth international workshop on expressiveness in concurrency (EXPRESS 2003).
Theor. Comput. Sci., 2005

On bisimulations for the spi calculus.
Math. Struct. Comput. Sci., 2005

Guest editors' introduction: Special issue on The pi-calculus.
J. Log. Algebraic Methods Program., 2005

Much Ado About Nothing?
Proceedings of the Workshop "Essays on Algebraic Process Calculi", 2005

Open Bisimulation, Revisited.
Proceedings of the 12th Workshop on Expressiveness on Concurrency, 2005

Protocol Composition Frameworks A Header-Driven Model.
Proceedings of the Fourth IEEE International Symposium on Network Computing and Applications (NCA 2005), 2005

2004
Verifying a Structured Peer-to-Peer Overlay Network: The Static Case.
Proceedings of the Global Computing, IST/FET International Workshop, 2004

Symbolic Bisimulation in the Spi Calculus.
Proceedings of the CONCUR 2004 - Concurrency Theory, 15th International Conference, London, UK, August 31, 2004

2003
Guest Editors' Foreword.
Nord. J. Comput., 2003

Foreword: Proceedings of the 10th International Workshop on Expressiveness in Concurrency.
Proceedings of the 10th International Workshop on Expressiveness in Concurrency, 2003

Modeling Consensus in a Process Calculus.
Proceedings of the CONCUR 2003, 2003

Unreliable Failure Detectors via Operational Semantics.
Proceedings of the Advances in Computing Science, 2003

2002
Aliasing Models for Mobile Objects.
Inf. Comput., 2002

Mobile Objects as Mobile Processes.
Inf. Comput., 2002

Preface.
Proceedings of the 9th International Workshop on Expressiveness in Concurrency, 2002

Mobile Objects "Must" Move Safely.
Proceedings of the Formal Methods for Open Object-Based Distributed Systems V, 2002

2000
Decoding Choice Encodings.
Inf. Comput., 2000

Local pi-Calculus at Work: Mobile Objects as Mobile Processes.
Proceedings of the Theoretical Computer Science, 2000

1999
Mobile Objects (a project overview).
Proceedings of the Formale Beschreibungstechniken für verteilte Systeme, 1999

Aliasing Models for Object Migration.
Proceedings of the Euro-Par '99 Parallel Processing, 5th International Euro-Par Conference, Toulouse, France, August 31, 1999

Semantics of Objects as Processes (SOAP).
Proceedings of the Object-Oriented Technology, ECOOP'99 Workshop Reader, 1999

1998
Preface.
Proceedings of the 3rd International Workshop on High-Level Concurrent Languages, 1998

On the Expressive Power of Joint Input.
Proceedings of the Fifth International Workshop on Expressiveness in Concurrency, 1998

Calculi for Mobile Processes - Bibliography and Web Pages.
Bull. EATCS, 1998

1997
What is a 'good' encoding of guarded choice?
Proceedings of the International Workshop on Expressiveness in Concurrency, 1997

1996
On determinacy and nondeterminacy in concurrent programming.
PhD thesis, 1996

1995
Correct Transformational Design of Concurrent Search Structures.
Proceedings of the Object Orientation with Parallelism and Persistence (the book grow out of a Dagstuhl Seminar in April 1995), 1995


  Loading...