Homotopy Type Theory in Lean

We discuss the homotopy type theory library in the Lean proof assistant. The library is especially geared toward synthetic homotopy theory. Of particular interest is the use of just a few primitive notions of higher inductive types, namely quotients and truncations, and the use of cubical methods.Comment: 17 pages, accepted for ITP 201

Gain of Function Analysis Reveals Non-Redundant Roles for the Yersinia pestis Type III Secretion System Effectors YopJ, YopT, and YpkA [preprint]

Virulence of Yersinia pestis in mammals requires the type III secretion system, which delivers seven effector proteins into the cytoplasm of host cells to undermine immune responses. All seven of these effectors are conserved across Y. pestis strains, but three -- YopJ, YopT, and YpkA -- are apparently dispensable for virulence. Some degree of functional redundancy between effector proteins would explain both observations. Here, we use a combinatorial genetic approach to define the minimal subset of effectors required for full virulence in mice following subcutaneous infection. We found that a Y. pestis strain lacking YopJ, YopT, and YpkA is attenuated for virulence in mice, and that addition of any one of these effectors to this strain increases lethality significantly. YopJ, YopT, and YpkA likely contribute to virulence via distinct mechanisms. YopJ is uniquely able to cause macrophage cell death in vitro and to suppress accumulation of inflammatory cells to foci of bacterial growth in deep tissue, whereas YopT and YpkA cannot. The synthetic phenotypes that emerge when YopJ, YopT, and YpkA are removed in combination provide evidence that each enhances Y. pestis virulence, and that YopT and YpkA act through a mechanism distinct from that of YopJ

A decade's overview of Io's volcanic activity

Over the past decade some aspects of Io's volcanic activity have changed greatly, while others have essentially remained constant. This contrast has emerged from our study of multi-wavelength, infrared, observations of Io's thermal emission. From 1983 to 1992 we observed the disk integrated flux density of Io from the NASA Infrared Telescope Facility (IRTF) on Mauna Kea, Hawaii. Our spectral coverage allows us to separate out the emission components due to volcanic thermal anomalies which are warmer than the background emission caused by solar heating. Our temporal coverage allows us to resolve individual eruptions and also to obtain the disk-integrated flux density as a function of longitude (or, equivalently, orbital phase angle). Characteristics that persisted over the decade involve Loki's location and intensity of emission, the leading hemisphere emission, and the average heat flow. The variable aspects of Io over the decade include Loki's hotter area(s) and the outbursts in the leading hemisphere

Distilling Privacy Requirements for Mobile Applications

As mobile computing applications have become commonplace, it is increasingly important for them to address end-users’ privacy requirements. Privacy requirements depend on a number of contextual socio-cultural factors to which mobility adds another level of contextual variation. However, traditional requirements elicitation methods do not sufficiently account for contextual factors and therefore cannot be used effectively to represent and analyse the privacy requirements of mobile end users. On the other hand, methods that do investigate contextual factors tend to produce data that does not lend itself to the process of requirements extraction. To address this problem we have developed a Privacy Requirements Distillation approach that employs a problem analysis framework to extract and refine privacy requirements for mobile applications from raw data gathered through empirical studies involving end users. Our approach introduces privacy facets that capture patterns of privacy concerns which are matched against the raw data. We demonstrate and evaluate our approach using qualitative data from an empirical study of a mobile social networking application

A Formal Framework for Modeling Trust and Reputation in Collective Adaptive Systems

Trust and reputation models for distributed, collaborative systems have been studied and applied in several domains, in order to stimulate cooperation while preventing selfish and malicious behaviors. Nonetheless, such models have received less attention in the process of specifying and analyzing formally the functionalities of the systems mentioned above. The objective of this paper is to define a process algebraic framework for the modeling of systems that use (i) trust and reputation to govern the interactions among nodes, and (ii) communication models characterized by a high level of adaptiveness and flexibility. Hence, we propose a formalism for verifying, through model checking techniques, the robustness of these systems with respect to the typical attacks conducted against webs of trust.Comment: In Proceedings FORECAST 2016, arXiv:1607.0200

Methanol on Enceladus

Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/95284/1/grl26203.pd

Components, contracts, and connectors for the Unified Modelling Language UML

The lack of a component concept for the UML is widely ac-\ud knowledged. Contracts between components can be the starting point for introducing components and component interconnections. Contracts between service providers and service users are formulated based on abstractions of action and operation behaviour using the pre- and postcon-\ud dition technique. A valid contract allows to establish an interconnection- a connector - between the provider and the user. The contract concept supports the re-use of components by providing means to establish and modify component interconnections. A flexible contract concept shall be based on a renement relation for operations and classes, derived from operation abstractions. Abstract behaviour, expressed by pre- and post-conditions, and renement are the key elements in the denition of a formal and flexible component and component interconnection approach

Regulating Data Exchange in Service Oriented Applications

We define a type system for COWS, a formalism for specifying and combining services, while modelling their dynamic behaviour. Our types permit to express policies constraining data exchanges in terms of sets of service partner names attachable to each single datum. Service programmers explicitly write only the annotations necessary to specify the wanted policies for communicable data, while a type inference system (statically) derives the minimal additional annotations that ensure consistency of services initial configuration. Then, the language dynamic semantics only performs very simple checks to authorize or block communication. We prove that the type system and the operational semantics are sound. As a consequence, we have the following data protection property: services always comply with the policies regulating the exchange of data among interacting services. We illustrate our approach through a simplified but realistic scenario for a service-based electronic marketplace

Higher-order architectural connectors

We develop a notion of higher-order connector towards supporting the systematic construction of architectural connectors for software design. A higher-order connector takes connectors as parameters and allows for services such as security protocols and fault-tolerance mechanisms to be superposed over the interactions that are handled by the connectors passed as actual arguments. The notion is first illustrated over CommUnity, a parallel program design language that we have been using for formalizing aspects of architectural design. A formal, algebraic semantics is then presented which is independent of any Architectural Description Language. Finally, we discuss how our results can impact software design methods and tools