Re-classification and multi-threading: FickleMT

Authors:
Ferruccio Damiani;Mariangiola Dezani-Ciancaglini;Paola Giannini
Affiliations:
Università di Torino, Torino, Italy;Università di Torino, Torino, Italy;Università del Piemonte, Orientale, Alessandria, Italy
Venue:
Proceedings of the 2004 ACM symposium on Applied computing
Year:
2004

Citing 5
Cited 5

A syntactic approach to type soundness

Information and Computation
More dynamic object reclassification: Fickle∥

ACM Transactions on Programming Languages and Systems (TOPLAS)
A type system for JVM threads

Theoretical Computer Science
Predicate Classes

ECOOP '93 Proceedings of the 7th European Conference on Object-Oriented Programming
Fickle: Dynamic Object Re-classification

ECOOP '01 Proceedings of the 15th European Conference on Object-Oriented Programming

A provenly correct translation of Fickle into Java

ACM Transactions on Programming Languages and Systems (TOPLAS)
Calculi, types and applications

Theoretical Computer Science
Three approaches to object evolution

PPPJ '09 Proceedings of the 7th International Conference on Principles and Practice of Programming in Java
A dynamic class construct for asynchronous concurrent objects

FMOODS'05 Proceedings of the 7th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
Type-Safe runtime class upgrades in creol

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

In this paper we consider re-classification in the presence of multi-threading. To this aim we define a multi-threaded extension of the language Fickle, that we call FickleMT. We define an operational semantics and a type and effect system for the language. Each method signature carries the information on the possible effects of the method execution. The type and effect system statically checks this information. The operational semantics uses this information in order to delay the execution of some threads when this could cause messageNotUnderstood errors. We prove that in the execution of a well-typed expression such delays do not produce deadlock.