Sciweavers

164 search results - page 12 / 33
» A Decidable Fragment of Separation Logic
Sort
View
ENTCS
2007
113views more  ENTCS 2007»
13 years 7 months ago
On the Decidability of the Safety Problem for Access Control Policies
An access control system regulates the rights of users to gain access to resources in accordance with a specified policy. The rules in this policy may interact in a way that is n...
E. Kleiner, T. Newcomb
TOCL
2008
128views more  TOCL 2008»
13 years 7 months ago
A comprehensive combination framework
fragment enjoys suitable noetherianity conditions and admits an abstract version of a `KeislerShelah like' isomorphism theorem. We show that this general decidability transfer...
Silvio Ghilardi, Enrica Nicolini, Daniele Zucchell...
TCS
2011
13 years 2 months ago
Correctness of linear logic proof structures is NL-complete
We provide new correctness criteria for all fragments (multiplicative, exponential, additive) of linear logic. We use these criteria for proving that deciding the correctness of a...
Paulin Jacobé de Naurois, Virgile Mogbil
CORR
2010
Springer
74views Education» more  CORR 2010»
13 years 7 months ago
RAFDA: Middleware Supporting the Separation of Application Logic from Distribution Policy
Middleware technologies, often limit the way in which object classes may be used in distributed applications due to the fixed distribution policies imposed by the Middleware system...
Alan Dearle, Scott M. Walker, Stuart J. Norcross, ...
FOSSACS
2006
Springer
13 years 11 months ago
On Metric Temporal Logic and Faulty Turing Machines
Metric Temporal Logic (MTL) is a real-time extension of Linear Temporal Logic that was proposed fifteen years ago and has since been extensively studied. Since the early 1990s, it ...
Joël Ouaknine, James Worrell