Sciweavers

164 search results - page 15 / 33
» A Decidable Fragment of Separation Logic
Sort
View
CSL
2010
Springer
13 years 8 months ago
Ordered Sets in the Calculus of Data Structures
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints...
Viktor Kuncak, Ruzica Piskac, Philippe Suter
FOSSACS
2010
Springer
14 years 2 months ago
On the Relationship between Spatial Logics and Behavioral Simulations
Abstract. Spatial logics have been introduced to reason about distributed computation in models for concurrency. We first define a spatial logic for a general class of infinite-...
Lucia Acciai, Michele Boreale, Gianluigi Zavattaro
CORR
2010
Springer
147views Education» more  CORR 2010»
13 years 4 months ago
RAFDA: A Policy-Aware Middleware Supporting the Flexible Separation of Application Logic from Distribution
Middleware technologies often limit the way in which object classes may be used in distributed applications due to the fixed distribution policies that they impose. These policies...
Scott M. Walker, Alan Dearle, Stuart J. Norcross, ...
IJCAI
2007
13 years 9 months ago
Tractable Temporal Reasoning
Temporal reasoning is widely used within both Computer Science and A.I. However, the underlying complexity of temporal proof in discrete temporal logics has led to the use of simp...
Clare Dixon, Michael Fisher, Boris Konev
DLOG
2009
13 years 5 months ago
On Correspondences between Probabilistic First-Order and Description Logics
Abstract This paper analyzes the probabilistic description logic PSHIQ by looking at it as a fragment of probabilistic first-order logic with semantics based on possible worlds. We...
Pavel Klinov, Bijan Parsia, Ulrike Sattler