On Observing Dynamic Prioritised Actions in SOC

We study the impact on observational semantics for SOC of priority mechanisms which combine dynamic priority with local pre-emption. We define manageable notions of strong and weak labelled bisimilarities for COWS, a process calculus for SOC, and provide alternative characterisations in terms of open barbed bisimilarities. These semantics show that COWS’s priority mechanisms partially recover the capability to observe receive actions (that could not be observed in a purely asynchronous setting) and that high priority primitives for termination impose specific conditions on the bisimilarities

Memory usage verification using Hip/Sleek.

Embedded systems often come with constrained memory footprints. It is therefore essential to ensure that software running on such platforms fulfils memory usage specifications at compile-time, to prevent memory-related software failure after deployment. Previous proposals on memory usage verification are not satisfactory as they usually can only handle restricted subsets of programs, especially when shared mutable data structures are involved. In this paper, we propose a simple but novel solution. We instrument programs with explicit memory operations so that memory usage verification can be done along with the verification of other properties, using an automated verification system Hip/Sleek developed recently by Chin et al.[10,19]. The instrumentation can be done automatically and is proven sound with respect to an underlying semantics. One immediate benefit is that we do not need to develop from scratch a specific system for memory usage verification. Another benefit is that we can verify more programs, especially those involving shared mutable data structures, which previous systems failed to handle, as evidenced by our experimental results

A criterion for separating process calculi

We introduce a new criterion, replacement freeness, to discern the relative expressiveness of process calculi. Intuitively, a calculus is strongly replacement free if replacing, within an enclosing context, a process that cannot perform any visible action by an arbitrary process never inhibits the capability of the resulting process to perform a visible action. We prove that there exists no compositional and interaction sensitive encoding of a not strongly replacement free calculus into any strongly replacement free one. We then define a weaker version of replacement freeness, by only considering replacement of closed processes, and prove that, if we additionally require the encoding to preserve name independence, it is not even possible to encode a non replacement free calculus into a weakly replacement free one. As a consequence of our encodability results, we get that many calculi equipped with priority are not replacement free and hence are not encodable into mainstream calculi like CCS and pi-calculus, that instead are strongly replacement free. We also prove that variants of pi-calculus with match among names, pattern matching or polyadic synchronization are only weakly replacement free, hence they are separated both from process calculi with priority and from mainstream calculi.Comment: In Proceedings EXPRESS'10, arXiv:1011.601

Precursor-Dependent Photocatalytic Activity of Carbon Dots

This work systematically compares both structural features and photocatalytic performance of a series of graphitic and amorphous carbon dots (CDs) prepared in a bottom-up manner from fructose, glucose, and citric acid. We demonstrate that the carbon source and synthetic procedures diversely affect the structural and optical properties of the CDs, which in turn unpredictably influence their photo electron transfer ability. The latter was evaluated by studying the photo-reduction of methyl viologen. Overall, citric acid-CDs were found to provide the best photocatalytic performance followed by fructose- and glucose-CDs. However, while the graphitization of glucose- and citric acid-CDs favored the photo-reaction, a reverse structure-activity dependence was observed for fructose-CDs due to the formation of a large graphitic-like supramolecular assembly. This study highlights the complexity to design in advance photo-active bio-based carbon nanomaterials

Globally Governed Session Semantics

This paper proposes a bisimulation theory based on multiparty session types where a choreography specification governs the behaviour of session typed processes and their observer. The bisimulation is defined with the observer cooperating with the observed process in order to form complete global session scenarios and usable for proving correctness of optimisations for globally coordinating threads and processes. The induced bisimulation is strictly more fine-grained than the standard session bisimulation. The difference between the governed and standard bisimulations only appears when more than two interleaved multiparty sessions exist. This distinct feature enables to reason real scenarios in the large-scale distributed system where multiple choreographic sessions need to be interleaved. The compositionality of the governed bisimilarity is proved through the soundness and completeness with respect to the governed reduction-based congruence. Finally, its usage is demonstrated by a thread transformation governed under multiple sessions in a real usecase in the large-scale cyberinfrustracture

Fine-grained and coarse-grained reactive noninterference

