Session-Based Role Programming for the Design of Advanced Telephony Applications

International audienceStimulated by new protocols like SIP, telephony applications are rapidly evolving to o er and combine a variety of communications forms including presence status, instant messaging and videoconferencing. This situation changes and complicates significantly the programming of telephony applications that consist now of distributed entities involved into multiple heterogeneous, stateful and long-running interactions. This paper proposes an approach to support the development of SIP-based telephony applications based on general programming language. Our approach combines the concepts of Actor, Session and Role. Role is the part an actor takes in a session and we consider a session as a collaboration between roles. By using these concepts, we are able to break the complexity of SIP entities programming and provide flexibility for defi ning new ones. Our approach is implemented as a coding framework above JAIN-SIP

A New Linear Logic for Deadlock-Free Session-Typed Processes

The π -calculus, viewed as a core concurrent programming language, has been used as the target of much research on type systems for concurrency. In this paper we propose a new type system for deadlock-free session-typed π -calculus processes, by integrating two separate lines of work. The first is the propositions-as-types approach by Caires and Pfenning, which provides a linear logic foundation for session types and guarantees deadlock-freedom by forbidding cyclic process connections. The second is Kobayashi’s approach in which types are annotated with priorities so that the type system can check whether or not processes contain genuine cyclic dependencies between communication operations. We combine these two techniques for the first time, and define a new and more expressive variant of classical linear logic with a proof assignment that gives a session type system with Kobayashi-style priorities. This can be seen in three ways: (i) as a new linear logic in which cyclic structures can be derived and a CYCLE -elimination theorem generalises CUT -elimination; (ii) as a logically-based session type system, which is more expressive than Caires and Pfenning’s; (iii) as a logical foundation for Kobayashi’s system, bringing it into the sphere of the propositions-as-types paradigm

Contracts for Abstract Processes in Service Composition

Contracts are a well-established approach for describing and analyzing behavioral aspects of web service compositions. The theory of contracts comes equipped with a notion of compatibility between clients and servers that ensures that every possible interaction between compatible clients and servers will complete successfully. It is generally agreed that real applications often require the ability of exposing just partial descriptions of their behaviors, which are usually known as abstract processes. We propose a formal characterization of abstraction as an extension of the usual symbolic bisimulation and we recover the notion of abstraction in the context of contracts.Comment: In Proceedings FIT 2010, arXiv:1101.426

On Global Types and Multi-Party Session

Global types are formal specifications that describe communication protocols in terms of their global interactions. We present a new, streamlined language of global types equipped with a trace-based semantics and whose features and restrictions are semantically justified. The multi-party sessions obtained projecting our global types enjoy a liveness property in addition to the traditional progress and are shown to be sound and complete with respect to the set of traces of the originating global type. Our notion of completeness is less demanding than the classical ones, allowing a multi-party session to leave out redundant traces from an underspecified global type. In addition to the technical content, we discuss some limitations of our language of global types and provide an extensive comparison with related specification languages adopted in different communities

Type Checking Liveness for Collaborative Processes with Bounded and Unbounded Recursion

We present the first session typing system guaranteeing request-response liveness properties for possibly non-terminating communicating processes. The types augment the branch and select types of the standard binary session types with a set of required responses, indicating that whenever a particular label is selected, a set of other labels, its responses, must eventually also be selected. We prove that these extended types are strictly more expressive than standard session types. We provide a type system for a process calculus similar to a subset of collaborative BPMN processes with internal (data-based) and external (event-based) branching, message passing, bounded and unbounded looping. We prove that this type system is sound, i.e., it guarantees request-response liveness for dead-lock free processes. We exemplify the use of the calculus and type system on a concrete example of an infinite state system.Comment: Accepted for publication in Logical Methods in Computer Scienc

Anatomical and functional changes after dexamethasone implant and ranibizumab in diabetic macular edema: A retrospective cohort study

AIM: To investigate the efficacy and safety of ranibizumab (RZB group) and dexamethasone implant (DEX group) intravitreal treatments in patients with treatment-na\uefve center involved diabetic macular edema (DME) by means of functional and morphological assessments. METHODS: This retrospective cohort study included 50 eyes of 50 patients with DME treated either with RBZ or DEX. Best-corrected visual acuity (BCVA) and microperimetry were evaluated at baseline and during a 6-month follow-up. In addition, central macular thickness (CMT) by means of structural optical coherence tomography (OCT) and retinal capillary plexus density and choriocapillary density by means of OCT angiography were assessed in all cases. RESULTS: Functional and morphological parameters significantly improved during the study period in both groups. BCVA improved significantly in both groups with a greater increase in the DEX group compared to the RBZ group (P=0.030). Microperimetry significantly differed during follow-up between the two treatments (P=0.031). In both groups CMT significantly decreased (P<0.001) without statistically significant differences between the two groups. A statistically significant increase of deep capillary plexus density was detected in both groups at 30d after therapy. The retreatment rate was 0.70\ub10.10 and 0.65\ub10.10 in the RBZ group and 0.65\ub10.10 and 0.50\ub10.11 in DEX group at 120 and 180d respectively. Two out of 25 patients in DEX group showed intraocular pressure increase requiring hypotonic eye drops. CONCLUSION: Both treatments are very effective for DME treatment during 6mo of follow-up with a lower retreatment rate in DEX group

Preciseness of Subtyping on Intersection and Union Types

Abstract. The notion of subtyping has gained an important role both in theoretical and applicative domains: in lambda and concurrent calculi as well as in programming languages. The soundness and the complete-ness, together referred to as the preciseness of subtyping, can be consid-ered from two different points of view: denotational and operational. The former preciseness is based on the denotation of a type which is a math-ematical object that describes the meaning of the type in accordance with the denotations of other expressions from the language. The latter preciseness has been recently developed with respect to type safety, i.e. the safe replacement of a term of a smaller type when a term of a bigger type is expected. We propose a technique for formalising and proving operational pre-ciseness of the subtyping relation in the setting of a concurrent lambda calculus with intersection and union types. The key feature is the link between typings and the operational semantics. We then prove sound-ness and completeness getting that the subtyping relation of this calculus enjoys both denotational and operational preciseness.