Author:
Bruni Roberto,Montanari Ugo,Sassone Vladimiro
Subject
General Computer Science,Theoretical Computer Science
Reference43 articles.
1. P. Baldan, A. Bracciali, R. Bruni, Bisimulation by unification, in: H. Kirchner, Ringeissen (Eds.), Proc. AMAST 2002, 9th Internat. Conf. on Algebraic Methodology And Software Technology, Lecture Notes in Computer Science, Vol. 2422, 2002, pp. 254–270.
2. A congruence theorem for structured operational semantics of higher-order languages;Bernstein,1998
3. The chemical abstract machine;Berry;Theoret. Comput. Sci.,1992
4. Bisimulation can’t be traced;Bloom;J. ACM,1995
5. R. Bruni, D. de Frutos-Escrig, N. Martí-Oliet, U. Montanari, Bisimilarity congruences for open terms and term graphs via tile logic, in: C. Palamidessi (Ed.), Proc. CONCUR 2000, 11th Internat. Conf. on Concurrency Theory, Lecture Notes in Computer Science, Vol. 1877, Springer, Berlin, 2000, pp. 259–274.
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献