9 Search Results for "Wehrle, Klaus"

Document
DOI: 10.4230/LIPIcs.CONCUR.2025.26
Optimal Concolic Dynamic Partial Order Reduction

Authors: Mohammad Hossein Khoshechin Jorshari, Michalis Kokologiannakis, Rupak Majumdar, and Srinidhi Nagendra

Published in: LIPIcs, Volume 348, 36th International Conference on Concurrency Theory (CONCUR 2025)

Abstract
Stateless model checking (SMC) software implementations requires exploring both concurrency- and data nondeterminism. Unfortunately, most SMC algorithms focus on efficient exploration of concurrency nondeterminism, thereby neglecting an important source of bugs. We present ConDpor, an SMC algorithm for unmodified Java programs that combines optimal dynamic partial order reduction (DPOR) for concurrency nondeterminism, with concolic execution for data nondeterminism. ConDpor is sound, complete, optimal, and parametric w.r.t. the memory consistency model. Our experiments confirm that ConDpor is exponentially faster than DPOR with small-domain enumeration. Overall, ConDpor opens the door for efficient exploration of concurrent programs with data nondeterminism.
Cite as

Mohammad Hossein Khoshechin Jorshari, Michalis Kokologiannakis, Rupak Majumdar, and Srinidhi Nagendra. Optimal Concolic Dynamic Partial Order Reduction. In 36th International Conference on Concurrency Theory (CONCUR 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 348, pp. 26:1-26:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

Copy BibTex To Clipboard

@InProceedings{khoshechinjorshari_et_al:LIPIcs.CONCUR.2025.26,
  author =	{Khoshechin Jorshari, Mohammad Hossein and Kokologiannakis, Michalis and Majumdar, Rupak and Nagendra, Srinidhi},
  title =	{{Optimal Concolic Dynamic Partial Order Reduction}},
  booktitle =	{36th International Conference on Concurrency Theory (CONCUR 2025)},
  pages =	{26:1--26:22},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-389-8},
  ISSN =	{1868-8969},
  year =	{2025},
  volume =	{348},
  editor =	{Bouyer, Patricia and van de Pol, Jaco},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2025.26},
  URN =		{urn:nbn:de:0030-drops-239765},
  doi =		{10.4230/LIPIcs.CONCUR.2025.26},
  annote =	{Keywords: Stateless model checking, dynamic symbolic execution}
}
Document
DOI: 10.4230/DagRep.9.5.132
Control of Networked Cyber-Physical Systems (Dagstuhl Seminar 19222)

Authors: John S. Baras, Sandra Hirche, Kay Römer, and Klaus Wehrle

Published in: Dagstuhl Reports, Volume 9, Issue 5 (2019)

Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 19222 "Control of Networked Cyber-Physical Systems". Such systems typically operate under very tight timing constraints and at the same time witness an ever-increasing complexity in both size and the amount of information needed to main controllability. Yet, the development of control systems and of communication/computation infrastructures has traditionally been decoupled, so that valuable insights from the respective other domain could not be used towards the joint goal of keeping cyber-physical systems (CPS) controllable. In order to overcome this "black box" thinking, the seminar brought together researchers from the key communities involved in the development of CPS. In a series of impulse talks and plenary discussions, the seminar reviewed the current start-of-the-art in CPS research and identified promising research directions that may benefit from closer cooperation between the communication and control communities.
Cite as

John S. Baras, Sandra Hirche, Kay Römer, and Klaus Wehrle. Control of Networked Cyber-Physical Systems (Dagstuhl Seminar 19222). In Dagstuhl Reports, Volume 9, Issue 5, pp. 132-141, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)

Copy BibTex To Clipboard

