Verifying message-passing programs with dependent behavioural types

Concurrent and distributed programming is notoriously hard. Modern languages and toolkits ease this difficulty by offering message-passing abstractions, such as actors (e.g., Erlang, Akka, Orleans) or processes (e.g., Go): they allow for simpler reasoning w.r.t. shared-memory concurrency, but do not ensure that a program implements a given specification. To address this challenge, it would be desirable to specify and verify the intended behaviour of message-passing applications using types, and ensure that, if a program type-checks and compiles, then it will run and communicate as desired. We develop this idea in theory and practice. We formalise a concurrent functional language λπ ⩽, with a new blend of behavioural types (from π-calculus theory), and dependent function types (from the Dotty programming language, a.k.a. the future Scala 3). Our theory yields four main payoffs: (1) it verifies safety and liveness properties of programs via type– level model checking; (2) unlike previous work, it accurately verifies channel-passing (covering a typical pattern of actor programs) and higher-order interaction (i.e., sending/receiving mobile code); (3) it is directly embedded in Dotty, as a toolkit called Effpi, offering a simplified actor-based API; (4) it enables an efficient runtime system for Effpi, for highly concurrent programs with millions of processes/actors

Fractional non-homogeneous Poisson and Pólya-Aeppli processes of order kk and beyond

We introduce two classes of point processes: a fractional non-homogeneous Poisson process of order k and a fractional non-homogeneous Pólya-Aeppli process of order k. We characterize these processes by deriving their non-local governing equations. We further study the covariance structure of the processes and investigate the long-range dependence property

Solvable non-Markovian dynamic network

Non-Markovian processes are widespread in natural and human-made systems, yet explicit modeling and analysis of such systems is underdeveloped. We consider a non-Markovian dynamic network with random link activation and deletion (RLAD) and heavy-tailed Mittag-Leffler distribution for the interevent times. We derive an analytically and computationally tractable system of Kolmogorov-like forward equations utilizing the Caputo derivative for the probability of having a given number of active links in the network and solve them. Simulations for the RLAD are also studied for power-law interevent times and we show excellent agreement with the Mittag-Leffler model. This agreement holds even when the RLAD network dynamics is coupled with the susceptible-infected-susceptible spreading dynamics. Thus, the analytically solvable Mittag-Leffler model provides an excellent approximation to the case when the network dynamics is characterized by power-law-distributed interevent times. We further discuss possible generalizations of our result

Evaluation of the Antifungal Activity of Mentha x piperita (Lamiaceae) of Pancalieri (Turin, Italy) Essential Oil and Its Synergistic Interaction with Azoles [V.Tullio is the Corresponding and the First Author, N.Mandras is the Last Author]

The promising antimicrobial activity of essential oils (EOs) has led researchers to use them in combination with antimicrobial drugs in order to reduce drug toxicity, side effects, and resistance to single agents. Mentha x piperita, known worldwide as “Mentha of Pancalieri”, is produced locally at Pancalieri (Turin, Italy). The EO from this Mentha species is considered as one of the best mint EOs in the world. In our research, we assessed the antifungal activity of “Mentha of Pancalieri” EO, either alone or in combination with azole drugs (fluconazole, itraconazole, ketoconazole) against a wide panel of yeast and dermatophyte clinical isolates. The EO was analyzed by GC-MS, and its antifungal properties were evaluated by minimum inhibitory concentration (MIC) and minimum fungicidal concentration (MFC) parameters, in accordance with the CLSI guidelines, with some modifications. The interaction of EO with azoles was evaluated through the chequerboard and isobologram methods. The results suggest that this EO exerts a fungicidal activity against yeasts and a fungistatic activity against dermatophytes. Interaction studies with azoles indicated mainly synergistic profiles between itraconazole and EO vs. Candida spp., Cryptococcus neoformans, and Trichophyton mentagrophytes. Thus, the “Mentha of Pancalieri” EO may act as a potential antifungal agent and could serve as a natural adjuvant for fungal infection treatment

The mathematics of human contact: Developing a model for social interaction in school children

In this paper, we provide a statistical analysis of high-resolution contact pattern data within primary and secondary schools as collected by the SocioPatterns collaboration. Students are graphically represented as nodes in a temporally evolving network, in which links represent proximity or interaction between students. This article focuses on link- and node-level statistics, such as the on- and off-durations of links as well as the activity potential of nodes and links. Parametric models are fitted to the on- and off-durations of links, inter-event times and node activity potentials and, based on these, we propose a number of theoretical models that are able to reproduce the collected data within varying levels of accuracy. By doing so, we aim to identify the minimal network-level properties that are needed to closely match the real-world data, with the aim of combining this contact pattern model with epidemic models in future work

Semi-Markov Graph Dynamics

