Bisimulation by unification

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2422, Issue , 2002, Pages 254-270

  Baldan, Paolo ^a   Bracciali, Andrea ^b   Bruni, Roberto ^b  

^a CA' FOSCARI UNIVERSITY OF VENICE   (Italy)

^b UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; PATHOLOGY; SEMANTICS;

AMBIENTS; BISIMILARITY; BISIMULATIONS; OPERATIONAL SEMANTICS; PROCESS CALCULI; SYMBOLIC SEMANTICS;

OPEN SYSTEMS;

EID: 84944076437     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45719-4_18     Document Type: Conference Paper

References (25)

1. M. Abadi and M. P. Fiore. Computing symbolic models for verifying cryptographic protocols. In Proc. 14th IEEE Computer Security Foundations Workshop, pp. 160–173. IEEE, 2001. 269
2. R. Allen and D. Garlan. A Formal Basis for Architectural Connectors. ACM TOSEM, 6(3), pp. 213–249, 1997. 269
3. L. F. Andrade, J. L. Fiadeiro, J. Gouveia, G. Koutsoukos and M. Wermelinger. Coordination for Orchestration. In Coordination Models and Languages, 5th Int. Conference COORDINATION. Lect. Notes in Comput. Sci. 2315 pp. 5–13. Springer 2002. 269
4. F. Baader and W. Snyder. Unification theory. In Handbook of Automated Reasoning. Elsevier Science, 2000. 266
5. M. Boreale. Symbolic trace analysis of cryptographic protocols. In Proc. ICALP’01, Lect. Notes in Comput. Sci. 2076, pp. 667–681. Springer, 2001. 269
6. R. Bruni, D. de Fru tos-Escrig, N. Martí-Oliet, and U. Montanari. Bisimilarity congruences for open terms and term graphs via tile logic. In Proc. CONCUR 2000, Lect. Notes in Comput. Sci. 1877, pp. 259–274. Springer, 2000. 256
7. R. Bruni, U. Montanari, and F. Rossi. An interactive semantics of logic programming. Theory and Practice of Logic Programming, 1(6): 647–690, 2001. 257
8. L. Caires. A Model for Declarative Programming and Specification with Concurrency and Mobility. PhD thesis, Departamento de Informática, Universidade Nova de Lisboa, 1999. 256, 262
9. L. Caires and L. Cardelli. A spatial logic for concurrency (part I). In Proc. TACS 2001, Lect. Notes in Comput. Sci. 2215, pp. 1–37. Springer, 2001. 269
10. L. Caires and L. Cardelli. A spatial logic for concurrency (part II). In Proc. CONCUR 2002. Lect. Notes in Comput. Sci., Springer, 2002. To appear. 269
11. L. Cardelli and A. D. Gordon. Anytime, anywhere. modal logics for mobile ambients. In Proc. POPL 2000, pp. 365–377. ACM, 2000. 256, 262
12. L. Cardelli and A. D. Gordon. Mobile ambients. In Proc. FoSSaCS’98, Lect. Notes in Comput. Sci. 1378, pp. 140–155. Springer, 1998. 266
13. E. M. Clarke, S. Jha, and W. Marrero. Using state space exploration and a natural deduction style message derivation engine to verify security protocols. In Proc. PROCOMET’98. Chapmann & Hall, 1998. 269
14. R. De Simone. Higher level synchronizing devices in MEIJE-SCCS. TCS, 37: 245–267, 1985. 262
15. J. L. Fiadeiro, T. Maibaum, N. Martí-Oliet, J. Meseguer, and I. Pita. Towards a verification logic for rewriting logic. In Proc. WADT’99, LNCS 1827, pp. 438–458. Springer, 2000. 256
16. F. Gadducci and U. Montanari. The tile model. In Proof, Language and Interaction: Essays in Honour of Robin Milner. MIT Press, 2000. 256, 262
17. M. Hennessy and H. Lin. Symbolic bisimulations. Theoret. Comp. Sci., 138: 353–389, 1995. 256
18. A. Herold and J. Siekmann. Unification in abelian semi-groups. Journal of Automated Reasoning, 3(3): 247–283, 1987. 266
19. K. G. Larsen and L. Xinxin. Compositionality through an operational semantics of contexts. In Proc. ICALP’90, Lect. Notes in Comput. Sci. 443, pp. 526–539. Springer, 1990. 256
20. J. J. Leifer and R. Milner. Deriving bisimulation congruences for reactive systems. In Proc. CONCUR 2000, Lect. Notes in Comput. Sci. 1877, pp. 243–258. Springer, 2000. 255, 269
21. R. Milner. A Calculus of Communicating Systems, LNCS 92. Springer, 1980. 266
22. U. Montanari and V. Sassone. Dynamic congruence vs. progressing bisimulation for CCS. Fundamenta Informaticae, 16: 171–196, 1992. 255
23. G. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Aarhus University, Computer Science Department, 1981. 255
24. A. Rensink. Bisimilarity of open terms. Inform. and Comput., 156(1-2): 345–385, 2000. 256
25. P. Sewell. From rewrite rules to bisimulation congruences. In Proc. CONCUR’98, Lect. Notes in Comput. Sci. 1466, pp. 269–284. Springer, 1998. 255, 269