204 research outputs found

    Implementing Trustworthy Services Using Replicated State Machines

    Full text link

    CODEX: a robust and secure secret distribution system

    Full text link

    Attenuation of Mammary Gland Dysplasia and Feeding Difficulties in Tabby Mice by Fetal Therapy.

    Get PDF
    Hypohidrotic ectodermal dysplasias (HED) are hereditary differentiation disorders of multiple ectodermal structures including the mammary gland. The X-linked form of HED (XLHED) is caused by a lack of the secreted signaling molecule ectodysplasin A1 (EDA1) which is encoded by the gene EDA and belongs to the tumor necrosis factor (TNF) superfamily. Although male patients (hemizygous) are usually more severely affected by XLHED, heterozygous female carriers of an EDA mutation may also suffer from a variety of symptoms, in particular from abnormal development of their breasts. In Tabby mice, a well-studied animal model of XLHED, EDA1 is absent. We investigated the effects of prenatal administration of Fc-EDA, a recombinant EDA1 replacement protein, on mammary gland development in female Tabby mice. Intra-amniotic delivery of Fc-EDA to fetal animals resulted later in improved breastfeeding and thus promoted the growth of their offspring. In detail, such treatment led to a normalization of the nipple shape (protrusion, tapering) that facilitated sucking. Mammary glands of treated female Tabby mice also showed internal changes, including enhanced branching morphogenesis and ductal elongation. Our findings indicate that EDA receptor stimulation during development has a stable impact on later stages of mammary gland differentiation, including lactation, but also show that intra-amniotic administration of an EDA1 replacement protein to fetal Tabby mice partially corrects the mammary gland phenotype in female adult animals

    Monitoring Networks through Multiparty Session Types

    Get PDF
    In large-scale distributed infrastructures, applications are realised through communications among distributed components. The need for methods for assuring safe interactions in such environments is recognized, however the existing frameworks, relying on centralised verification or restricted specification methods, have limited applicability. This paper proposes a new theory of monitored π-calculus with dynamic usage of multiparty session types (MPST), offering a rigorous foundation for safety assurance of distributed components which asynchronously communicate through multiparty sessions. Our theory establishes a framework for semantically precise decentralised run-time enforcement and provides reasoning principles over monitored distributed applications, which complement existing static analysis techniques. We introduce asynchrony through the means of explicit routers and global queues, and propose novel equivalences between networks, that capture the notion of interface equivalence, i.e. equating networks offering the same services to a user. We illustrate our static-dynamic analysis system with an ATM protocol as a running example and justify our theory with results: satisfaction equivalence, local/global safety and transparency, and session fidelity

    History-Based Access Control with Local Policies

    Full text link

    Algebraic approach to time-delay data analysis for LISA

    Get PDF
    Cancellation of laser frequency noise in interferometers is crucial for attaining the requisite sensitivity of the triangular 3-spacecraft LISA configuration. Raw laser noise is several orders of magnitude above the other noises and thus it is essential to bring it down to the level of other noises such as shot, acceleration, etc. Since it is impossible to maintain equal distances between spacecrafts, laser noise cancellation must be achieved by appropriately combining the six beams with appropriate time-delays. It has been shown in several recent papers that such combinations are possible. In this paper, we present a rigorous and systematic formalism based on algebraic geometrical methods involving computational commutative algebra, which generates in principle {\it all} the data combinations cancelling the laser frequency noise. The relevant data combinations form the first module of syzygies, as it is called in the literature of algebraic geometry. The module is over a polynomial ring in three variables, the three variables corresponding to the three time-delays around the LISA triangle. Specifically, we list several sets of generators for the module whose linear combinations with polynomial coefficients generate the entire module. We find that this formalism can also be extended in a straight forward way to cancel Doppler shifts due to optical bench motions. The two modules are infact isomorphic. We use our formalism to obtain the transfer functions for the six beams and for the generators. We specifically investigate monochromatic gravitational wave sources in the LISA band and carry out the maximisiation over linear combinations of the generators of the signal-to-noise ratios with the frequency and source direction angles as parameters.Comment: 27 Pages, 6 figure

    Runtime Verification of Temporal Patterns for Dynamic Reconfigurations of Components

    Get PDF
    International audienceDynamic reconfigurations increase the availability and the reliability of component-based systems by allowing their architectures to evolve at runtime. Recently we have proposed a temporal pattern logic, called FTPL, to characterize the correct reconfigurations of component-based systems under some temporal and architectural constraints. As component-based architectures evolve at runtime, there is a need to check these FTPL constraints on the fly, even if only a partial information is expected. Firstly, given a generic component-based model, we review FTPL from a runtime verification point of view. To this end we introduce a new four-valued logic, called RV-FTPL (Runtime Verification for FTPL), characterizing the "potential" (un)satisfiability of the architectural constraints in addition to the basic FTPL semantics. Potential true and potential false values are chosen whenever an observed behaviour has not yet lead to a violation or satisfiability of the property under consideration. Secondly, we present a prototype developed to check at runtime the satisfiability of RV-FTPL formulas when reconfiguring a Fractal component-based system. The feasability of a runtime property enforcement is also shown. It consists in supervising on the fly the reconfiguration execution against desired RV-FTPL properties. The main contributions are illustrated on the example of a HTTP server architecture

    Log Analysis for Data Protection Accountability

    Get PDF
    International audienceAccountability is increasingly recognised as a cornerstone of data protection, notably in European regulation, but the term is frequently used in a vague sense. For accountability to bring tangible benefits, the expected properties of personal data handling logs (used as "accounts") and the assumptions regarding the logging process must be defined with accuracy. In this paper, we provide a formal framework for accountability and show the correctness of the log analysis with respect to abstract traces used to specify privacy policies. We also show that compliance with respect to data protection policies can be checked based on logs free of personal data, and describe the integration of our formal framework in a global accountability process

    Regulating Data Exchange in Service Oriented Applications

    Get PDF
    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
    corecore