154 search results - page 15 / 31 » Using Proofs by Coinduction to Find |
ESORICS
2007
Springer
13 years 11 months ago
2007
Springer
We present a new technique for generating a formal proof that an access request satisfies accesscontrol policy, for use in logic-based access-control frameworks. Our approach is t...
JALC
2002
13 years 7 months ago
2002
We define general algebraic frameworks for shortest-distance problems based on the structure of semirings. We give a generic algorithm for finding single-source shortest distances...
ICFP
2004
ACM
14 years 7 months ago
2004
ACM
Concurrency, as a useful feature of many modern programming languages and systems, is generally hard to reason about. Although existing work has explored the verification of concu...
IPM
2008
13 years 7 months ago
2008
Language modeling is an effective and theoretically attractive probabilistic framework for text information retrieval. The basic idea of this approach is to estimate a language mo...
SIAMCOMP
2002
13 years 7 months ago
2002
We consider several problems related to the use of resolution-based methods for determining whether a given boolean formula in conjunctive normal form is satisfiable. First, build...