Sciweavers

713 search results - page 115 / 143
» Model Checking and Transitive-Closure Logic
Sort
View
CAV
2004
Springer
151views Hardware» more  CAV 2004»
15 years 7 months ago
QB or Not QB: An Efficient Execution Verification Tool for Memory Orderings
We study the problem of formally verifying shared memory multiprocessor executions against memory consistency models--an important step during post-silicon verification of multipro...
Ganesh Gopalakrishnan, Yue Yang, Hemanthkumar Siva...
HYBRID
2010
Springer
15 years 10 months ago
On the connections between PCTL and dynamic programming
Probabilistic Computation Tree Logic (PCTL) is a wellknown modal logic which has become a standard for expressing temporal properties of finite-state Markov chains in the context...
Federico Ramponi, Debasish Chatterjee, Sean Summer...
ICTAC
2005
Springer
15 years 9 months ago
Stochastic Analysis of Graph Transformation Systems: A Case Study in P2P Networks
In distributed and mobile systems with volatile bandwidth and fragile connectivity, non-functional aspects like performance and reliability become more and more important. To forma...
Reiko Heckel
ATVA
2006
Springer
114views Hardware» more  ATVA 2006»
15 years 7 months ago
Selective Approaches for Solving Weak Games
Abstract. Model-checking alternating-time properties has recently attracted much interest in the verification of distributed protocols. While checking the validity of a specificati...
Malte Helmert, Robert Mattmüller, Sven Schewe
127
Voted
FMSD
2006
131views more  FMSD 2006»
15 years 3 months ago
Specification and analysis of the AER/NCA active network protocol suite in Real-Time Maude
This paper describes the application of the Real-Time Maude tool and the Maude formal methodology to the specification and analysis of the AER/NCA suite of active network multicast...
Peter Csaba Ölveczky, José Meseguer, C...