691 search results - page 11 / 139 » Automatically Proving Linearizability |
106
click to vote
IJCAI
2003
15 years 1 months ago
2003
Query answering over commonsense knowledge bases typically employs a first-order logic theorem prover. While first-order inference is intractable in general, provers can often b...
111
click to vote
IS
2006
14 years 11 months ago
2006
This paper introduces a method for automatic composition of Semantic Web services using Linear Logic (LL) theorem proving. The method uses a Semantic Web service language (DAML-S)...
102
click to vote
JAR
2000
14 years 11 months ago
2000
We report our effort to build a geometry deductive database, which can be used to find the fixpoint for a geometric configuration. The system can find all the properties of the con...
173
click to vote
POPL
2009
ACM
16 years 12 days 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...
SP
2005
IEEE
15 years 5 months ago
2005
IEEE
We present a distributed algorithm for assembling a proof that a request satisfies an access-control policy expressed in a formal logic, in the tradition of Lampson et al. [16]. ...