Milner's bigraphs [1] are a general framework for reasoning about distributed and concurrent programming languages. Notably, it has been designed to encompass both the -calcul...
The complexity and the variety of the deployed timedependent systems, as well as the high degree of reliability required for their global functioning, justify the care provided to...
Ana R. Cavalli, Edgardo Montes de Oca, Wissam Mall...
This paper suggests a new measure of symmetry for bifurcating structures, which relies not only on topology and ordering, but also on quantitative properties (e.g. length of branc...
David Milner, Hagit Hel-Or, Daniel Keren, Shmuel R...
We consider the problem if a given program satisfies a specified safety property. Interesting programs have infinite state spaces, with inputs ranging over infinite domains, and f...
Bhargav S. Gulavani, Thomas A. Henzinger, Yamini K...
We introduce the νSPI-calculus that strengthens the notion of “perfect symmetric cryptography” of the spi-calculus by taking time into account. This involves defining an oper...