Bisimulations for Untyped Imperative Objects

@inproceedings{Koutavas2006BisimulationsFU,
  title={Bisimulations for Untyped Imperative Objects},
  author={Vasileios Koutavas and Mitchell Wand},
  booktitle={ESOP},
  year={2006}
}
We present a sound and complete method for reasoning about contextual equivalence in the untyped, imperative object calculus of Abadi and Cardelli [1]. Our method is based on bisimulations, following the work of Sumii and Pierce [25,26] and our own [14]. Using our method we were able to prove equivalence in more complex examples than the ones of Gordon, Hankin and Lassen [7] and Gordon and Rees [8]. We can also write bisimulations in closed form in cases where similar bisimulation methods [26… CONTINUE READING
BETA

Similar Papers

Citations

Publications citing this paper.
SHOWING 1-10 OF 25 CITATIONS

Environmental Bisimulations for Higher-Order Languages

  • 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)
  • 2007
VIEW 10 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

References

Publications referenced by this paper.
SHOWING 1-10 OF 31 REFERENCES

A Theory of Objects

  • Monographs in Computer Science
  • 1996
VIEW 7 EXCERPTS
HIGHLY INFLUENTIAL

Pierce . A bisimulation for type abstraction and recursion

Eijiro Sumii, C. Benjamin
  • Proceedings 32 nd Annual ACM Symposium on Principles of Programming Languages
  • 2005

Pierce . A bisimulation for dynamic sealing

Eijiro Sumii, C. Benjamin
  • 2004