Linearity, Persistence and Testing Semantics in the Asynchronous Pi-Calculus

Electronic Notes in Theoretical Computer Science

Volumn 194, Issue 2, 2008, Pages 59-84

  Cacciagrano, Diletta ^a   Corradini, Flavio ^a   Aranda, Jesús ^b,c   Valencia, Frank D ^b  

^a UNIVERSITY OF CAMERINO   (Italy)

^b ÉCOLE POLYTECHNIQUE   (France)

^c UNIVERSIDAD DEL VALLE   (Colombia)

Author keywords

Asynchronous Pi Calculus; Linearity; Persistence; Testing Semantics

Indexed keywords

COMPUTATION THEORY; COMPUTER PROGRAMMING LANGUAGES; DATA DESCRIPTION;

ASYNCHRONOUS PI-CALCULUS; LINEARITY; PERSISTENCE; TESTING SEMANTICS;

SEMANTICS;

EID: 38149059663     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2007.11.006     Document Type: Article

References (33)

1. J. Alves-Foss. An Efficient Secure Authenticated Group Key Exchange Algorithm for Large and Dynamic Groups. In Proceedings of the 23rd National Information Systems Security Conference, 2000
2. Amadio R., Lugiez D., and Vanackere V. On the Symbolic Reduction of Processes with Cryptographic Functions. TCS: Theoretical Computer Science 290 (2003)
3. Best E., de Boer F., and Palamidessi C. Partial order and sos semantics for linear constraint programs. Proc. of Coordination'97. LNCS volume 1282 (1997)
4. Blanchet B. From linear to classical logic by abstract interpretation. Information Processing Letters 95 5 (2005)
5. Boreale M., and Buscemi M. A Framework for the Analysis of Security Protocols. Lecture Notes in Computer Science 2421 (2002)
6. Brinksma E., Rensink A., and Vogler W. Fair Testing. Proc. of CONCUR'95. LNCS 962 (1995) 313-327
7. Cacciagrano D., and Corradini F. On Synchronous and Asynchronous Communication Paradigms. Proc. of ICTCS '01. LNCS 2202 (2001) 256-268
8. Cacciagrano D., Corradini F., and Palamidessi C. Separation of Synchronous and Asynchronous Communication Via Testing. Proc. of EXPRESS'05. Electr. Notes Theor. Comput. Sci. 154 3 (2006) 95-108 An extended version will appear in Theoretical Computer Science
9. Carbone M., and Maffeis S. On the Expressive Power of Polyadic Synchronisation in pi-calculus. Nord. J. Comput. 10 2 (2003) 70-98
10. Castellani I., and Hennessy M. Testing Theories for Asynchronous Languages. Proc. of FSTTCS '98. LNCS 1530 (1998) 90-101
11. F. Crazzolara. Language, Semantics, and Methods for Security Protocols. PhD Dissertation, University of Aarhus, Denmark, 2003
12. Crazzolara F., and Winskel G. Events in security protocols. Proceedings of the 8th ACM Conference on Computer and Communications Security (2001), ACM Press
13. De Nicola R., and Hennessy M. Testing Equivalence for Processes. Theoretical Computer Science 34 (1984) 83-133
14. Fages F., Ruet P., and Soliman S. Linear concurrent constraint programming: operational and phase semantics. Information and Computation (2001)
15. Fiore M., and Abadi M. Computing symbolic models for verifying cryptographic protocols. Proc. CSFW-14 (2001), IEEE
16. D. Gorla: On the Relative Expressive Power of Asynchronous Communication Primitives. FoSSaCS 2006, 47-62, 2006
17. D. Gorla: Synchrony vs Asynchrony in Communication Primitives Proc. of EXPRESS'06, 47-62, 2006
18. S. Maffeis and I. Phillips. On the computational strength of pure ambient calculi. Proc. of EXPRESS '03, 2003
19. Milner R. Communication and Concurrency (1989), Prentice-Hall International
20. Milner R., Parrow J., and Walker D. A Calculus of Mobile Processes, Part I and II. Information and Computation 100 (1992) 1-78
21. Merro M., and Sangiorgi D. On asynchrony in name-passing calculi. Proc. of ICALP '98. LNCS 1443 (1998)
22. Nestmann U. What is a 'Good' Encoding of Guarded Choice?. Information and Computation 156 (2000) 287-319
23. Palamidessi C. Comparing the Expressive Power of the Synchronous and Asynchronous π-calculus. Mathematical Structures in Computer Science 13 5 (2003) 685-719 A preliminary version appeared in the proceedings of POPL '97
24. C. Palamidessi, V. Saraswat, F. Valencia and B. Victor. On the Expressiveness of Linearity vs Persistence in the Asynchronous Pi Calculus. LICS 2006:59-68, 2006
25. L.C. Paulson. Mechanized proofs for a recursive authentication protocol. In 10th Computer Security Foundations Workshop, 1997
26. I. Phillips and M. Vigliotti Electoral Systems in Ambient Calculi. FoSSaCS'04. 2004
27. Phillips I., and Vigliotti M. Leader Election in Rings of Ambient Processes. Electr. Notes Theor. Comput. Sci. 128 2 (2005) 185-199
28. Prasad K.V.S. Broadcast Calculus Interpreted in CCS up to Bisimulation. Proceedings of Express'01. Electronic Notes in Theoretical Computer Science 52 (2002) 83-100 Elsevier
29. Sangiorgi D. The name discipline of uniform receptiveness. Theoretical Computer Science 221 1-2 (1999) 457-493
30. Sangiorgi D., and Walker D. The π-calculus: A Theory of Mobile Processes (2001), Cambridge University Press
31. V. Saraswat and P. Lincoln. Higher-order linear concurrent constraint programming. Technical report, Xerox PARC, 1992
32. Saraswat V. Concurrent Constraint Programming (1993), The MIT Press
33. Vigliotti M., Phillips I., and Palamidessi C. Separation Results Via Leader Election Problems. FMCO 2005 (2005) 172-194