What Are Polymorphically-Typed Ambients?

Abstract: The Ambient Calculus was developed by Cardelli and Gordon as a formal framework to study issues of mobility and migrant code. We consider an Ambient Calculus where ambients transport and exchange programs rather that just inert data. We propose different senses in which such a calculus can be said to be polymorphically typed, and design accordingly a polymorphic type system for it. Our type system assigns types to embedded programs and what we call behaviors to processes; a denotational semantics of behaviors is then proposed, here called trace semantics, underlying much of the remaining analysis. We state and prove a Subject Reduction property for our polymorphically typed calculus. Based on techniques borrowed from finite automata theory, type-checking of fully type-annotated processes is shown to be decidable; the time complexity of our decision procedure is exponential (this is a worst-case in theory, arguably not encountered in practice). Our polymorphically-typed calculus is a conservative extension of the typed Ambient Calculus originally proposed by Cardelli and Gordon

Static Safety for an Actor Dedicated Process Calculus by Abstract Interpretation

The actor model eases the definition of concurrent programs with non uniform behaviors. Static analysis of such a model was previously done in a data-flow oriented way, with type systems. This approach was based on constraint set resolution and was not able to deal with precise properties for communications of behaviors. We present here a new approach, control-flow oriented, based on the abstract interpretation framework, able to deal with communication of behaviors. Within our new analyses, we are able to verify most of the previous properties we observed as well as new ones, principally based on occurrence counting

Optimizing investments in cyber hygiene for protecting healthcare users

Cyber hygiene measures are often recommended for strengthening an organization’s security posture, especially for protecting against social engineering attacks that target the human element. However, the related recommendations are typically the same for all organizations and their employees, regardless of the nature and the level of risk for different groups of users. Building upon an existing cybersecurity investment model, this paper presents a tool for optimal selection of cyber hygiene safeguards, which we refer as the Optimal Safeguards Tool (OST). The model combines game theory and combinatorial optimization (0-1 Knapsack) taking into account the probability of each user group to being attacked, the value of assets accessible by each group, and the efficacy of each control for a particular group. The model considers indirect cost as the time employees could require for learning and trainning against an implemented control. Utilizing a game-theoretic framework to support the Knapsack optimization problem permits us to optimally select safeguards’ application levels minimizing the aggregated expected damage within a security investment budget. We evaluate OST in a healthcare domain use case. In particular, on the Critical Internet Security (CIS) Control group 17 for implementing security awareness and training programs for employees belonging to the ICT, clinical and administration personnel of a hospital. We compare the strategies implemented by OST against alternative common-sense defending approaches for three different types of attackers: Nash, Weighted and Opportunistic. Our results show that Nash defending strategies are consistently better than the competing strategies for all attacker types with a minor exception where the Nash defending strategy, for a specific game, performs at least as good as other common-sense approaches. Finally, we illustrate the alternative investment strategies on different Nash equilibria (called plans) and discuss the optimal choice using the framework of 0-1 Knapsack optimization

Alien pathogens on the horizon: opportunities for predicting their threat to wildlife

According to the Convention on Biological Diversity, by 2020 invasive alien species (IAS) should be identified and their impacts assessed, so that species can be prioritized for implementation of appropriate control strategies and measures put in place to manage invasion pathways. For one quarter of the IAS listed as the “100 of the world's worst” environmental impacts are linked to diseases of wildlife (undomesticated plants and animals). Moreover, IAS are a significant source of “pathogen pollution” defined as the human-mediated introduction of a pathogen to a new host or region. Despite this, little is known about the biology of alien pathogens and their biodiversity impacts after introduction into new regions. We argue that the threats posed by alien pathogens to endangered species, ecosystems, and ecosystem services should receive greater attention through legislation, policy, and management. We identify 10 key areas for research and action, including those relevant to the processes of introduction and establishment of an alien pathogen and to prediction of the spread and associated impact of an alien pathogen on native biota and ecosystems. The development of interdisciplinary capacity, expertise, and coordination to identify and manage threats was seen as critical to address knowledge gaps

Convergent evolution of highly reduced fruiting bodies in Pezizomycotina suggests key adaptations to the bee habitat

