Types for Active Objects with Static Deadlock Prevention

Authors:
Franz Puntigam;Christof Peter
Affiliations:
T-Systems Nova North America, Inc., 400 South El Camino Real, San Mateo, CA 94402, USA;T-Systems Nova North America, Inc., 400 South El Camino Real, San Mateo, CA 94402, USA
Venue:
Fundamenta Informaticae
Year:
2001

Citing 33
Cited 0

On understanding types, data abstraction, and polymorphism

ACM Computing Surveys (CSUR) - The MIT Press scientific computation series
Subtyping recursive types

POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A sort inference algorithm for the polyadic &pgr;-calculus

POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Systematic concurrent object-oriented programming

Communications of the ACM
Toward a method of object-oriented concurrent programming

Communications of the ACM
Regular types for active objects

OOPSLA '93 Proceedings of the eighth annual conference on Object-oriented programming systems, languages, and applications
Higher-order concurrent programs with finite communication topology (extended abstract)

POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Reusable software: the Base object-oriented component libraries

Reusable software: the Base object-oriented component libraries
Type-theoretic foundations for concurrent object-oriented programing

OOPSLA '94 Proceedings of the ninth annual conference on Object-oriented programming systems, language, and applications
A behavioral notion of subtyping

ACM Transactions on Programming Languages and Systems (TOPLAS)
On subtyping and matching

ACM Transactions on Programming Languages and Systems (TOPLAS)
Linearity and the pi-calculus

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A partially deadlock-free typed process calculus

ACM Transactions on Programming Languages and Systems (TOPLAS)
A calculus of object bindings

FMOODS '97 Proceedings of the IFIP TC6 WG6.1 international workshop on Formal methods for open object-based distributed systems
A set-constraint-based analysis of actors

FMOODS '97 Proceedings of the IFIP TC6 WG6.1 international workshop on Formal methods for open object-based distributed systems
On behavioural subtyping in LOTOS

FMOODS '97 Proceedings of the IFIP TC6 WG6.1 international workshop on Formal methods for open object-based distributed systems
Processes, functions, and datatypes

Theory and Practice of Object Systems - Special issue on selected papers from ESEC/FSE'97 (Joint Meeting of the European Software Engineering Conference and ACM Foundations of Software Engineering)
Time, clocks, and the ordering of events in a distributed system

Communications of the ACM
Types for Safe Locking

ESOP '99 Proceedings of the 8th European Symposium on Programming Languages and Systems
Types That Reflect Changes of Object Usability

JMLC '97 Proceedings of the Joint Modular Languages Conference on Modular Programming Languages
A Type-Theoretic Approach to Deadlock-Freedom of Asynchronous Systems

TACS '97 Proceedings of the Third International Symposium on Theoretical Aspects of Computer Software
Inheritance as an Incremental Modification Mechanism or What Like Is and Isn't Like

ECOOP '88 Proceedings of the European Conference on Object-Oriented Programming
The Name Discipline of Uniform Receptiveness (Extended Abstract)

ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Reasoning about Higher-Order Processes

TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Dynamic type Information in Process Types

Euro-Par '98 Proceedings of the 4th International Euro-Par Conference on Parallel Processing
Non-regular Process Types

Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Towards a Theory of Actor Computation

CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
From CML to Process Algebras (Extended Abstract)

CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Principal Typing Schemes in a Polyadic pi-Calculus

CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Graph Types for Monadic Mobile Processes

Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science
Infinite types for distributed object interfaces

Proceedings of the IFIP TC6/WG6.1 Third International Conference on Formal Methods for Open Object-Based Distributed Systems (FMOODS)
Behavioural Types for a Calculus of Concurrent Objects

Euro-Par '97 Proceedings of the Third International Euro-Par Conference on Parallel Processing
The Deadlock problem: a classifying bibliography

ACM SIGOPS Operating Systems Review

Quantified Score

Hi-index	0.00

Visualization

Abstract

Process types statically ensure the acceptability of all messages sent to an object even if the set of acceptable messages changes dynamically. As proposed so far, process types do not ensure the return of answers; deadlocks may prevent objects from behaving as expected. In this article we propose an object calculus with types distinguishing between obligatory messages (that must be sent, for example, as answer to a question) and optional messages (that can, but need not be sent). A type checker enforces the sending of obligatory messages and ensures that obligatory messages are not suppressed by deadlocks. The proposed type concept supports subtyping.