Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Towards fully abstract semantics for local variables
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Equality in lazy computation systems
Proceedings of the Fourth Annual Symposium on Logic in computer science
Research topics in functional programming
Information and Computation
Locality and interleaving semantics in calculi for mobile processes
Theoretical Computer Science
Bisimilarity for a first-order calculus of objects with subtyping
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An interpretation of typed objects into typed &pgr;-calculus
Information and Computation
Partial confluence of processes and systems of objects
Theoretical Computer Science
Operational reasoning for functions with local state
Higher order operational techniques in semantics
A Theory of Objects
A Theory of Programming Language Semantics
A Theory of Programming Language Semantics
Imperative objects as mobile processes
Science of Computer Programming
A Programmer's Reduction Semantics for Classes and Mixins
Formal Syntax and Semantics of Java
The Problem of ``Weak Bisimulation up to''
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
A pi-Calculus Semantics for an Object-Based Design Notation
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Compilation and Equivalence of Imperative Objects
Proceedings of the 17th Conference on Foundations of Software Technology and Theoretical Computer Science
On Observing Nondeterminism and Concurrency
Proceedings of the 7th Colloquium on Automata, Languages and Programming
A bisimulation for dynamic sealing
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On the bisimulation proof method
Mathematical Structures in Computer Science
A bisimulation for type abstraction and recursion
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Small bisimulations for reasoning about higher-order imperative programs
Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Relational reasoning in a nominal semantics for storage
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
Proceedings of the 6th international conference on Aspect-oriented software development
A bisimulation for type abstraction and recursion
Journal of the ACM (JACM)
Relational parametricity for references and recursive types
Proceedings of the 4th international workshop on Types in language design and implementation
Transactions on Aspect-Oriented Software Development V
A complete, co-inductive syntactic theory of sequential control and state
Semantics and algebraic specification
Environmental bisimulations for higher-order languages
ACM Transactions on Programming Languages and Systems (TOPLAS)
Refactoring and representation independence for class hierarchies: extended abstract
Proceedings of the 12th Workshop on Formal Techniques for Java-Like Programs
From Applicative to Environmental Bisimulation
Electronic Notes in Theoretical Computer Science (ENTCS)
Relational reasoning for recursive types and references
APLAS'06 Proceedings of the 4th Asian conference on Programming Languages and Systems
Full abstraction at package boundaries of object-oriented languages
SBMF'11 Proceedings of the 14th Brazilian conference on Formal Methods: foundations and Applications
Refactoring and representation independence for class hierarchies
Theoretical Computer Science
Program equivalence in a simple language with state
Computer Languages, Systems and Structures
Verifying backwards compatibility of object-oriented libraries using Boogie
Proceedings of the 14th Workshop on Formal Techniques for Java-like Programs
| Hi-index | 0.00 |
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] require an inductive specification. To derive our bisimulations we follow the same technique as we did in [14], thus indicating the extensibility of this method.