Simple and Fast Biased Locks

Locks are used to ensure exclusive access to shared memory locations. Unfortunately, lock operations are expensive, so much work has been done on optimizing their performance for common access patterns. One such pattern is found in networking applications, where there is a single thread dominating lock accesses. An important special case arises when a single-threaded program calls a thread-safe library that uses locks. An effective way to optimize the dominant-thread pattern is to "bias" the lock implementation so that accesses by the dominant thread have negligible overhead. We take this approach in this work: we simplify and generalize existing techniques for biased locks, producing a large design space with many trade-offs. For example, if we assume the dominant process acquires the lock infinitely often (a reasonable assumption for packet processing), it is possible to make the dominant process perform a lock operation without expensive fence or compare-and-swap instructions. This gives a very low overhead solution; we confirm its efficacy by experiments. We show how these constructions can be extended for lock reservation, re-reservation, and to reader-writer situations

Abstract Interpretation of Stateful Networks

Modern networks achieve robustness and scalability by maintaining states on their nodes. These nodes are referred to as middleboxes and are essential for network functionality. However, the presence of middleboxes drastically complicates the task of network verification. Previous work showed that the problem is undecidable in general and EXPSPACE-complete when abstracting away the order of packet arrival. We describe a new algorithm for conservatively checking isolation properties of stateful networks. The asymptotic complexity of the algorithm is polynomial in the size of the network, albeit being exponential in the maximal number of queries of the local state that a middlebox can do, which is often small. Our algorithm is sound, i.e., it can never miss a violation of safety but may fail to verify some properties. The algorithm performs on-the fly abstract interpretation by (1) abstracting away the order of packet processing and the number of times each packet arrives, (2) abstracting away correlations between states of different middleboxes and channel contents, and (3) representing middlebox states by their effect on each packet separately, rather than taking into account the entire state space. We show that the abstractions do not lose precision when middleboxes may reset in any state. This is encouraging since many real middleboxes reset, e.g., after some session timeout is reached or due to hardware failure

Parameterized Verification of Graph Transformation Systems with Whole Neighbourhood Operations

We introduce a new class of graph transformation systems in which rewrite rules can be guarded by universally quantified conditions on the neighbourhood of nodes. These conditions are defined via special graph patterns which may be transformed by the rule as well. For the new class for graph rewrite rules, we provide a symbolic procedure working on minimal representations of upward closed sets of configurations. We prove correctness and effectiveness of the procedure by a categorical presentation of rewrite rules as well as the involved order, and using results for well-structured transition systems. We apply the resulting procedure to the analysis of the Distributed Dining Philosophers protocol on an arbitrary network structure.Comment: Extended version of a submittion accepted at RP'14 Worksho

Approximate Reachability for Dead Code Elimination in Esterel*

Esterel is an imperative synchronous programming language for the design of reactive systems. Esterel* extends Esterel with a non-instantaneous jump instruction (compatible with concurrency, preemption, etc.) so as to enable powerful source-to-source program transformations, amenable to formal verification. In this work, we propose an approximate reachability algorithm for Esterel* and use its output to remove dead code. We prove the correctness of our techniques

A Fully Verified Executable LTL Model Checker

International audienceWe present an LTL model checker whose code has been completely verified using the Isabelle theorem prover. The checker consists of over 4000 lines of ML code. The code is produced using recent Isabelle technology called the Refinement Framework, which allows us to split its correctness proof into (1) the proof of an abstract version of the checker, consisting of a few hundred lines of “formalized pseudocode”, and (2) a verified refinement step in which mathematical sets and other abstract structures are replaced by implementations of efficient structures like red-black trees and functional arrays. This leads to a checker that, while still slower than unverified checkers, can already be used as a trusted reference implementation against which advanced implementations can be tested. We report on the structure of the checker, the development process, and some experiments on standard benchmarks

Phototriggered release of tetrapeptide AAPV from coumarinyl and pyrenyl cages

Ala-Ala-Pro-Val (AAPV) is a bioactive tetrapeptide that inhibits human neutrophil elastase (HNE), an enzyme involved in skin chronic inflammatory diseases like psoriasis. Caged derivatives of this peptide were prepared by proper N- and C-terminal derivatisation through a carbamate or ester linkage, respectively, with two photoactive moieties, namely 7-methoxycoumarin-2-ylmethyl and pyren-2-ylmethyl groups. These groups were chosen to assess the influence of the photosensitive group and the type of linkage in the controlled photorelease of the active molecule. The caged peptides were irradiated at selected wavelengths of irradiation (254, 300, and 350 nm), and the photolytic process was monitored by HPLC-UV. The results established the applicability of the tested photoactive groups for the release of AAPV, especially for the derivative bearing the carbamate-linked pyrenylmethyl group, which displayed the shortest irradiation times for the release at the various wavelengths of irradiation (ca. 4 min at 254 nm, 8 min at 300 nm and 46 min at 350 nm).Thanks are due to the Fundação para a Ciência e Tecnologia (FCT, Portugal) for financial support to the portuguese NMR network (PTNMR, Bruker Avance III 400- Univ. Minho), FCT and FEDER (European Fund for Regional Development)- COMPETE-QREN-EU for financial support through the Chemistry Research Centre of the University of Minho (Ref. UID/QUI/00686/2013 and UID/QUI/0686/2016). A PhD grant to A.M.S. (SFRH/BD/80813/2011) is also acknowledged.info:eu-repo/semantics/publishedVersio

Recency of immersion in L2 environment more important than L2 proficiency in speech segmentation

Speech segmentation is a language-specific skill: each language provides different cues for optimally segmenting the continuous speech stream into words. When exposed to a novel language, listeners have been shown to use those segmentation cues that they are familiar with from their native language (L1)

Design and analysis of solid state transformer

This paper tries to make appoint that Solid State Transformer is an effective replacement for the conventional L F (Low frequency) transformer. The common topologies of SST are discussed. The present drawbacks of LF transformer and the advantages and future applications of Solid State Transformer are also mentioned. A Solid State Transformer is a bit complex system to barrier of universal acceptance is discussed and projected. In this paper discusses the features of power electronic based solid state transformer and its application in different electrical field, where conventional transformer can be replaced by the solid state transformer