Sciweavers

13 search results - page 3 / 3
» Symbolic Reachability Analysis of Higher-Order Context-Free ...
Sort
View
ENTCS
2002
139views more  ENTCS 2002»
13 years 4 months ago
Automatic Verification of the IEEE-1394 Root Contention Protocol with KRONOS and PRISM
We report on the automatic verification of timed probabilistic properties of the IEEE 1394 root contention protocol combining two existing tools: the real-time modelchecker Kronos...
Conrado Daws, Marta Z. Kwiatkowska, Gethin Norman
TACAS
2009
Springer
131views Algorithms» more  TACAS 2009»
13 years 11 months ago
Verifying Reference Counting Implementations
Reference counting is a widely-used resource management idiom which maintains a count of references to each resource by incrementing the count upon an acquisition, and decrementing...
Michael Emmi, Ranjit Jhala, Eddie Kohler, Rupak Ma...
APN
2007
Springer
13 years 11 months ago
Markov Decision Petri Net and Markov Decision Well-Formed Net Formalisms
In this work, we propose two high-level formalisms, Markov Decision Petri Nets (MDPNs) and Markov Decision Well-formed Nets (MDWNs), useful for the modeling and analysis of distrib...
Marco Beccuti, Giuliana Franceschinis, Serge Hadda...