| Body na spoluautora | Body za publikaci pro MU | Odkaz ISVaV | | 3,28 | 13,10 | Formal verification of systems with an unlimited number of components
|
| 0,00 | 0,00 | Under-Approximation Generation using Partial Order Reduction
|
| 0,00 | 0,00 | How to Cope with Higher Dependency in Partial Order Reduction for LTL Model Checking
|
| 5,03 | 20,12 | Distributed Partial Order Reduction of State Spaces
|
| 0,00 | 0,00 | How to Order Vertices for Distributed LTL Model-Checking Based on Accepting Predecessors
|
| 12,04 | 72,24 | DiVinE Library
|
| 0,00 | 0,00 | Experimental Comparison of Algorithms Checking Proviso for Partial Order Reduction
|
| 5,03 | 30,19 | DiVinE -- A Tool for Distributed Verification
|
| 2,41 | 14,45 | DiVinE -- A Tool for Distributed Verification
|
| 5,03 | 20,12 | How to Order Vertices for Distributed LTL Model-Checking Based on Accepting Predecessors
|
| 0,00 | 0,00 | On Combining Partial Order Reduction with Fairness Assumptions
|
| 3,61 | 14,45 | On Combining Partial Order Reduction with Fairness Assumptions
|
| 0,00 | 0,00 | Parallel Algorithms for Finding SCCs in Implicitly Given Graphs
|
| 0,00 | 0,00 | Effective verification of systems with a dynamic number of components
|
| 0,00 | 0,00 | Complementarity of Error Detection Techniques
|
| 0,00 | 0,00 | Relaxed Cycle Condition Improves Partial Order Reduction
|
| 7,22 | 14,45 | Parallel Algorithms for Finding SCCs in Implicitly Given Graphs
|
| 15,09 | 30,19 | Parallel Algorithms for Finding SCCs in Implicitly Given Graphs
|
Back
(c) Michal Bulant, 2011