Changeable interfaces and promised messages for concurrent components

Puntigam, Franz; Peter, Christof

doi:10.1145/298151.298223

Cited by 11 publications

(10 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Sumii and Kobayashi proposed a system to ensure deadlock freedom [KSS00]. The type model of Puntigam ensures that all the messages sent by a client process are understood by a server, and Puntigam and Peter later extended it to ensure that the server sends the promised responses [PuP99].…”

Section: Behavioral Typesmentioning

confidence: 99%

A behavioral type system and its application in Ptolemy II

Lee

Xiong

2004

Form. Asp. Comput.

View full text Add to dashboard Cite

Abstract. Interface automata [deH01] have been introduced as an interface theory [deH01a] capable of functioning as a behavioral type system. Behavioral type systems describe dynamic properties of components and their compositions. Like traditional (data) type systems, behavioral type systems can be used to check compatibility of components. In this paper, we use interface automata to devise a behavioral type system for Ptolemy II, leveraging the contravariant and optimistic properties of interface automata to achieve behavioral subtyping and polymorphism. Ptolemy II is a software framework supporting concurrent component composition according to diverse models of computation. In this paper, we focus on representing the communication protocols used in component communication within the behavioral type system. In building this type system, we identify two key limitations in interface automata formalisms; we overcome these limitations with two extensions, transient states and projection automata. In addition to static type checking, we also propose to extend the use of interface automata to the on-line reflection of component states and to run-time type checking, which enable dynamic component creation, morphing application structure, and admission control. We discuss the trade-offs in the design of behavioral type systems.

show abstract

Section: Behavioral Typesmentioning

confidence: 99%

A behavioral type system and its application in Ptolemy II

Lee

Xiong

2004

Form. Asp. Comput.

View full text Add to dashboard Cite

show abstract

“…Thanks to this generalization, we can reason about not only deadlock-freedom but also other properties such as race conditions within a single framework. The new type system can also guarantee deadlock-freedom of more processes, such as that of concurrent objects with non-uniform service availability [30,31].…”

Section: Main Ideasmentioning

confidence: 99%

“…Hence, by giving an appropriate type to the record, we can enforce a certain protocol that clients should respect. Since our type system can capture, in particular, temporal dependency on the utilized services, it is possible to guarantee race-freedom of accesses to methods, studied by Abadi, Flanagan and Freund [4,6], and deadlockfreedom for objects with non-uniform service availability, studied by Puntigam [30]. Note that, so far, these properties have been discussed only for languages with primitive notion of objects.…”

Section: Further Applications: Analysis Of Race and Deadlock Of Concumentioning

confidence: 99%

See 1 more Smart Citation

A generic type system for the Pi-calculus

Igarashi

KobayashiNaoki

2001

SIGPLAN Not.

View full text Add to dashboard Cite

We propose a general, powerful framework of type systems for the ~r-caiculus, and show that we can obtain as its instances a variety of type systems guaranteeing non-trivial properties like deadlock-freedom and race-freedom. A key idea is to express types and type environments as abstract processes: We can check various properties of a process by checking the corresponding properties of its type environment. The framework clarifies the essence of recent complex type systems, and it also enables sharing of a large amount of work such as a proof of type preservation, making it easy to develop new type systems.

show abstract

“…A coordination protocol is developed and used by the agents in their reasoning process. Puntigam and Peter ( [2]) propose an extension of process types based on promised messages to ensure that servers return always appropriate answers to clients and thus related problems of livelock and deadlock get minimised. This work is applicable to middleware platforms such as CORBA.…”

Section: The Contributed Papersmentioning

confidence: 99%

Special track on coordination models, languages and applications

Papadopoulos

1999

Proceedings of the 1999 ACM Symposium on Applied Computing

View full text Add to dashboard Cite

Changeable interfaces and promised messages for concurrent components

Cited by 11 publications

References 11 publications

A behavioral type system and its application in Ptolemy II

A behavioral type system and its application in Ptolemy II

A generic type system for the Pi-calculus

Special track on coordination models, languages and applications

Contact Info

Product

Resources

About