Sciweavers

5863 search results - page 372 / 1173
» On Model-Checking of P Systems
Sort
View
TACAS
2009
Springer
131views Algorithms» more  TACAS 2009»
16 years 2 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...
DATE
2009
IEEE
90views Hardware» more  DATE 2009»
16 years 2 months ago
Property analysis and design understanding
—Verification is a major issue in circuit and system design. Formal methods like bounded model checking (BMC) can guarantee a high quality of the verification. There are severa...
Ulrich Kühne, Daniel Große, Rolf Drechs...
ATAL
2009
Springer
16 years 2 months ago
Rational play and rational beliefs under uncertainty
Alternating-time temporal logic (atl) is one of the most influential logics for reasoning about agents’ abilities. Constructive Strategic Logic (csl) is a variant of atl for im...
Nils Bulling, Wojciech Jamroga
ISSTA
2009
ACM
16 years 2 months ago
Analyzing singularity channel contracts
This paper presents techniques for analyzing channel contract specifications in Microsoft Research’s Singularity operating system. A channel contract is a state machine that sp...
Zachary Stengel, Tevfik Bultan
QEST
2008
IEEE
16 years 1 months ago
Hintikka Games for PCTL on Labeled Markov Chains
We present Hintikka games for formulae of the probabilistic temporal logic PCTL and countable labeled Markov chains as models, giving an operational account of the denotational se...
Harald Fecher, Michael Huth, Nir Piterman, Daniel ...