![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
3rd PDMC@CONCUR 2004: London, UK
- Lubos Brim, Martin Leucker:
Proceedings of the 3rd International Workshop on Parallel and Distributed Methods in Verification, PDMC 2004, London, UK, September 4, 2004. Electronic Notes in Theoretical Computer Science 128(3), Elsevier 2005 - Lubos Brim, Martin Leucker:
Preface. 1-2 - Víctor A. Braberman, Alfredo Olivero, Fernando Schapachnik:
On-the-fly Workload Prediction and Redistribution in the Distributed Timed Model Checker Zeus. 3-18 - Rahul Kumar, Eric G. Mercer:
Load Balancing Parallel Explicit State Model Checking. 19-34 - Simona Orzan, Jaco van de Pol, Miguel Valero Espada:
A State Space Distribution Policy Based on Abstract Interpretation. 35-45 - Christophe Joubert
, Radu Mateescu:
Distributed On-the-Fly Equivalence Checking. 47-62 - Lubos Brim, Ivana Cerná
, Pavel Moravec, Jirí Simsa:
Distributed Partial Order Reduction of State Spaces. 63-74 - Yulik Feldman, Nachum Dershowitz, Ziyad Hanna:
Parallel Multithreaded Satisfiability Solver: Design and Implementation. 75-90 - Fredrik Holmén, Martin Leucker
, Marcus Lindström:
UppDMC: A Distributed Model Checker for Fragments of the mu-Calculus. 91-105 - Cornelia P. Inggs, Howard Barringer:
CTL* Model Checking on a Shared-Memory Architecture. 107-123 - Martin Lange, Hans-Wolfgang Loidl:
Parallel and Symbolic Model Checking for Fixpoint Logic with Chop. 125-138
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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.