Complete lattices and up-to techniques

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

Volumn 4807 LNCS, Issue , 2007, Pages 351-366

  Pous, Damien ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; ITERATIVE METHODS; MATHEMATICAL OPERATORS;

COMPLETE LATTICES; LABELLED TRANSITIONS SYSTEMS; MONOID OPERATIONS; SEMI-COMMUTATION PROPERTY;

THEOREM PROVING;

EID: 38149066853     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-76637-7_24     Document Type: Conference Paper

References (20)

1. Arun-Kumar, S., Hennessy, M.: An efficiency preorder for processes. Acta Informatica 29(9), 737-760 (1992)
2. Arun-Kumar, S., Natarajan, V.: Conformance: A precongruence close to bisimilarity. In: Proc. Struct, in Concurrency Theory, Springer, London (1995)
3. Davey, B., Priestley, H.: Introduction to Lattices and Order. Cambridge University Press, Cambridge (1990)
4. Doornbos, H., Backhouse, R., van der Woude, J.: A calculational approach to mathematical induction. Theoretical Computer Science 179(1-2), 103-135 (1997)
5. Fournet, C., Lévy, J.-J., Schmitt, A.: An asynchronous, distributed implementation of mobile ambients. In: Watanabe, O., Hagiya, M., Ito, T., van Leeuwen, J., Mosses, P.D. (eds.) TCS 2000. LNCS, vol. 1872, pp. 348-364. Springer, Heidelberg (2000)
6. Fournet, C., Gonthier, G.: A hierarchy of equivalences for asynchronous calculi. Journal of Logic and Algebraic Programming 63(1), 131-173 (2005)
7. Hennessy, M., Rathke, J.: Typed behavioural equivalences for processes in the presence of subtyping. Math. Struct. in Computer Science 14(5), 651-684 (2004)
8. Honda, K., Yoshida, N.: Kohei Honda and Nobuka Yoshida. Theoretical Computer Science 151(2), 437-486 (1995)
9. Howe, D.J.: Proving congruence of bisimulation in functional programming languages. Information and Computation 124, 103-112 (1996)
10. Lassen, S.B.: Relational reasoning about contexts. In: Gordon, A.D., Pitts, A.M. (eds.) Higher Order Operational Techniques in Semantics, Cambridge University Press, Cambridge (1998)
11. Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)
12. Pous, D.: On bisimulation proofs for the analysis of distributed abstract machines. In: Montanari, U., Sannella, D. (eds.) Proc. TGC 2006. LNCS, vol. 4661, Springer, Heidelberg (2007)
13. Pous, D.: Weak bisimulation up to elaboration. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol. 4137, pp. 390-405. Springer, Heidelberg (2006)
14. Pous, D.: New up-to techniques for weak bisimulation. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, Springer, Heidelberg (2005)
15. Sangiorgi, D.: On the bisimulation proof method. Journal of Math. Struct, in Computer Science 8, 447-479 (1998)
16. Sangiorgi, D.: Personal communication (2006)
17. Sangiorgi, D., Kobayashi, N., Sumii, E.: Environmental bisimulations for higher-order languages. In: LICS 2007, pp. 293-302. IEEE Computer Society Press, Los Alamitos (2007)
18. Sangiorgi, D., Milner, R.: The problem of "weak bisimulation up to. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol. 630, pp. 32-46. Springer, Heidelberg (1992)
19. Sangiorgi, D., Walker, D.: The π-calculus: a Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)
20. Tarski, A.: A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics 5(2), 285-309 (1955)