The Audit Logic: Policy Compliance in Distributed Systems

We present a distributed framework where agents can share data along with usage policies. We use an expressive policy language including conditions, obligations and delegation. Our framework also supports the possibility to refine policies. Policies are not enforced a-priori. Instead policy compliance is checked using an a-posteriri auditing approach. Policy compliance is shown by a (logical) proof that the authority can systematically check for validity. Tools for automatically checking and generating proofs are also part of the framework.\u

Lmo4 Establishes Rostral Motor Cortex Projection Neuron Subtype Diversity

The mammalian neocortex is parcellated into anatomically and functionally distinct areas. The establishment of area-specific neuronal diversity and circuit connectivity enables distinct neocortical regions to control diverse and specialized functional outputs, yet underlying molecular controls remain largely unknown. Here, we identify a central role for the transcriptional regulator Lim-only 4 (Lmo4) in establishing the diversity of neuronal subtypes within rostral mouse motor cortex, where projection neurons have particularly diverse and multi-projection connectivity compared with caudal motor cortex. In rostral motor cortex, we report that both subcerebral projection neurons (SCPN), which send projections away from the cerebrum, and callosal projection neurons (CPN), which send projections to contralateral cortex, express Lmo4, whereas more caudal SCPN and CPN do not. Lmo4-expressing SCPN and CPN populations are comprised of multiple hodologically distinct subtypes. SCPN in rostral layer Va project largely to brainstem, whereas SCPN in layer Vb project largely to spinal cord, and a subset of both rostral SCPN and CPN sends second ipsilateral caudal (backward) projections in addition to primary projections. Without Lmo4 function, the molecular identity of neurons in rostral motor cortex is disrupted and more homogenous, rostral layer Va SCPN aberrantly project to the spinal cord, and many dual-projection SCPN and CPN fail to send a second backward projection. These molecular and hodological disruptions result in greater overall homogeneity of motor cortex output. Together, these results identify Lmo4 as a central developmental control over the diversity of motor cortex projection neuron subpopulations, establishing their area-specific identity and specialized connectivity.Stem Cell and Regenerative Biolog

Constructive pointfree topology eliminates non-constructive representation theorems from Riesz space theory

In Riesz space theory it is good practice to avoid representation theorems which depend on the axiom of choice. Here we present a general methodology to do this using pointfree topology. To illustrate the technique we show that almost f-algebras are commutative. The proof is obtained relatively straightforward from the proof by Buskes and van Rooij by using the pointfree Stone-Yosida representation theorem by Coquand and Spitters

Log Analysis for Data Protection Accountability

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

An algorithmic approach to the existence of ideal objects in commutative algebra

The existence of ideal objects, such as maximal ideals in nonzero rings, plays a crucial role in commutative algebra. These are typically justified using Zorn's lemma, and thus pose a challenge from a computational point of view. Giving a constructive meaning to ideal objects is a problem which dates back to Hilbert's program, and today is still a central theme in the area of dynamical algebra, which focuses on the elimination of ideal objects via syntactic methods. In this paper, we take an alternative approach based on Kreisel's no counterexample interpretation and sequential algorithms. We first give a computational interpretation to an abstract maximality principle in the countable setting via an intuitive, state based algorithm. We then carry out a concrete case study, in which we give an algorithmic account of the result that in any commutative ring, the intersection of all prime ideals is contained in its nilradical

Automatic Methods for Analyzing Non-repudiation Protocole with an Active Intruder

International audienceNon-repudiation protocols have an important role in many areas where secured transactions with proofs of participation are necessary. Formal methods are clever and without error, therefore using them for verifying such protocols is crucial. In this purpose, we show how to partially represent non-repudiation as a combination of authentications on the Fair Zhou-Gollmann protocol. After discussing the limitations of this method, we define a new one based on the handling of the knowledge of protocol participants. This second method is general and of natural use, as it consists in adding simple annotations in the protocol specification. It is very easy to implement in tools able to handle participants knowledge. We have implemented it in the AVISPA Tool and analyzed the optimistic Cederquist-Corin-Dashti protocol, discovering two attacks. This extension of the AVISPA Tool for handling non-repudiation opens a highway to the specification of many other properties, without any more change in the tool itself