BACKGROUND: Among the understudied fungi found in nature are those living in close association with social and solitary bees. The bee-specialist genera Bettsia, Ascosphaera and Eremascus are remarkable not only for their specialized niche but also for their simple fruiting bodies or ascocarps, which are morphologically anomalous in Pezizomycotina. Bettsia and Ascosphaera are characterized by a unicellular cyst-like cleistothecium known as a spore cyst, while Eremascus is characterized by completely naked asci, or asci not formed within a protective ascocarp. Before molecular phylogenetics the placement of these genera within Pezizomycotina remained tentative; morphological characters were misleading because they do not produce multicellular ascocarps, a defining character of Pezizomycotina. Because of their unique fruiting bodies, the close relationship of these bee-specialist fungi and their monophyly appeared certain. However, recent molecular studies have shown that Bettsia is not closely related to Ascosphaera. In this study, I isolated the very rare fungus Eremascus fertilis (Ascomycota, Pezizomycotina) from the bee bread of honey bees. These isolates represent the second report of E. fertilis both in nature and in the honey bee hive. To establish the systematic position of E. fertilis and Bettsia alvei, I performed phylogenetic analyses of nuclear ribosomal LSU + SSU DNA sequences from these species and 63 additional ascomycetes. RESULTS: The phylogenetic analyses revealed that Eremascus is not monophyletic. Eremascus albus is closely related to Ascosphaera in Eurotiomycetes while E. fertilis belongs in Myxotrichaceae, a putative member of Leotiomycetes. Bettsia is not closely related to Ascosphaera and like E. fertilis apparently belongs in Leotiomycetes. These results indicate that both the naked ascus and spore cyst evolved twice in the Pezizomycotina and in distantly related lineages. The new genus Skoua is described to accommodate E. fertilis. CONCLUSIONS: The naked ascus and spore cyst are both shown to have evolved convergently within the bee habitat. The convergent evolution of these unusual ascocarps is hypothesized to be adaptive for bee-mediated dispersal. Elucidating the dispersal strategies of these fungal symbionts contributes to our understanding of their interaction with bees and provides insight into the factors which potentially drive the evolution of reduced ascocarps in Pezizomycotina. ELECTRONIC SUPPLEMENTARY MATERIAL: The online version of this article (doi:10.1186/s12862-015-0401-6) contains supplementary material, which is available to authorized users

What are Polymorphically-Typed Ambients?

The Ambient Calculus was developed by Cardelli and Gordon as a formal framework to study issues of mobility and migrant code [CG98]. We consider an Ambient Calculus where ambients transport and exchange programs rather that just inert data. We propose different senses in which such a calculus can be said to be polymorphically typed, and design accordingly a polymorphic type system for it. Our type system assigns types to embedded programs and what we call behaviors to processes; a denotational semantics of behaviors is then proposed, here called trace semantics, underlying much of the remaining analysis. We state and prove a Subject Reduction property for our polymorphically-typed calculus. Based on techniques borrowed from finite automata theory, type-checking of fully type-annotated processes is shown to be decidable. Our polymorphically-typed calculus is a conservative extension of the typed Ambient Calculus originally proposed by Cardelli and Gordon [CG99]

An alternative characterization of weak order dependence

Control dependence forms the basis for many program analyses, such as program slicing. Recent work on control dependence analysis has led to new definitions of dependence that can allow for reactive programs with their necessarily non-terminating computations. One important such definition is the definition of Weak Order Dependence, which was introduced to generalize classical control dependence for a Control Flow Graph (CFG) without end nodes. In this paper we show that for a CFG where all nodes are reachable from each other, weak order dependence can be expressed in terms of traditional control dependence where one node has been converted into an end node

Orderly Communication in the Ambient Calculus

The Ambient Calculus (henceforth, AC) was developed by Cardelli and Gordon as a formal framework to study issues of mobility and migrant code [9]. We present a type system for AC that allows the type of exchanged data within the same ambient to vary over time. Our type system assigns what we call behaviors to processes; a denotational semantics of behaviors is proposed, here called trace semantics, underlying much of the remaining analysis. We state and prove a Subject Reduction property for our typed version of AC. Based on techniques borrowed from finite automata theory, type checking of fully type-annotated processes is shown to be decidable. We show that the typed version of AC originally proposed by Cardelli and Gordon [10] can be naturally embedded into our typed version of AC