@Article{baras_et_al:DagRep.9.5.132,
  author =	{Baras, John S. and Hirche, Sandra and R\"{o}mer, Kay and Wehrle, Klaus},
  title =	{{Control of Networked Cyber-Physical Systems (Dagstuhl Seminar 19222)}},
  pages =	{132--141},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2019},
  volume =	{9},
  number =	{5},
  editor =	{Baras, John S. and Hirche, Sandra and R\"{o}mer, Kay and Wehrle, Klaus},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.9.5.132},
  URN =		{urn:nbn:de:0030-drops-113847},
  doi =		{10.4230/DagRep.9.5.132},
  annote =	{Keywords: Control Theory, Cyber-Physical Systems, Latency, Network Architecture}
}
Document
DOI: 10.4230/DagRep.6.7.15
Network Latency Control in Data Centres (Dagstuhl Seminar 16281)

Authors: Mohammad Alizadeh Attar, Jon Crowcroft, Lars Eggert, and Klaus Wehrle

Published in: Dagstuhl Reports, Volume 6, Issue 7 (2016)

Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 16281 "Network Latency Control in Data Centres". This seminar explored existing and future techniques for controlling data centre latency and thus explores research directions in the new field of data centre latency control in networking research. This need for a new research direction is motivated by the fact that traditional networking equipment and TCP-IP stacks were designed for wide-area networks, where the goal is to maximize throughput, and the control loop between end systems is measured in 10s of milliseconds. Consequently, this seminar discussed new research direction for data center latency control across the entire software and hardware stack, including in-network solutions, end-host solutions, and others.
Cite as

Mohammad Alizadeh Attar, Jon Crowcroft, Lars Eggert, and Klaus Wehrle. Network Latency Control in Data Centres (Dagstuhl Seminar 16281). In Dagstuhl Reports, Volume 6, Issue 7, pp. 15-30, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)

Copy BibTex To Clipboard

@Article{alizadehattar_et_al:DagRep.6.7.15,
  author =	{Alizadeh Attar, Mohammad and Crowcroft, Jon and Eggert, Lars and Wehrle, Klaus},
  title =	{{Network Latency Control in Data Centres (Dagstuhl Seminar 16281)}},
  pages =	{15--30},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2016},
  volume =	{6},
  number =	{7},
  editor =	{Alizadeh Attar, Mohammad and Crowcroft, Jon and Eggert, Lars and Wehrle, Klaus},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.6.7.15},
  URN =		{urn:nbn:de:0030-drops-67605},
  doi =		{10.4230/DagRep.6.7.15},
  annote =	{Keywords: data centres, end-to-end transport protocols., latency, network architecture, resource control, scheduling}
}
Document
DOI: 10.4230/DagSemProc.06131.1
06131 Abstracts Collection – Peer-to -Peer -Systems and -Applications

Authors: Anthony D. Joseph, Ralf Steinmetz, Ion Stoica, and Klaus Wehrle

Published in: Dagstuhl Seminar Proceedings, Volume 6131, Peer-to-Peer-Systems and -Applications (2006)

Abstract
From 26.03.06 to 29.03.06, the Dagstuhl Seminar 06131 ``Peer-to-Peer-Systems and -Applications'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.
Cite as

Anthony D. Joseph, Ralf Steinmetz, Ion Stoica, and Klaus Wehrle. 06131 Abstracts Collection – Peer-to -Peer -Systems and -Applications. In Peer-to-Peer-Systems and -Applications. Dagstuhl Seminar Proceedings, Volume 6131, pp. 1-10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)

Copy BibTex To Clipboard

@InProceedings{joseph_et_al:DagSemProc.06131.1,
  author =	{Joseph, Anthony D. and Steinmetz, Ralf and Stoica, Ion and Wehrle, Klaus},
  title =	{{06131 Abstracts Collection – Peer-to -Peer -Systems and -Applications}},
  booktitle =	{Peer-to-Peer-Systems and -Applications},
  pages =	{1--10},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{6131},
  editor =	{Anthony D. Joseph and Ralf Steinmetz and Klaus Wehrle},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06131.1},
  URN =		{urn:nbn:de:0030-drops-8455},
  doi =		{10.4230/DagSemProc.06131.1},
  annote =	{Keywords: Peer-to-Peer, self-organisation, massively distributed systems}
}
Document
DOI: 10.4230/DagSemProc.06131.2
06131 Executive Summary – Peer-to-Peer-Systems and -Applications

Authors: Anthony D. Joseph, Ralf Steinmetz, Ion Stoica, and Klaus Wehrle

Published in: Dagstuhl Seminar Proceedings, Volume 6131, Peer-to-Peer-Systems and -Applications (2006)

Abstract
This is the executive summary of Dagstuhl Seminar 06131, "Peer-to-Peer-Systems and -Applications". The seminar was held from March 26th to March 29th, 2006, at the International Conference and Research Center for Computer Science at Castle Dagstuhl, Germany.
Cite as

Anthony D. Joseph, Ralf Steinmetz, Ion Stoica, and Klaus Wehrle. 06131 Executive Summary – Peer-to-Peer-Systems and -Applications. In Peer-to-Peer-Systems and -Applications. Dagstuhl Seminar Proceedings, Volume 6131, pp. 1-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)

