( en | de | ru )

 

Disambiguation of "Widder, Josef"

Author of the publication

copydeleteadd this publication to your clipboard
Decidability of Parameterized Verification

, , , , , , and . Synthesis Lectures on Distributed Computing Theory Morgan & Claypool Publishers, (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Dieter Josef

Reinhold Josef

Ellen Widder

Bernhard Widder

Stefan Widder

 

Other publications of authors with the same name

SMT and POR Beat Counter Abstraction: Parameterized Model Checking of Threshold-Based Distributed Algorithms., , and . CAV (1), volume 9206 of Lecture Notes in Computer Science, page 85-102. Springer, (2015)Link Reversal: How to Play Better to Work Less., , and . ALGOSENSORS, volume 5804 of Lecture Notes in Computer Science, page 88-101. Springer, (2009)Brief announcement: parameterized model checking of fault-tolerant distributed algorithms by abstraction., , , , and . PODC, page 119-121. ACM, (2013)Implementing Reliable Distributed Real-Time Systems with the Theta-Model., and . OPODIS, volume 3974 of Lecture Notes in Computer Science, page 334-350. Springer, (2005)A Logic-Based Framework for Verifying Consensus Algorithms., , , , and . VMCAI, volume 8318 of Lecture Notes in Computer Science, page 161-181. Springer, (2014)On the Completeness of Bounded Model Checking for Threshold-Based Distributed Algorithms: Reachability., , and . CONCUR, volume 8704 of Lecture Notes in Computer Science, page 125-140. Springer, (2014)Tutorial: Parameterized Verification with Byzantine Model Checker, , , and . FORTE, volume 12136 of Lecture Notes in Computer Science, page 189-207. Springer, (2020)Solvability-Based Comparison of Failure Detectors., and . NCA, page 269-276. IEEE Computer Society, (2014)Verification of Randomized Consensus Algorithms Under Round-Rigid Adversaries., , , and . CONCUR, volume 140 of LIPIcs, page 33:1-33:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Guard Automata for the Verification of Safety and Liveness of Distributed Algorithms., , and . CONCUR, volume 203 of LIPIcs, page 15:1-15:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)