• Publications
  • Influence
Bisimulation congruences in safe ambients
A variant of Levi and Sangiorgi's Safe Ambients enriched with passwords is studied and a labelled bisimulation based equivalence which is proved to coincide with barbed congruence is given. Expand
Behavioral theory for mobile ambients
A context lemma is proved which shows that only parallel and nesting contexts need be examined to recover reduction barbed congruence, and refined proof methods involving up-to proof techniques are developed, which allow to verify a set of algebraic laws and the correctness of more complex examples. Expand
Typing and Subtyping Mobility in Boxed Ambients
A novel type system for Bugliesi et al.'s Boxed Ambients that combines value subtyping with mobility types is provided, making a promising framework to model open systems. Expand
An Observational Theory for Mobile Ad Hoc Networks
It is proved that the ( weak) labelled bisimilarity completely characterises (weak) reduction barbed congruence, a standard, branching-time, contextually-defined program equivalence. Expand
Communication and mobility control in boxed ambients
The calculus modifies the communication mechanism of BA, and introduces a new form of co-capability, inspired from Safe Ambients (SA) (with passwords), that registers incoming agents with the receiver ambient while at the same time performing access control. Expand
A bisimulation-based semantic theory of Safe Ambients
The notion of bisimulation is used to prove a set of algebraic laws that are subsequently exploited to prove more significant examples, and is proved to coincide with reduction barbed congruence. Expand
Communication Interference in Mobile Boxed Ambients
A variant of BA aimed at controlling communication interferences as well as mobility ones is studied, draws inspiration from Safe Ambients (SA) (with passwords) and modifies the communication mechanism of BA. Expand
Model Checking Ad Hoc Network Routing Protocols: ARAN vs. endairA
By model checking ARAN with the AVISPA Tool, this paper has discovered three attacks (a route disruption, a route diversion, and a creation of incorrect routing state), while the analysis of end air A revealed no attacks. Expand
An Observational Theory for Mobile Ad Hoc Networks (full version)
  • Massimo Merro
  • Computer Science, Mathematics
  • Inf. Comput.
  • 1 February 2009
This work proposes a process calculus to study the behavioural theory of Mobile Ad Hoc Networks and proves that the two semantics coincide, and uses the (bi)simulation proof method to formally prove a number of non-trivial properties of ad hoc networks. Expand
A timed calculus for wireless systems
The main behavioural equality of the calculus is a timed variant of barbed congruence, a standard branching-time and contextually-defined program equivalence, and a labelled bisimilarity which is applied to prove a number of algebraic laws. Expand