Sciweavers

201 search results - page 18 / 41
» On the Decidability of Model-Checking for P Systems
Sort
View
DBSEC
2010
162views Database» more  DBSEC 2010»
15 years 1 months ago
Distributed and Secure Access Control in P2P Databases
The intent of peer data management systems (PDMS) is to share as much data as possible. However, in many applications leveraging sensitive data, users demand adequate mechanisms to...
Angela Bonifati, Ruilin Liu, Hui (Wendy) Wang
77
Voted
LICS
2009
IEEE
15 years 6 months ago
On the Computational Complexity of Verifying One-Counter Processes
—One-counter processes are pushdown systems over a singleton stack alphabet (plus a stack-bottom symbol). We study the complexity of two closely related verification problems ov...
Stefan Göller, Richard Mayr, Anthony Widjaja ...
JBCS
2002
102views more  JBCS 2002»
14 years 11 months ago
Configurable Data Integration Middleware System
This paper presents a new approach for generating configured and flexible middleware systems for integration of heterogeneous and distributed data. The configuration is based on t...
Álvaro Cesar P. Barbosa, Fabio Porto, Ruben...
92
Voted
FORMATS
2003
Springer
15 years 5 months ago
Analysis of Real Time Operating System Based Applications
This text is dedicated to modelling of real-time applications running under multitasking operating system. Theoretical background is based on timed automata by Alur and Dill. As th...
Libor Waszniowski, Zdenek Hanzálek
FSTTCS
2003
Springer
15 years 5 months ago
Tagging Makes Secrecy Decidable with Unbounded Nonces as Well
Tagging schemes have been used in security protocols to ensure that the analysis of such protocols can work with messages of bounded length. When the set of nonces is bounded, this...
Ramaswamy Ramanujam, S. P. Suresh