Sciweavers

620 search results - page 33 / 124
» Decidability Problems for Actor Systems
Sort
View
ACTA
2010
104views more  ACTA 2010»
14 years 9 months ago
Reachability results for timed automata with unbounded data structures
Systems of Data Management Timed Automata (SDMTAs) are networks of communicating timed automata with structures to store messages and functions to manipulate them. We prove the dec...
Ruggero Lanotte, Andrea Maggiolo-Schettini, Angelo...
ENTCS
2006
103views more  ENTCS 2006»
14 years 9 months ago
Static Equivalence is Harder than Knowledge
There are two main ways of defining secrecy of cryptographic protocols. The first version checks if the adversary can learn the value of a secret parameter. In the second version,...
Johannes Borgström
ISMAR
2009
IEEE
15 years 4 months ago
Using AR to support cross-organisational collaboration in dynamic tasks
This paper presents a study where Augmented Reality (AR) technology has been used as a tool for supporting collaboration between the rescue services, the police and military perso...
Susanna Nilsson, Björn J. E. Johansson, Arne ...
PLDI
2009
ACM
15 years 2 months ago
Flow-sensitive semantics for dynamic information flow policies
Dynamic information flow policies, such as declassification, are essential for practically useful information flow control systems. However, most systems proposed to date that ...
Niklas Broberg, David Sands
FOSSACS
2010
Springer
15 years 4 months ago
Forward Analysis of Depth-Bounded Processes
Depth-bounded processes form the most expressive known fragment of the π-calculus for which interesting verification problems are still decidable. In this paper we develop an ade...
Thomas Wies, Damien Zufferey, Thomas A. Henzinger