Heap-Abstraction for an object-oriented calculus with thread classes

Authors:
Erika Ábrahám;Andreas Grüner;Martin Steffen
Affiliations:
Albert-Ludwigs-University Freiburg, Germany;Christian-Albrechts-University Kiel, Germany;Christian-Albrechts-University Kiel, Germany
Venue:
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Year:
2006

Citing 4
Cited 1

A Fully Abstract May Testing Semantics for Concurrent Objects

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Full Abstraction for First-Order Objects with Recursive Types and Subtyping

LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Object connectivity and full abstraction for a concurrent calculus of classes

ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
Java JR: fully abstract trace semantics for a core java language

ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems

Abstract interface behavior of object-oriented languages with monitors

FMOODS'06 Proceedings of the 8th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper formalizes an open semantics for a calculus featuring thread classes, where the environment, consisting in particular of an overapproximation of the heap topology, is abstractly represented. We extend our prior work not only by adding thread classes, but also in that thread names may be communicated, which means that the semantics needs to account explicitly for the possible acquaintance of objects with threads. We show soundness of the abstraction.