Sciweavers

3387 search results - page 539 / 678
» Model-Checking for Real-Time Systems
Sort
View
114
Voted
LATA
2009
Springer
15 years 7 months ago
Rigid Tree Automata
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a rest...
Florent Jacquemard, Francis Klay, Camille Vacher
105
Voted
TACAS
2009
Springer
131views Algorithms» more  TACAS 2009»
15 years 7 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...
128
Voted
DATE
2009
IEEE
90views Hardware» more  DATE 2009»
15 years 7 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...
119
Voted
ATAL
2009
Springer
15 years 7 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
96
Voted
ISSTA
2009
ACM
15 years 7 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