Copy BibTex To Clipboard

@InProceedings{joseph_et_al:DagSemProc.06131.2,
  author =	{Joseph, Anthony D. and Steinmetz, Ralf and Stoica, Ion and Wehrle, Klaus},
  title =	{{06131 Executive Summary – Peer-to-Peer-Systems and -Applications}},
  booktitle =	{Peer-to-Peer-Systems and -Applications},
  pages =	{1--4},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{6131},
  editor =	{Anthony D. Joseph and Ralf Steinmetz and Klaus Wehrle},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06131.2},
  URN =		{urn:nbn:de:0030-drops-8522},
  doi =		{10.4230/DagSemProc.06131.2},
  annote =	{Keywords: Peer-to-Peer, self-organisation, massively distributed systems}
}
Document
DOI: 10.4230/DagSemProc.06131.3
Fairness in Peer-to-Peer Networks

Authors: Kolja Eger and Ulrich Killat

Published in: Dagstuhl Seminar Proceedings, Volume 6131, Peer-to-Peer-Systems and -Applications (2006)

Abstract
The first Peer-to-Peer (P2P) networks were based mainly on the altruistic behaviour of its peers. Although newer implementations incorporate some kind of incentive mechanism to award sharing peers, no P2P network assures some quality of service. Our work is meant as a first step towards the development of P2P networks with quality of service. We propose a distributed resource allocation algorithm where peers control the service rate to its neighbours. This algorithm is based on the congestion pricing principle known from IP networks and ensures some form of fairness. Hence a peer gets a fair share of the resources available in the P2P network weighted by its contribution to the network. We present the first simulation results about the convergence of our algorithm and its functionality in large and varying networks.
Cite as

Kolja Eger and Ulrich Killat. Fairness in Peer-to-Peer Networks. In Peer-to-Peer-Systems and -Applications. Dagstuhl Seminar Proceedings, Volume 6131, pp. 1-6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)

Copy BibTex To Clipboard

@InProceedings{eger_et_al:DagSemProc.06131.3,
  author =	{Eger, Kolja and Killat, Ulrich},
  title =	{{Fairness in Peer-to-Peer Networks}},
  booktitle =	{Peer-to-Peer-Systems and -Applications},
  pages =	{1--6},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{6131},
  editor =	{Anthony D. Joseph and Ralf Steinmetz and Klaus Wehrle},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06131.3},
  URN =		{urn:nbn:de:0030-drops-6452},
  doi =		{10.4230/DagSemProc.06131.3},
  annote =	{Keywords: Pricing, Rate Control, Resource Allocation, Distributed Optimisation, Fairness, P2P Networks}
}
Document
DOI: 10.4230/DagSemProc.06131.4
On the Topologies Formed by Selfish Peers

Authors: Stefan Schmid, Thomas Moscibroda, and Roger Wattenhofer

Published in: Dagstuhl Seminar Proceedings, Volume 6131, Peer-to-Peer-Systems and -Applications (2006)

Abstract
Many P2P systems are only proven efficient for static environments. However, in practice, P2P systems are often very dynamic in the sense that peers can join and leave a system at any time and concurrently. In the first part of my talk, I will present a DHT we have developed recently in our group which maintains desirable properties under worst-case churn. In the second part of my talk, we will briefly look at another challenge of prime importance in P2P computing, namely selfishness. Concretely, some results are presented concerning the impact of selfish behavior on the performance of P2P topologies.
Cite as

Stefan Schmid, Thomas Moscibroda, and Roger Wattenhofer. On the Topologies Formed by Selfish Peers. In Peer-to-Peer-Systems and -Applications. Dagstuhl Seminar Proceedings, Volume 6131, pp. 1-5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)

Copy BibTex To Clipboard

@InProceedings{schmid_et_al:DagSemProc.06131.4,
  author =	{Schmid, Stefan and Moscibroda, Thomas and Wattenhofer, Roger},
  title =	{{On the Topologies Formed by Selfish Peers}},
  booktitle =	{Peer-to-Peer-Systems and -Applications},
  pages =	{1--5},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{6131},
  editor =	{Anthony D. Joseph and Ralf Steinmetz and Klaus Wehrle},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06131.4},
  URN =		{urn:nbn:de:0030-drops-6431},
  doi =		{10.4230/DagSemProc.06131.4},
  annote =	{Keywords: Churn, Selfishness, P2P Topologies}
}
Document
DOI: 10.4230/DagSemProc.06131.5
Taming Dynamic and Selfish Peers

