Sciweavers

49 search results - page 9 / 10
» Typing Mobility in the Seal Calculus
Sort
View
TCS
2008
13 years 5 months ago
Role-based access control for boxed ambients
Our society is increasingly moving towards richer forms of information exchange where mobility of processes and devices plays a prominent role. This tendency has prompted the acad...
Adriana B. Compagnoni, Elsa L. Gunter, Philippe Bi...
CONCUR
2006
Springer
13 years 9 months ago
Concurrent Rewriting for Graphs with Equivalences
Several applications of graph rewriting systems (notably, some encodings of calculi with name passing) require rules which, besides deleting and generating graph items, are able to...
Paolo Baldan, Fabio Gadducci, Ugo Montanari
IFIP
2004
Springer
13 years 10 months ago
Nested Commits for Mobile Calculi: Extending Join
In global computing applications the availability of a mechanism for some form of committed choice can be useful, and sometimes necessary. It can conveniently handle, e.g., distrib...
Roberto Bruni, Hernán C. Melgratti, Ugo Mon...
FOSSACS
2004
Springer
13 years 10 months ago
safeDpi: A Language for Controlling Mobile Code
safeDpi is a distributed version of the Picalculus, in which processes are located at dynamically created sites. Parametrised code may be sent between sites using so-called ports, ...
Matthew Hennessy, Julian Rathke, Nobuko Yoshida
ENTCS
2007
126views more  ENTCS 2007»
13 years 5 months ago
Modelling Calculi with Name Mobility using Graphs with Equivalences
In the theory of graph rewriting, the use of coalescing rules, i.e., of rules which besides deleting and generating graph items, can coalesce some parts of the graph, turns out to...
Paolo Baldan, Fabio Gadducci, Ugo Montanari