1894 search results - page 238 / 379 » A TLA Proof System |
138
click to vote
WOSP
2010
ACM
15 years 11 months ago
2010
ACM
In this paper we provide a general method to derive productform solutions for stochastic models. We take inspiration from the Reversed Compound Agent Theorem [14] and we provide a...
129
click to vote
CONCUR
2009
Springer
15 years 11 months ago
2009
Springer
We present a new algorithm for computing the winning region of a parity game played over the configuration graph of a pushdown system. Our method gives the first extension of the...
158
click to vote
TARK
2009
Springer
15 years 11 months ago
2009
Springer
The logical omniscience feature assumes that an epistemic agent knows all logical consequences of her assumptions. This paper offers a general theoretical framework that views log...
126
click to vote
APLAS
2009
ACM
15 years 11 months ago
2009
ACM
Separation Algebras serve as models of Separation Logics; Share Accounting allows reasoning about concurrent-read/exclusive-write resources in Separation Logic. In designing a Conc...
143
click to vote
APLAS
2009
ACM
15 years 11 months ago
2009
ACM
Restricting destructive update to values of a distinguished reference type prevents functions from being polymorphic in the mutability of their arguments. This restriction makes it...