Authors: Stefan Schmid, Fabian Kuhn, Thomas Moscibroda, and Roger Wattenhofer

Published in: Dagstuhl Seminar Proceedings, Volume 6131, Peer-to-Peer-Systems and -Applications (2006)

Abstract
Peer-to-peer systems are often faced with the problem of frequent membership changes. However, many systems are only proven efficient or correct in static environments. In my talk, I will present techniques to maintain desirable properties of a distributed hash table (low peer degree, low network diameter) in spite of ongoing and concurrent dynamics. I will then go on and study the effect of peers not acting according to our protocols. Concretely, I assume that peers are selfish and choose the behavior which maximizes their utility. I will report on our results concerning the impact of selfishness on the peer-to-peer topology.
Cite as

Stefan Schmid, Fabian Kuhn, Thomas Moscibroda, and Roger Wattenhofer. Taming Dynamic and Selfish Peers. In Peer-to-Peer-Systems and -Applications. Dagstuhl Seminar Proceedings, Volume 6131, pp. 1-14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)

Copy BibTex To Clipboard

@InProceedings{schmid_et_al:DagSemProc.06131.5,
  author =	{Schmid, Stefan and Kuhn, Fabian and Moscibroda, Thomas and Wattenhofer, Roger},
  title =	{{Taming Dynamic and Selfish Peers}},
  booktitle =	{Peer-to-Peer-Systems and -Applications},
  pages =	{1--14},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{6131},
  editor =	{Anthony D. Joseph and Ralf Steinmetz and Klaus Wehrle},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06131.5},
  URN =		{urn:nbn:de:0030-drops-6477},
  doi =		{10.4230/DagSemProc.06131.5},
  annote =	{Keywords: Churn, Selfishness, P2P Topologies}
}
Document
DOI: 10.4230/DagSemProc.04411.6
Bridging today's Internet Heterogeneity with a Content-oriented Approach

Authors: Klaus Wehrle

Published in: Dagstuhl Seminar Proceedings, Volume 4411, Service Management and Self-Organization in IP-based Networks (2005)

Abstract
Despite the success of Internet technology and protocols, their deficiencies become apparent with growing and emerging applications like 3G mobile devices or pervasive environments. In these fields, there is a growing demand for additional support of mobility, multi- or anycast communication, or service composition. ...
Cite as

Klaus Wehrle. Bridging today's Internet Heterogeneity with a Content-oriented Approach. In Service Management and Self-Organization in IP-based Networks. Dagstuhl Seminar Proceedings, Volume 4411, pp. 1-5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)

Copy BibTex To Clipboard

@InProceedings{wehrle:DagSemProc.04411.6,
  author =	{Wehrle, Klaus},
  title =	{{Bridging today's Internet Heterogeneity with a Content-oriented Approach}},
  booktitle =	{Service Management and Self-Organization in IP-based Networks},
  pages =	{1--5},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{4411},
  editor =	{Matthias Bossardt and Georg Carle and D. Hutchison and Hermann de Meer and Bernhard Plattner},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04411.6},
  URN =		{urn:nbn:de:0030-drops-1004},
  doi =		{10.4230/DagSemProc.04411.6},
  annote =	{Keywords: Peer-to-Peer , Overlay , Communication Form , Bridging Heterogeneity}
}
  • Refine by Type
  • 9 Document/PDF
  • 1 Document/HTML

  • Refine by Publication Year
  • 1 2025
  • 1 2019
  • 1 2016
  • 3 2007
  • 2 2006
  • Show More...

  • Refine by Author
  • 5 Wehrle, Klaus
  • 2 Joseph, Anthony D.
  • 2 Moscibroda, Thomas
  • 2 Schmid, Stefan
  • 2 Steinmetz, Ralf
  • Show More...

  • Refine by Series/Journal
  • 1 LIPIcs
  • 2 DagRep
  • 6 DagSemProc

  • Refine by Classification
  • 1 Theory of computation → Concurrency
  • 1 Theory of computation → Verification by model checking

  • Refine by Keyword
  • 3 Peer-to-Peer
  • 2 Churn
  • 2 P2P Topologies
  • 2 Selfishness
  • 2 massively distributed systems
  • Show More...

Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2026 Schloss Dagstuhl – LZI GmbH Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact