Sciweavers

217 search results - page 12 / 44
» Display Calculi for Logics with Relative Accessibility Relat...
Sort
View
ADC
2004
Springer
87views Database» more  ADC 2004»
14 years 1 months ago
On the Computation of Approximations of Database Queries
Reflective Relational Machines were introduced by S. Abiteboul, C. Papadimitriou and V. Vianu in 1994, as variations of Turing machines which are suitable for the computation of ...
Flavio Antonio Ferrarotti, Jose Maria Turull Torre...
ICST
2008
IEEE
14 years 2 months ago
Test-Driven Assessment of Access Control in Legacy Applications
If access control policy decision points are not neatly separated from the business logic of a system, the evolution of a security policy likely leads to the necessity of changing...
Yves Le Traon, Tejeddine Mouelhi, Alexander Pretsc...
DEON
2010
Springer
13 years 9 months ago
A Dyadic Operator for the Gradation of Desirability
We propose a normal modal deontic logic based on a dyadic operator, similar in structure to the temporal "until". By bringing significant expressiveness to the logic, it ...
Guillaume Piolle
LFCS
2009
Springer
14 years 2 months ago
Completeness Results for Memory Logics
Memory logics are a family of modal logics in which standard relational structures are augmented with data structures and additional operations to modify and query these structure...
Carlos Areces, Santiago Figueira, Sergio Mera
CSL
2001
Springer
14 years 10 days ago
Decidable Navigation Logics for Object Structures
In this paper, we introduce decidable multimodal logics to describe and reason about navigation across object structures. The starting point of these navigation logics is the model...
Frank S. de Boer, Rogier M. van Eijk