International audienceWe study the security property of noninterference in a core synchronous reactive language that we call CRL. In the synchronous reactive paradigm, programs communicate by means of broadcast events, and their parallel execution is regulated by a notion of instant. We first show that CRL programs are indeed reactive, namely that they always converge to a state of termination or suspension ("end of instant") in a finite number of steps. We define two bisimulation equivalences on CRL programs, corresponding respectively to a fine-grained and to a coarse-grained observation of programs. We show that coarse-grained bisimilarity is more abstract than fine-grained bisimilarity, as it is insensitive to the order of generation of events and to repeated emissions of the same event during an instant. Based on these bisimulations, two properties of Reactive Noninterference (RNI) are introduced, formalising secure information flow. Both properties are time-insensitive and termination-insensitive. Again, coarse-grained RNI is more abstract than fine-grained RNI. Finally, a type system guaranteeing both security properties is presented. Thanks to a design choice of CRL, which offers two separate constructs for loops and iteration, and to refined typing rules, this type system allows for a precise treatment of termination leaks, which are an issue in parallel languages

Genomic analysis of shiga toxin-containing Escherichia coli O157:H7 isolated from Argentinean cattle

Cattle are the main reservoir of Enterohemorrhagic Escherichia coli (EHEC), with O157:H7 the distinctive serotype. EHEC is the main causative agent of a severe systemic disease, Hemolytic Uremic Syndrome (HUS). Argentina has the highest pediatric HUS incidence worldwide with 12–14 cases per 100,000 children. Herein, we assessed the genomes of EHEC O157:H7 isolates recovered from cattle in the humid Pampas of Argentina. According to phylogenetic studies, EHEC O157 can be divided into clades. Clade 8 strains that were classified as hypervirulent. Most of the strains of this clade have a Shiga toxin stx2a-stx2c genotype. To better understand the molecular bases related to virulence, pathogenicity and evolution of EHEC O157:H7, we performed a comparative genomic analysis of these isolates through whole genome sequencing. The isolates classified as clade 8 (four strains) and clade 6 (four strains) contained 13 to 16 lambdoid prophages per genome, and the observed variability of prophages was analysed. An inter strain comparison show that while some prophages are highly related and can be grouped into families, other are unique. Prophages encoding for stx2a were highly diverse, while those encoding for stx2c were conserved. A cluster of genes exclusively found in clade 8 contained 13 genes that mostly encoded for DNA binding proteins. In the studied strains, polymorphisms in Q antiterminator, the Q-stx2A intergenic region and the O and P γ alleles of prophage replication proteins are associated with different levels of Stx2a production. As expected, all strains had the pO157 plasmid that was highly conserved, although one strain displayed a transposon interruption in the protease EspP gene. This genomic analysis may contribute to the understanding of the genetic basis of the hypervirulence of EHEC O157:H7 strains circulating in Argentine cattle. This work aligns with other studies of O157 strain variation in other populations that shows key differences in Stx2a-encoding prophages

GeantV: Results from the prototype of concurrent vector particle transport simulation in HEP

Full detector simulation was among the largest CPU consumer in all CERN experiment software stacks for the first two runs of the Large Hadron Collider (LHC). In the early 2010's, the projections were that simulation demands would scale linearly with luminosity increase, compensated only partially by an increase of computing resources. The extension of fast simulation approaches to more use cases, covering a larger fraction of the simulation budget, is only part of the solution due to intrinsic precision limitations. The remainder corresponds to speeding-up the simulation software by several factors, which is out of reach using simple optimizations on the current code base. In this context, the GeantV R&D project was launched, aiming to redesign the legacy particle transport codes in order to make them benefit from fine-grained parallelism features such as vectorization, but also from increased code and data locality. This paper presents extensively the results and achievements of this R&D, as well as the conclusions and lessons learnt from the beta prototype.Comment: 34 pages, 26 figures, 24 table

Probabilistic Anonymity

The concept of anonymity comes into play in a wide range of situations, varying from voting and anonymous donations to postings on bulletin boards and sending mails. A formal definition of this concept has been given in literature in terms of nondeterminism. In this paper, we investigate a notion of anonymity based on probability theory, and we we discuss the relation with the nondeterministic one. We then formulate this definition in terms of observables for processes in the probabilistic $pi$-calculus, and propose a method to verify automatically the anonymity property. We illustrate the method by using the example of the dining cryptographers