The Moral Conversation: Moving from Theory to Practice

During his graduate school experience at The University of Vermont, the author was exposed to the ideal of fostering moral conversations in the college classroom. Arguably one of the most powerful theories he took away from Vermont, the author moved this ideal into practice this past academic year. The author enjoyed the opportunity to organize his course (Introduction to University Life) around the tenets of the moral conversation. This article summarizes the successes and challenges of integrating the moral conversation into a classroom with first-year students

Effective representation of RT-LOTOS terms by finite time petri nets

The paper describes a transformational approach for the specification and formal verification of concurrent and real-time systems. At upper level, one system is specified using the timed process algebra RT-LOTOS. The output of the proposed transformation is a Time Petri net (TPN). The paper particularly shows how a TPN can be automatically constructed from an RT-LOTOS specification using a compositionally defined mapping. The proof of the translation consistency is sketched in the paper and developed in [1]. The RT-LOTOS to TPN translation patterns formalized in the paper are being implemented. in a prototype tool. This enables reusing TPNs verification techniques and tools for the profit of RT-LOTOS

Graphical Encoding of a Spatial Logic for the pi-Calculus

This paper extends our graph-based approach to the verification of spatial properties of π-calculus specifications. The mechanism is based on an encoding for mobile calculi where each process is mapped into a graph (with interfaces) such that the denotation is fully abstract with respect to the usual structural congruence, i.e., two processes are equivalent exactly when the corresponding encodings yield isomorphic graphs. Behavioral and structural properties of π-calculus processes expressed in a spatial logic can then be verified on the graphical encoding of a process rather than on its textual representation. In this paper we introduce a modal logic for graphs and define a translation of spatial formulae such that a process verifies a spatial formula exactly when its graphical representation verifies the translated modal graph formula

NAP-2 Secreted by Human NK Cells Can Stimulate Mesenchymal Stem/Stromal Cell Recruitment

SummaryStrategies for improved homing of mesenchymal stem cells (MSCs) to a place of injury are being sought and it has been shown that natural killer (NK) cells can stimulate MSC recruitment. Here, we studied the chemokines behind this recruitment. Assays were performed with bone marrow human MSCs and NK cells freshly isolated from healthy donor buffy coats. Supernatants from MSC-NK cell co-cultures can induce MSC recruitment but not to the same extent as when NK cells are present. Antibody arrays and ELISA assays confirmed that NK cells secrete RANTES (CCL5) and revealed that human NK cells secrete NAP-2 (CXCL7), a chemokine that can induce MSC migration. Inhibition with specific antagonists of CXCR2, a receptor that recognizes NAP-2, abolished NK cell-mediated MSC recruitment. This capacity of NK cells to produce chemokines that stimulate MSC recruitment points toward a role for this immune cell population in regulating tissue repair/regeneration

On Asynchronous Session Semantics

This paper studies a behavioural theory of the π-calculus with session types under the fundamental principles of the practice of distributed computing — asynchronous communication which is order-preserving inside each connection (session), augmented with asynchronous inspection of events (message arrivals). A new theory of bisimulations is introduced, distinct from either standard asynchronous or synchronous bisimilarity, accurately capturing the semantic nature of session-based asynchronously communicating processes augmented with event primitives. The bisimilarity coincides with the reduction-closed barbed congruence. We examine its properties and compare them with existing semantics. Using the behavioural theory, we verify that the program transformation of multithreaded into event-driven session based processes, using Lauer-Needham duality, is type and semantic preserving

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

A Disease With Many Faces

Can you diagnose this man with progressively worsening shortness of breath, mucous productive cough, weight loss, fatigue and a history of suspected pulmonary tuberculosis? http://bit.ly/2VUdnTr.info:eu-repo/semantics/publishedVersio

Explicit connection actions in multiparty session types

This work extends asynchronous multiparty session types (MPST) with explicit connection actions to support protocols with op- tional and dynamic participants. The actions by which endpoints are connected and disconnected are a key element of real-world protocols that is not treated in existing MPST works. In addition, the use cases motivating explicit connections often require a more relaxed form of mul- tiparty choice: these extensions do not satisfy the conservative restric- tions used to ensure safety in standard syntactic MPST. Instead, we de- velop a modelling-based approach to validate MPST safety and progress for these enriched protocols. We present a toolchain implementation, for distributed programming based on our extended MPST in Java, and a core formalism, demonstrating the soundness of our approach. We discuss key implementation issues related to the proposed extensions: a practi- cal treatment of choice subtyping for MPST progress, and multiparty correlation of dynamic binary connections