Results 1 to 10 of about 10,135 (101)

Rewriting Modulo \beta in the \lambda\Pi-Calculus Modulo [PDF]

, 2015
The lambda-Pi-calculus Modulo is a variant of the lambda-calculus with dependent types where beta-conversion is extended with user-defined rewrite rules.
Saillard, Ronan
core   +23 more sources

Model checking probabilistic and stochastic extensions of the pi-calculus [PDF]

, 2009
We present an implementation of model checking for probabilistic and stochastic extensions of the pi-calculus, a process algebra which supports modelling of concurrency and mobility.
Norman, G., Palamidessi, C., Parker, D., Wu, P.   +3 more
core   +3 more sources

Acyclic Solos and Differential Interaction Nets [PDF]

, 2010
We present a restriction of the solos calculus which is stable under reduction and expressive enough to contain an encoding of the pi-calculus. As a consequence, it is shown that equalizing names that are already equal is not required by the encoding of ...
Ehrhard, Thomas, Laurent, Olivier
core   +2 more sources

Trees from Functions as Processes [PDF]

, 2018
Levy-Longo Trees and Bohm Trees are the best known tree structures on the {\lambda}-calculus. We give general conditions under which an encoding of the {\lambda}-calculus into the {\pi}-calculus is sound and complete with respect to such trees.
Sangiorgi, Davide, Xu, Xian
core   +4 more sources

The Attributed Pi Calculus with Priorities [PDF]

, 2010
International audienceWe present the attributed $\pi$-calculus for modeling concurrent systems with interaction constraints depending on the values of attributes of processes.
A. Phillips, A. Regev, A. Regev, B.N. Kholodenko, C. Kuttler, C. Priami, C. Priami, C. Priami, C. Versari, D. Degenring, D. Gilbert, D.T. Gillespie, D.T. Gillespie, F. Ciocchetta, G.P. Huet, J. Hillston, J. Himmelspach, J. Jaffar, J. Krivine, J. Niehren, J.C. Mitchell, J.R. Faeder, K.G. Grell, L. Bortolussi, L. Cardelli, L. Cardelli, M. Baldamus, M. Carbone, M. Johansson, M. John, M. John, M. John, M. Maurin, M.A. Gibson, M.L. Guerriero, V. Danos, V. Danos, V.A. Saraswat, W.W. Tait   +38 more
core   +4 more sources

A Distribution Law for CCS and a New Congruence Result for the pi-calculus [PDF]

, 2007
We give an axiomatisation of strong bisimilarity on a small fragment of CCS that does not feature the sum operator. This axiomatisation is then used to derive congruence of strong bisimilarity in the finite pi-calculus in absence of sum. To our knowledge,
Damien Pous, Daniel Hirschkoff, Helmut Seidl   +2 more
core   +11 more sources

A Fully Abstract Symbolic Semantics for Psi-Calculi

, 2010
We present a symbolic transition system and bisimulation equivalence for psi-calculi, and show that it is fully abstract with respect to bisimulation congruence in the non-symbolic semantics.
A. M. Pitts, Bartek Klin, Björn Victor, Björn Victor, Bruno Blanchet, Bruno Blanchet, Davide Sangiorgi, Huimin Lin, Huimin Lin, Jesper Bengtson, Jesper Bengtson, Joachim Parrow, Johannes Borgström, Johannes Borgström, Johannes Borgström, Magnus Johansson, Maria Grazia Buscemi, Mart'ı n Abadi, Mart'ı n Abadi, Mart'ı n Abadi, Mathieu Baudet, Matthew Hennessy, Michele Boreale, Murdoch Gabbay, Paweł Sobociński, Stéphanie Delaune, Sébastien Briais   +26 more
core   +3 more sources

A Stochastic Broadcast Pi-Calculus [PDF]

, 2011
In this paper we propose a stochastic broadcast PI-calculus which can be used to model server-client based systems where synchronization is always governed by only one participant. Therefore, there is no need to determine the joint synchronization rates.
A. Aldini, Bo Friis Nielsen, C. Priami, C.A.R. Hoare, Flemming Nielson, Gethin Norman, H. Hermanns, H. Hermanns, H.S. Lee, J. Hillston, J. Hillston, J.A. Bergstra, J.P. Buzen, Lei Song, M. Bernardo, M. Bernardo, M. Bernardo, M. Bernardo, M.G. Vigliotti, Mieke Massink, N. Götz, N.M. van Dijk, P.G. Harrison, R. De Nicola, R. De Nicola, R. Milner   +25 more
core   +5 more sources

On the Distributability of Mobile Ambients [PDF]

, 2018
Modern society is dependent on distributed software systems and to verify them different modelling languages such as mobile ambients were developed. To analyse the quality of mobile ambients as a good foundational model for distributed computation, we ...
Nestmann, Uwe, Peters, Kirstin
core   +2 more sources

Type systems for distributed programs: session communication [PDF]

, 2015
Distributed systems are everywhere around us and guaranteeing their correctness is of paramount importance. It is natural to expect that these systems interact and communicate among them to achieve a common task.
Dardha, Ornela
core