In this paper, we outline a model of graph (or network) dynamics based on two ingredients. The first ingredient is a Markov chain on the space of possible graphs. The second ingredient is a semi-Markov counting process of renewal type. The model consists in subordinating the Markov chain to the semi-Markov counting process. In simple words, this means that the chain transitions occur at random time instants called epochs. The model is quite rich and its possible connections with algebraic geometry are briefly discussed. Moreover, for the sake of simplicity, we focus on the space of undirected graphs with a fixed number of nodes. However, in an example, we present an interbank market model where it is meaningful to use directed graphs or even weighted graphs.Comment: 25 pages, 4 figures, submitted to PLoS-ON

Precise subtyping for asynchronous multiparty sessions

Session subtyping is a cornerstone of refinement of communicating processes: a process implementing a session type (i.e., a communication protocol) T can be safely used whenever a process implementing one of its supertypes T0 is expected, in any context, without introducing deadlocks nor other communication errors. This paper presents the first formalisation of the precise subtyping relation for asynchronous multiparty sessions: we show that the relation is sound (i.e., guarantees safe process replacement, as outlined above) and also complete: any extension of the relation is unsound. Previous work studies precise subtyping for binary sessions (with two participants), or multiparty sessions (with any number of participants) and synchronous interaction. Here, we cover multiparty sessions with asynchronous interaction, where messages are transmitted via FIFO queues (as in the TCP/IP protocol). In this setting, the subtyping relation becomes highly complex: under some conditions, participants can permute the order of their inputs and outputs, by sending some messages earlier, or receiving some later, without causing errors; the precise subtyping relation must capture all such valid permutations, and consequently, its formalisation and proofs become challenging. Our key discovery is a methdology to decompose session types into single input/output session trees, and then express the subtyping relation as a composition of refinement relations between such trees

Precise subtyping for asynchronous multiparty sessions

Session subtyping is a cornerstone of refinement of communicating processes: a process implementing a session type (i.e., a communication protocol) T can be safely used whenever a process implementing one of its supertypes T′ is expected, in any context, without introducing deadlocks nor other communication errors. As a consequence, whenever T T′ holds, it is safe to replace an implementation of T′ with an implementation of the subtype T, which may allow for more optimised communication patterns. We present the first formalisation of the precise subtyping relation for asynchronous multiparty sessions. We show that our subtyping relation is sound (i.e., guarantees safe process replacement, as outlined above) and also complete: any extension of the relation is unsound. To achieve our results, we develop a novel session decomposition technique, from full session types (including internal/external choices) into single input/output session trees (without choices). Previous work studies precise subtyping for binary sessions (with just two participants), or multiparty sessions (with any number of participants) and synchronous interaction. Here, we cover multiparty sessions with asynchronous interaction, where messages are transmitted via FIFO queues (as in the TCP/IP protocol), and prove that our subtyping is both operationally and denotationally precise. In the asynchronous multiparty setting, finding the precise subtyping relation is a highly complex task: this is because, under some conditions, participants can permute the order of their inputs and outputs, by sending some messages earlier or receiving some later, without causing errors; the precise subtyping relation must capture all such valid permutations — and consequently, its formalisation, reasoning and proofs become challenging. Our session decomposition technique overcomes this complexity, expressing the subtyping relation as a composition of refinement relations between single input/output trees, and providing a simple reasoning principle for asynchronous message optimisations

Adsorption and release of sulfamethizole from mesoporous silica nanoparticles functionalised with triethylenetetramine

Mesoporous silica nanoparticles (MSN) were synthesised and functionalised with tri-ethylenetetramine (MSN-TETA). The samples were fully characterised (transmission electron mi-croscopy, small angle X-ray scattering, Fourier transform infrared spectroscopy, thermogravimetric analysis, zeta potential and nitrogen adsorption/desorption isotherms) and used as carriers for the adsorption of the antimicrobial drug sulphamethizole (SMZ). SMZ loading, quantified by UV–Vis spectroscopy, was higher on MSN-TETA (345.8 mg g−1) compared with bare MSN (215.4 mg g−1) even in the presence of a lower surface area (671 vs. 942 m2 g−1). The kinetics of SMZ adsorption on MSN and MSN-TETA followed a pseudo-second-order model. The adsorption isotherm is described better by a Langmuir model rather than a Temkin or Freundlich model. Release kinetics showed a burst release of SMZ from bare MSN samples (k1 = 136 h−1) in contrast to a slower release found with MSN-TETA (k1 = 3.04 h−1), suggesting attractive intermolecular interactions slow down SMZ release from MSN-TETA. In summary, the MSN surface area did not influence SMZ adsorption and release. On the contrary, the design of an effective drug delivery system must consider the intermolecular interactions between the adsorbent and the adsorbate