Sciweavers

3446 search results - page 15 / 690
» A Reasoning Algorithm for pD*
Sort
View
PPOPP
2012
ACM
13 years 8 months ago
Internally deterministic parallel algorithms can be fast
The virtues of deterministic parallelism have been argued for decades and many forms of deterministic parallelism have been described and analyzed. Here we are concerned with one ...
Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gib...
CORR
2008
Springer
154views Education» more  CORR 2008»
15 years 1 months ago
Coinductive Formal Reasoning in Exact Real Arithmetic
In this article we present a method for formally proving the correctness of the lazy algorithms for computing homographic and quadratic transformations -- of which field operations...
Milad Niqui
DLOG
2004
15 years 2 months ago
Efficient Reasoning with Range and Domain Constraints
We show how a tableaux algorithm for SHIQ can be extended to support role boxes that include range and domain axioms, prove that the extended algorithm is still a decision procedur...
Dmitry Tsarkov, Ian Horrocks
CONCUR
2010
Springer
15 years 2 months ago
Reasoning about Optimistic Concurrency Using a Program Logic for History
Optimistic concurrency algorithms provide good performance for parallel programs but they are extremely hard to reason about. Program logics such as concurrent separation logic and...
Ming Fu, Yong Li, Xinyu Feng, Zhong Shao, Yu Zhang
DLOG
2011
14 years 4 months ago
Goal-oriented Query Rewriting for OWL 2 QL
We present an optimized query rewriting algorithm for OWL 2 QL that computes the rewriting set of a user query by avoiding unnecessary inferences and extended clause subsumption ch...
Alexandros Chortaras, Despoina Trivela, Giorgos B....