default search action
Josef Widder
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j17]Igor Konnov, Marijana Lazic, Ilina Stoilkovska
, Josef Widder:
Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker. Log. Methods Comput. Sci. 19(1) (2023) - [j16]Thanh-Hai Tran, Igor Konnov, Josef Widder:
A case study on parametric verification of failure detectors. Log. Methods Comput. Sci. 19(1) (2023) - 2022
- [j15]Ilina Stoilkovska
Verifying safety of synchronous fault-tolerant algorithms by bounded model checking. Int. J. Softw. Tools Technol. Transf. 24(1): 33-48 (2022) - [c49]Ethan Buchman, Rachid Guerraoui
Revisiting Tendermint: Design Tradeoffs, Accountability, and Practical Use. DSN (Supplements) 2022: 11-14 - [c48]Nathalie Bertrand, Vincent Gramoli, Igor Konnov, Marijana Lazic, Pierre Tholoniat, Josef Widder:
Brief Announcement: Holistic Verification of Blockchain Consensus. PODC 2022: 424-426 - [c47]Nathalie Bertrand, Vincent Gramoli, Igor Konnov, Marijana Lazic, Pierre Tholoniat, Josef Widder:
Holistic Verification of Blockchain Consensus. DISC 2022: 10:1-10:24 - [i10]Nathalie Bertrand, Vincent Gramoli, Igor Konnov, Marijana Lazic, Pierre Tholoniat, Josef Widder:
Holistic Verification of Blockchain Consensus. CoRR abs/2206.04489 (2022) - 2021
- [j14]Nathalie Bertrand, Igor Konnov, Marijana Lazic, Josef Widder:
Verification of randomized consensus algorithms under round-rigid adversaries. Int. J. Softw. Tools Technol. Transf. 23(5): 797-821 (2021) - [j13]Nathalie Bertrand, Igor Konnov, Marijana Lazic, Josef Widder:
Correction to: Verification of randomized consensus algorithms under round-rigid adversaries. Int. J. Softw. Tools Technol. Transf. 23(5): 823 (2021) - [c46]Nathalie Bertrand, Bastien Thomas, Josef Widder:
Guard Automata for the Verification of Safety and Liveness of Distributed Algorithms. CONCUR 2021: 15:1-15:17 - [c45]Thanh-Hai Tran, Igor Konnov, Josef Widder:
A Case Study on Parametric Verification of Failure Detectors. FORTE 2021: 138-156 - [c44]Ilina Stoilkovska, Igor Konnov, Josef Widder, Florian Zuleger:
Eliminating Message Counters in Synchronous Threshold Automata. VMCAI 2021: 196-218 - [c43]Nathalie Bertrand
A Reduction Theorem for Randomized Distributed Algorithms Under Weak Adversaries. VMCAI 2021: 219-239 - [i9]Thanh-Hai Tran, Igor Konnov, Josef Widder:
A case study on parametric verification of failure detectors. CoRR abs/2112.08826 (2021) - 2020
- [j12]Cezara Dragoi, Josef Widder
Programming at the edge of synchrony. Proc. ACM Program. Lang. 4(OOPSLA): 213:1-213:30 (2020) - [c42]Ilina Stoilkovska, Igor Konnov, Josef Widder, Florian Zuleger:
Eliminating Message Counters in Threshold Automata. ATVA 2020: 196-212 - [c41]Sean Braithwaite, Ethan Buchman, Igor Konnov
Formal Specification and Model Checking of the Tendermint Blockchain Synchronization Protocol (Short Paper). FMBC@CAV 2020: 10:1-10:8 - [c40]Igor Konnov
Tutorial: Parameterized Verification with Byzantine Model Checker. FORTE 2020: 189-207 - [c39]Sean Braithwaite, Ethan Buchman, Igor Konnov, Zarko Milosevic, Ilina Stoilkovska, Josef Widder, Anca Zamfir:
Tendermint Blockchain Synchronization: Formal Specification and Model Checking. ISoLA (1) 2020: 471-488 - [c38]Thanh-Hai Tran, Igor Konnov, Josef Widder:
Cutoffs for Symmetric Point-to-Point Distributed Algorithms. NETYS 2020: 329-346 - [i8]Sean Braithwaite, Ethan Buchman, Ismail Khoffi, Igor Konnov, Zarko Milosevic, Romain Ruetschi, Josef Widder:
A Tendermint Light Client. CoRR abs/2010.07031 (2020) - [i7]Igor Konnov, Marijana Lazic, Ilina Stoilkovska, Josef Widder:
Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker. CoRR abs/2011.14789 (2020)
2010 – 2019
- 2019
- [c37]Andrei Damian, Cezara Dragoi, Alexandru Militaru, Josef Widder:
Communication-Closed Asynchronous Protocols. CAV (2) 2019: 344-363 - [c36]Nathalie Bertrand
Verification of Randomized Consensus Algorithms Under Round-Rigid Adversaries. CONCUR 2019: 33:1-33:15 - [c35]Ilina Stoilkovska, Igor Konnov
Verifying Safety of Synchronous Fault-Tolerant Algorithms by Bounded Model Checking. TACAS (2) 2019: 357-374 - 2018
- [c34]Jure Kukovec, Igor Konnov
Reachability in Parameterized Systems: All Flavors of Threshold Automata. CONCUR 2018: 19:1-19:17 - [c33]Igor Konnov
ByMC: Byzantine Model Checker. ISoLA (3) 2018: 327-342 - [c32]Benjamin Aminof, Sasha Rubin, Ilina Stoilkovska, Josef Widder, Florian Zuleger:
Parameterized Model Checking of Synchronous Distributed Algorithms by Abstraction. VMCAI 2018: 1-24 - [e1]Ulrich Schmid, Josef Widder:
32nd International Symposium on Distributed Computing, DISC 2018, New Orleans, LA, USA, October 15-19, 2018. LIPIcs 121, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-092-7 [contents] - [i6]Cezara Dragoi, Josef Widder:
Reducing asynchrony to synchronized rounds. CoRR abs/1804.07078 (2018) - 2017
- [j11]Igor Konnov
Para2: parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms. Formal Methods Syst. Des. 51(2): 270-307 (2017) - [j10]Igor V. Konnov
On the completeness of bounded model checking for threshold-based distributed algorithms: Reachability. Inf. Comput. 252: 95-109 (2017) - [c31]Marijana Lazic, Igor Konnov
Synthesis of Distributed Algorithms with Parameterized Threshold Guards. OPODIS 2017: 32:1-32:20 - [c30]Igor V. Konnov
A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithms. POPL 2017: 719-734 - [c29]Igor V. Konnov
Accuracy of Message Counting Abstraction in Fault-Tolerant Distributed Algorithms. VMCAI 2017: 347-366 - 2016
- [j9]Roderick Bloem
Decidability in Parameterized Verification. SIGACT News 47(2): 53-64 (2016) - [i5]Igor Konnov
A Short Counterexample Property for Safety and Liveness Verification of Fault-tolerant Distributed Algorithms. CoRR abs/1608.05327 (2016) - 2015
- [b1]Roderick Bloem
Decidability of Parameterized Verification. Synthesis Lectures on Distributed Computing Theory, Morgan & Claypool Publishers 2015, ISBN 978-3-031-00883-2 - [j8]Bernadette Charron-Bost, Matthias Függer, Jennifer L. Welch, Josef Widder
Time Complexity of Link Reversal Routing. ACM Trans. Algorithms 11(3): 18:1-18:39 (2015) - [c28]Igor Konnov
SMT and POR Beat Counter Abstraction: Parameterized Model Checking of Threshold-Based Distributed Algorithms. CAV (1) 2015: 85-102 - [c27]Igor V. Konnov
What You Always Wanted to Know About Model Checking of Fault-Tolerant Distributed Algorithms. Ershov Memorial Conference 2015: 6-21 - 2014
- [c26]Igor Konnov
On the Completeness of Bounded Model Checking for Threshold-Based Distributed Algorithms: Reachability. CONCUR 2014: 125-140 - [c25]Srikanth Sastry, Josef Widder
Solvability-Based Comparison of Failure Detectors. NCA 2014: 269-276 - [c24]Annu Gmeiner, Igor Konnov
Tutorial on Parameterized Model Checking of Fault-Tolerant Distributed Algorithms. SFM 2014: 122-171 - [c23]Cezara Dragoi, Thomas A. Henzinger, Helmut Veith, Josef Widder
A Logic-Based Framework for Verifying Consensus Algorithms. VMCAI 2014: 161-181 - [i4]Srikanth Sastry, Josef Widder:
Solvability-Based Comparison of Failure Detectors. CoRR abs/1407.3286 (2014) - 2013
- [j7]Bernadette Charron-Bost, Antoine Gaillard, Jennifer L. Welch, Josef Widder
Link Reversal Routing with Binary Link Labels: Work Complexity. SIAM J. Comput. 42(2): 634-661 (2013) - [c22]Annu John, Igor Konnov, Ulrich Schmid, Helmut Veith, Josef Widder:
Parameterized model checking of fault-tolerant distributed algorithms by abstraction. FMCAD 2013: 201-209 - [c21]Annu John, Igor Konnov, Ulrich Schmid, Helmut Veith, Josef Widder:
Brief announcement: parameterized model checking of fault-tolerant distributed algorithms by abstraction. PODC 2013: 119-121 - [c20]Annu John, Igor Konnov, Ulrich Schmid, Helmut Veith, Josef Widder:
Towards Modeling and Model Checking Fault-Tolerant Distributed Algorithms. SPIN 2013: 209-226 - [i3]Bernadette Charron-Bost, Stephan Merz, Andrey Rybalchenko, Josef Widder:
Formal Verification of Distributed Algorithms (Dagstuhl Seminar 13141). Dagstuhl Reports 3(4): 1-16 (2013) - 2012
- [j6]Josef Widder
Consensus in the presence of mortal Byzantine faulty processes. Distributed Comput. 24(6): 299-321 (2012) - [c19]Matthias Függer, Josef Widder
Efficient Checking of Link-Reversal-Based Concurrent Systems. CONCUR 2012: 486-499 - [c18]Srikanth Sastry, Jennifer L. Welch, Josef Widder
Wait-Free Stabilizing Dining Using Regular Registers. OPODIS 2012: 284-299 - [i2]Annu John, Igor Konnov
Starting a Dialog between Model Checking and Fault-tolerant Distributed Algorithms. CoRR abs/1210.3839 (2012) - [i1]Annu John, Igor Konnov
Counter Attack on Byzantine Generals: Parameterized Model Checking of Fault-tolerant Distributed Algorithms. CoRR abs/1210.3846 (2012) - 2011
- [c17]Bernadette Charron-Bost, Matthias Függer, Jennifer L. Welch, Josef Widder
Full Reversal Routing as a Linear Dynamical System. SIROCCO 2011: 101-112 - [c16]Bernadette Charron-Bost, Matthias Függer, Jennifer L. Welch, Josef Widder
Partial is Full. SIROCCO 2011: 113-124 - [c15]Bernadette Charron-Bost, Matthias Függer, Jennifer L. Welch, Josef Widder
Brief announcement: full reversal routing as a linear dynamical system. SPAA 2011: 129-130 - 2010
- [j5]Bernadette Charron-Bost, Martin Hutle, Josef Widder
In search of lost time. Inf. Process. Lett. 110(21): 928-933 (2010)
2000 – 2009
- 2009
- [j4]Josef Widder
The Theta-Model: achieving synchrony without clocks. Distributed Comput. 22(1): 29-47 (2009) - [j3]Martin Biely
Optimal message-driven implementations of omega with mute processes. ACM Trans. Auton. Adapt. Syst. 4(1): 4:1-4:22 (2009) - [c14]Bernadette Charron-Bost, Jennifer L. Welch, Josef Widder
Link Reversal: How to Play Better to Work Less. ALGOSENSORS 2009: 88-101 - [c13]Bernadette Charron-Bost, Antoine Gaillard, Jennifer L. Welch, Josef Widder
Routing without ordering. SPAA 2009: 145-153 - 2007
- [j2]Josef Widder
Booting clock synchronization in partially synchronous systems with hybrid process and link failures. Distributed Comput. 20(2): 115-140 (2007) - [c12]Josef Widder
Synchronous Consensus with Mortal Byzantines. DSN 2007: 102-112 - [c11]Emmanuelle Anceaume, Carole Delporte-Gallet, Hugues Fauconnier, Michel Hurfin, Josef Widder:
Clock Synchronization in the Byzantine-Recovery Failure Model. OPODIS 2007: 90-104 - [c10]Martin Biely
Tolerating corrupted communication. PODC 2007: 244-253 - [c9]Martin Biely, Martin Hutle, Lucia Draque Penso, Josef Widder:
Relating Stabilizing Timing Assumptions to Stabilizing Failure Detectors Regarding Solvability and Efficiency. SSS 2007: 4-20 - 2006
- [c8]Martin Biely, Josef Widder:
Optimal Message-Driven Implementation of Omega with Mute Processes. SSS 2006: 110-121 - 2005
- [c7]Josef Widder, Gérard Le Lann, Ulrich Schmid:
Failure Detection with Booting in Partially Synchronous Systems. EDCC 2005: 20-37 - [c6]Jean-François Hermant, Josef Widder
Implementing Reliable Distributed Real-Time Systems with the Theta-Model. OPODIS 2005: 334-350 - [c5]Martin Hutle, Josef Widder:
Self-Stabilizing Failure Detector Algorithms. Parallel and Distributed Computing and Networks 2005: 485-490 - [c4]Martin Hutle, Josef Widder
Brief announcement: on the possibility and the impossibility of message-driven self-stabilizing failure detection. PODC 2005: 208 - [c3]Martin Hutle, Josef Widder
On the Possibility and the Impossibility of Message-Driven Self-stabilizing Failure Detection. Self-Stabilizing Systems 2005: 153-170 - 2003
- [c2]Josef Widder:
Booting clock Synchronization in Partially Synchronous Systems. DISC 2003: 121-135
1990 – 1999
- 1992
- [j1]Chong-Min Kyung, Josef Widder, Dieter A. Mlynski:
Adaptive cluster growth: a new algorithm for circuit placement in rectilinear regions. Comput. Aided Des. 24(1): 27-35 (1992) - 1990
- [c1]Chong-Min Kyung, Josef Widder, Dieter A. Mlynski:
Adaptive Cluster Growth (ACG): a new algorithm for circuit packing in rectilinear region. EURO-DAC 1990: 191-195
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-04-25 05:56 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: