Papers by Damiano Macedonio
Lecture Notes in Computer Science, 2015
... 202(1-2):1-54, 1998. 12] \A Process Algebraic View of Linda Coordination Primitives", di... more ... 202(1-2):1-54, 1998. 12] \A Process Algebraic View of Linda Coordination Primitives", di N.Busi, R.Gorrieri, G.Zavattaro, Theoretical Computer Science, 192 (2):167-199, 1998. 13] \Performance Preorder and Competitive Equivalence ...
Lecture Notes in Computer Science, 2014
This paper uses the statistical model checking tool in the UP-PAAL toolset to test the robustness... more This paper uses the statistical model checking tool in the UP-PAAL toolset to test the robustness of a distributed clock synchronization algorithm for wireless sensor networks (WSN), in the case of lossy communication, i.e., when the WSN is deployed in an environment with significant multi-path propagation, leading to interference. More precisely , the robustness of the gMAC protocol included in the Chess WSN platform is tested on two important classes of regular network topologies: cliques (networks with full connectivity) and small grids (where all nodes have the same degree). The paper extends previous work by Hedaraian et al. that only analyzed this algorithm in the ideal case of non-lossy communication, and only in the case of cliques and line topologies. The main contribution is to show that the original clock synchronization algorithm is not robust to changing the quality of communication between sensors. More precisely, with high probability the algorithm fails to synchronize the nodes when considering lossy communication over cliques of arbitrary size, as well as over small grid topologies.
Asian Computing Science Conference, 2007
Traditional static typing systems for the pi-calculus are built around capability types that cont... more Traditional static typing systems for the pi-calculus are built around capability types that control the read/write access right on channels and describe the type of their payload. While static typing has proved adequate for reason- ing on process behavior in typed contexts, dynamic techniques have often been advocated as more e ective for access control in distributed/untyped contexts. We study
An intuitionistic, hybrid modal logic suitable for reasoning about distribution of re- sources wa... more An intuitionistic, hybrid modal logic suitable for reasoning about distribution of re- sources was introduced in (10). We extend the Kripke semantics of intuitionistic logic, enriching each possible Kripke state with a set of places, and show that this semantics is both sound and com- plete for the logic. In the semantics, resources of a distributed system are interpreted as
Journal of Logic and Computation, 2006
An intuitionistic, hybrid modal logic suitable for reasoning about distri- bution of resources wa... more An intuitionistic, hybrid modal logic suitable for reasoning about distri- bution of resources was introduced in (14, 15). The modalities of the logic allow us to validate properties in a particular place, in some place and in all places. We give a sound and complete Kripke semantics for the logic ex- tended with disjunctive connectives. The extended logic can be
Bigraphs are emerging as a (meta-)model for concurrent calculi, like CCS, ambients, - calculus, a... more Bigraphs are emerging as a (meta-)model for concurrent calculi, like CCS, ambients, - calculus, and Petri nets. They are built orthogonally on two structures: a hierarchical place graph for locations and a link (hyper-)graph for connections. Aiming at describing bigraph- ical structures, we introduce a general framework, BiLog, whose formulae describe arrows in monoidal categories. We then instantiate the framework
Service Oriented Architectures draw heavily on techniques for reusing and assembling o-the-shelf ... more Service Oriented Architectures draw heavily on techniques for reusing and assembling o-the-shelf software components. While pow- erful, this programming practice is not without a cost: the software ar- chitect must ensure that the o-the-shelf components interact safely and in ways that conform with the specification. Moreover, new services can replace the existing ones and a kind of substitutivity between contracts
Information flow security in a multilevel system aims at guaranteeing that no high level informat... more Information flow security in a multilevel system aims at guaranteeing that no high level information is revealed to low levels. A usual requirement to ensure information flow security for a process is that no generic attacker can induce a high-to-low information flow. This requirement is too demanding when we have some knowledge about the contexts where the process is going
Journal of Computer Security, 2005
Information flow security in a multilevel system aims at guar anteeing that no high level informa... more Information flow security in a multilevel system aims at guar anteeing that no high level information is revealed to low level users, even in the presence of any possible malicious process. This requirement could be stronger than necessary when some knowledge about the environment (context) in which the process is going to run is available. To relax this requirement we
Lecture Notes in Computer Science, 2010
We introduce a calculus with mobile names, distributed principals and primitives for secure remot... more We introduce a calculus with mobile names, distributed principals and primitives for secure remote communication, without any reference to explicit cryptography. The calculus is equipped with a system of types and effects providing static guarantees of secrecy and authenticity in the presence of a Dolev-Yao intruder. The novelty with respect to existing type systems for security is in the structure of our secrecy and authenticity types, which are inspired by the formulas of BAN Logic, and retain much of the simplicity and intuitive reading of such formulas. Drawing on these types, the type system makes it possible to characterize authenticity directly as a property of the data exchanged during a protocol rather than indirectly by extracting and interpreting the effects the protocol has on that data. Work partially supported by MIUR Projects SOFT "Security Oriented Formal Techniques" and IPODS "Interacting Processes in Open-ended Distributed Systems".
2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2008
Service Oriented Architectures draw heavily on techniques for reusing and assembling off-the-shel... more Service Oriented Architectures draw heavily on techniques for reusing and assembling off-the-shelf software components. While powerful, this programming practice is not without a cost: the software architect must ensure that the off-the-shelf components interact safely and in ways that conform with the specification. We develop a new theory for adaptable service compositions. The theory provides an effective framework for analyzing the conformance of contract-based service compositions, and for enforcing their compliance, in a uniform, and formally elegant setting.
Lecture Notes in Computer Science, 2012
16th IEEE Computer Security Foundations Workshop, 2003. Proceedings., 2003
Information flow security in a multilevel system aims at guaranteeing that no high level informat... more Information flow security in a multilevel system aims at guaranteeing that no high level information is revealed to low level users, even in the presence of any possible malicious process. This requirement could be too demanding when some knowledge about the environment (context) in which the process is going to run is available. To deal with these situations we introduce the notion of secure contexts for a class of processes. This notion is parametric with respect to both the observation equivalence and the operation used to characterize the low level behavior of a process. We mainly analyze the cases of bisimulation and trace equivalence. We describe how to build secure contexts in these cases and we show that two well-known security properties, named BNDC and NDC, are just special instances of our general notion. * This work has been partially supported by MURST project "Modelli formali per la sicurezza" and the EU project MyThS (IST-2001-32617).
Lecture Notes in Computer Science, 2005
Bigraphs are emerging as a (meta-)model for concurrent calculi, like CCS, ambients, πcalculus, an... more Bigraphs are emerging as a (meta-)model for concurrent calculi, like CCS, ambients, πcalculus, and Petri nets. They are built orthogonally on two structures: a hierarchical place graph for locations and a link (hyper-)graph for connections. Aiming at describing bigraphical structures, we introduce a general framework, BiLog, whose formulae describe arrows in monoidal categories. We then instantiate the framework to bigraphical structures and we obtain a logic that is a natural composition of a place graph logic and a link graph logic. We explore the concepts of separation and sharing in these logics and we prove that they generalise well known spatial logics for trees, graphs and tree contexts. As an application, we show how XML data with links and web services can be modelled by bigraphs and described by BiLog. The framework can be extended by introducing dynamics in the model and a standard temporal modality in the logic. However, in some cases, temporal modalities can be already expressed in the static framework. To testify this, we show how to encode a minimal spatial logic for CCS in an instance of BiLog.
Uploads
Papers by Damiano Macedonio