2273 search results - page 271 / 455 » On the Expressiveness and Complexity of ATL |
169
click to vote
ESOP
2005
Springer
16 years 10 hour ago
2005
Springer
Are computing systems trustworthy? To answer this, we need to know three things: what the systems are supposed to do, what they are not supposed to do, and what they actually do. A...
189
click to vote
NPAR
2004
ACM
15 years 12 months ago
2004
ACM
ssionism”, (bottom row) “Abstract”, “Pointillism”, “Flower” and “Abstract” styles. Figure 3 shows some of the brush strokes used. We present techniques for trans...
193
click to vote
WOLLIC
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. We present a modal language that includes explicit operators to count the number of elements that a model might include in the extension of a formula, and we discuss how ...
184
click to vote
CIKM
1993
Springer
15 years 10 months ago
1993
Springer
match algorithms that can efficiently handleAbstract complex tests in the presence of large amounts of data. Match algorithms that are capable of handling large amounts of On the o...
169
click to vote
ECOOP
2008
Springer
15 years 8 months ago
2008
Springer
Verification of object-oriented programs relies on object invariants which express consistency criteria of objects. The semantics of object invariants is subtle, mainly because of...