Sciweavers

408 search results - page 25 / 82
» Relation Algebras for Reasoning about Time and Space
Sort
View
BIRTHDAY
2005
Springer
14 years 2 months ago
Compiled Labelled Deductive Systems for Access Control
This paper proposes a Compiled Labelled Deductive System, called ACCLDS, for reasoning about role-based access control in distributed systems, which builds upon Massacci’s tablea...
Krysia Broda, Alessandra Russo
CSL
2010
Springer
13 years 10 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
CADE
1998
Springer
14 years 1 months ago
Admissibility of Fixpoint Induction over Partial Types
Partial types allow the reasoning about partial functions in type theory. The partial functions of main interest are recursively computed functions, which are commonly assigned ty...
Karl Crary
IJRR
2002
129views more  IJRR 2002»
13 years 8 months ago
Deformable Free-Space Tilings for Kinetic Collision Detection
We present kinetic data structures for detecting collisions between a set of polygons that are moving continuously. Unlike classical collision detection methods that rely on bound...
Pankaj K. Agarwal, Julien Basch, Leonidas J. Guiba...
KI
2010
Springer
13 years 7 months ago
Positions, Regions, and Clusters: Strata of Granularity in Location Modelling
Location models are data structures or knowledge bases used in Ubiquitous Computing for representing and reasoning about spatial relationships between so-called smart objects, i.e....
Hedda Rahel Schmidtke, Michael Beigl