855 search results - page 131 / 171 » Using First-Order Logic to Reason about Policies |
CADE
2006
Springer
14 years 9 months ago
2006
Springer
Abstract. Verification by network invariants is a heuristic to solve uniform verification of parameterized systems. Given a system P, a network invariant for P is that abstracts th...
ENC
2004
IEEE
14 years 18 days ago
2004
IEEE
Despite the relevance of the belief-desire-intention (BDI) model of rational agency, little work has been done to deal with its two main limitations: the lack of learning competen...
POPL
2009
ACM
14 years 9 months ago
2009
ACM
A concurrent data-structure implementation is considered nonblocking if it meets one of three following liveness criteria: waitfreedom, lock-freedom, or obstruction-freedom. Devel...
PLILP
1992
Springer
14 years 28 days ago
1992
Springer
The unfold/fold framework constitutes the spine of many program transformation strategies. However, by unrestricted use of folding the target program may terminate less often than...
USENIX
2007
13 years 11 months ago
2007
Current disk prefetch policies in major operating systems track access patterns at the level of the file abstraction. While this is useful for exploiting application-level access...