TY  - JOUR
JF  - Electronic Notes in Theoretical Computer Science
N2  - Under several regards, various of the recently proposed computational paradigms are open-ended, i.e. they may comprise components whose behaviour is not or cannot be fully specified. For instance, applications can be distributed across different administration domains that do not fully disclose their internal business processes to each other, or the dynamics of the system may allow reconfigurations and dynamic bindings whose specification is not available at design time. While a large set of mature design and analysis techniques for closed systems have been developed, their lifting to the open case is not always straightforward. Some existing approaches in the process calculi community are based on the need of proving properties for components that may hold in any, or significantly many, execution environments. Dually, frameworks describing the dynamics of systems with unspecified components have also been presented. In this paper we lay some preliminary ideas on how to extend a symbolic semantics model for open systems in order to deal with name-based calculi. Moreover, we also discuss how the use of a simple type system based on name-decoration for unknown components can improve the expressiveness of the framework. The approach is illustrated on a simple, paradigmatic calculus of web crawlers, which can be understood as a term representation of a simple class of graphs.
SN  - 1571-0661
Y1  - 2009///
AV  - public
ID  - eprints150
TI  - On symbolic semantics for name-decorated contexts
UR  - http://www.sciencedirect.com/science/article/B75H1-4WRDYC9-4/2/834fb7bf6ce2da8faead48d05622258f
IS  - 3
KW  - Open Systems; Abstract Semantics; Nominal Calculi; Type Systems
VL  - 229
PB  - Elsevier
EP  - 58
SP  - 37
A1  - Bracciali, Andrea
A1  - Bruni, Roberto
A1  - Lluch-Lafuente, Alberto
ER  -