A type safe state abstraction for coordination in Java-like languages

• Published in: Acta informatica Vol. 45; no. 7-8; pp. 479 - 536
• Main Authors: Damiani, Ferruccio, Giachino, Elena, Giannini, Paola, Drossopoulou, Sophia
• Format: Journal Article
• Language: English
• Published: Berlin/Heidelberg Springer-Verlag 01.12.2008; Springer; Springer Nature B.V
• Subjects: Algorithmics. Computability. Computer arithmetics; Applied sciences; Computer Science; Computer science; control theory; systems; Computer Systems Organization and Communication Networks; Data Structures and Information Theory; Exact sciences and technology; Global analysis, analysis on manifolds; Information Systems and Communication Service; Java; Logics and Meanings of Programs; Mathematics; Methods; Miscellaneous; Original Article; Sciences and techniques of general use; Software Engineering/Programming and Operating Systems; Theoretical computing; Theory of Computation; Topology. Manifolds and cell complexes. Global analysis and analysis on manifolds; Writers; Java; Asia; Indonesia; Global Effect; Operational Semantic; Reduction Rule; Induction Hypothesis; State Class; Availability; Coordination language; Protocols; Coordination; Computer theory; Concurrent program; Concurrent; Transition state; Transition; Object; Behavior
• ISSN: 0001-5903; 1432-0525
• DOI: 10.1007/s00236-008-0079-y

The state of a concurrent object, intended as some abstraction over the values of the fields of the object, usually determines its coordination behavior. Therefore, state is always in the programmer’s mind, even though implicitly. We suggest a feature for J ava -like languages, which makes the state of a concurrent object explicit and supports the expression of the object’s behavior depending on the state it is currently in. Namely, an object will be in one of the states declared in its class. The state determines the presence of fields and methods. State transition statements explicitly change the state of an object, and thus change the availability of fields and methods. When a thread calls a method which is declared in the object’s class but absent from its current state, it waits, until the state of the object changes to a state which does contain that method. This directly expresses coordination. We claim that this feature makes it easier to understand and develop concurrent programs, and substantiate our claim through the discussion of some popular examples of concurrent programs written using this feature.We develop a type and effect system, which guarantees that, during execution of a method invoked on a concurrent object : (1) No attempt will be made to access fields not available in the current state of , and (2) No method invoked on a receiver (syntactically) different from may cause the invocation of a method on . The latter guarantee helps to enforce the former and prevents a family of accidental violations of the intended coordination protocol.