Bisimulations for untyped imperative objects

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

Volumn 3924 LNCS, Issue , 2006, Pages 146-161

  Koutavas, Vasileios ^a   Wand, Mitchell ^a  

^a NORTHEASTERN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BISIMULATIONS; CONTEXTUAL EQUIVALENCE; IMPERATIVE OBJECT CALCULUS; CLOSED FORM; OBJECT CALCULI; SOUND AND COMPLETE;

ARTIFICIAL INTELLIGENCE; COMPUTER AIDED SOFTWARE ENGINEERING; COMPUTER HARDWARE DESCRIPTION LANGUAGES; COMPUTER SCIENCE; CALCULATIONS;

NUMERICAL METHODS; FAULT TOLERANCE;

EID: 33745798207     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11693024_11     Document Type: Conference Paper

References (27)

1. Martin Abadi and Luca Cardelli. A Theory of Objects. Springer-Verlag, Berlin, Heidelberg, and New York, 1996.
2. Samson Abramsky. The lazy lambda calculus. In David A. Turner, editor, Research Topics in Functional Programming, pages 65-116. Addison-Wesley, 1990.
3. Nick Benton and Benjamin Leperchey. Relational reasoning in a nominal semantics for storage. In Typed Lambda Calculi and Applications, 7th International Conference, TLCA 2005, Nara, Japan, April 21-23, 2005, Proceedings, volume 3461 of Lecture Notes in Computer Science, pages 86-101. Springer, 2005.
4. Gavin Bierman, Matthew Parkinson, and Andrew Pitts. MJ: An imperative core calculus for Java and Java with effects. Technical Report 563, Cambridge University Computer Laboratory, April 2003.
5. Yuxin Deng and Davide Sangiorgi. Towards an algebraic theory of typed mobile processes. In ICALP, volume 3142 of Lecture Notes in Computer Science, pages 445-456. Springer-Verlag, 2004.
6. Matthew Flatt, Shriram Krishnamurthi, and Matthias Felleisen. A programmer's reduction semantics for classes and mixins. In Formal Syntax and Semantics of Java, pages 241-269, London, UK, 1999. Springer-Verlag.
7. Andrew D. Gordon, Paul D. Hankin, and Søren B. Lassen. Compilation and equivalence of imperative objects. In Proceedings of the 17th Conference on Foundations of Software Technology and Theoretical Computer Science, pages 74-87, London, UK, 1997. Springer-Verlag.
8. Andrew D. Gordon and Gareth D. Rees. Bisimilarity for a first-order calculus of objects with subtyping. In Proceedings 23rd Annual ACM Symposium on Principles of Programming Languages, pages 386-395, New York, NY, USA, 1996. ACM Press.
9. Matthew Hennessy and Robin Milner. On observing nondeterminism and concurrency. In ICALP, pages 299-309, 1980.
10. Matthew Hennessy and Robin Milner. Algebraic laws for nondeterminism and concurrency. Journal of the ACM, 32:137-161, 1985.
11. Douglas J. Howe. Equality in lazy computation systems. In Proc. 4th IEEE Symposium on Logic in Computer Science, pages 198-203, 1989.
12. Cliff B. Jones. A pi-calculus semantics for an object-based design notation. In Eike Best, editor, CONCUR, volume 715 of Lecture Notes in Computer Science, pages 158-172. Springer, 1993.
13. Josva Kleist and Davide Sangiorgi. Imperative objects as mobile processes. Sci. Comput. Program., 44(3):293-342, 2002.
14. Vasileios Koutavas and Mitchell Wand. Smaller bisimulations for reasoning about higher-order imperative programs. In Proceedings 33rd Annual ACM Symposium on Principles of Programming Languages, New York, NY, USA, 2006. ACM Press.
15. Xinxin Liu and David Walker. Partial confluence of processes and systems of objects. Theor. Comput. Sci., 206(1-2):127-162, 1998.
16. Ian A. Mason and Carolyn L. Talcott. Equivalence in functional languages with effects. Journal of Functional Programming, 1:287-327, 1991.
17. Albert R. Meyer and Kurt Sieber. Towards fully abstract semantics for local variables: Preliminary report. In Proceedings 15th Annual ACM Symposium on Principles of Programming Languages, pages 191-203, 1988.
18. Robert Milne and Christopher Strachey. A Theory of Programming Language Semantics. Chapman and Hall, London, 1976. Also Wiley, New York.
19. James H. Morris, Jr. Lambda Calculus Models of Programming Languages. PhD thesis, MIT, Cambridge, MA, 1968.
20. Andrew Pitts and Ian Stark. Operational reasoning for functions with local state. In Andrew Gordon and Andrew Pitts, editors, Higher Order Operational Techniques in Semantics, pages 227-273. Publications of the Newton Institute, Cambridge University Press, 1998.
21. D. Sangiorgi. Locality and non-interleaving semantics in calculi for mobile processes. Theoretical Computer Science, 155:39-83, 1996.
22. D. Sangiorgi. On the bisimulation proof method. Mathematical. Structures in Comp. Sci., 8(5):447-479, 1998.
23. D. Sangiorgi and R. Milner. The problem of "Weak Bisimulation up to". In W.R. Cleveland, editor, Proc. CONCUR '92, volume 630 of Lecture Notes in Computer Science, pages 32-46. Springer-Verlag, 1992.
24. Davide Sangiorgi. An interpretation of typed objects into typed π-calculus. Inf. Comput., 143(1) :34-73, 1998.
25. Eijiro Sumii and Benjamin C. Pierce. A bisimulation for dynamic sealing. In Proceedings 31st Annual ACM Symposium on Principles of Programming Languages, pages 161-172, New York, NY, USA, 2004. ACM Press.
26. Eijiro Sumii and Benjamin C. Pierce. A bisimulation for type abstraction and recursion. In Proceedings 32nd Annual ACM Symposium on Principles of Programming Languages, pages 63-74, New York, NY, USA, 2005. ACM Press.
27. David Walker. Objects in the π-calculus. Inf. Comput., 116(2):253-271, 1995.