4,753 research outputs found

    Quiescent consistency: Defining and verifying relaxed linearizability

    Get PDF
    Concurrent data structures like stacks, sets or queues need to be highly optimized to provide large degrees of parallelism with reduced contention. Linearizability, a key consistency condition for concurrent objects, sometimes limits the potential for optimization. Hence algorithm designers have started to build concurrent data structures that are not linearizable but only satisfy relaxed consistency requirements. In this paper, we study quiescent consistency as proposed by Shavit and Herlihy, which is one such relaxed condition. More precisely, we give the first formal definition of quiescent consistency, investigate its relationship with linearizability, and provide a proof technique for it based on (coupled) simulations. We demonstrate our proof technique by verifying quiescent consistency of a (non-linearizable) FIFO queue built using a diffraction tree. © 2014 Springer International Publishing Switzerland

    Verifying linearizability on TSO architectures

    Get PDF
    Linearizability is the standard correctness criterion for fine-grained, non-atomic concurrent algorithms, and a variety of methods for verifying linearizability have been developed. However, most approaches assume a sequentially consistent memory model, which is not always realised in practice. In this paper we define linearizability on a weak memory model: the TSO (Total Store Order) memory model, which is implemented in the x86 multicore architecture. We also show how a simulation-based proof method can be adapted to verify linearizability for algorithms running on TSO architectures. We demonstrate our approach on a typical concurrent algorithm, spinlock, and prove it linearizable using our simulation-based approach. Previous approaches to proving linearizabilty on TSO architectures have required a modification to the algorithm's natural abstract specification. Our proof method is the first, to our knowledge, for proving correctness without the need for such modification

    Viewpoint consistency in Z and LOTOS: A case study

    Get PDF
    Specification by viewpoints is advocated as a suitable method of specifying complex systems. Each viewpoint describes the envisaged system from a particular perspective, using concepts and specification languages best suited for that perspective. Inherent in any viewpoint approach is the need to check or manage the consistency of viewpoints and to show that the different viewpoints do not impose contradictory requirements. In previous work we have described a range of techniques for consistency checking, refinement, and translation between viewpoint specifications, in particular for the languages LOTOS and Z. These two languages are advocated in a particular viewpoint model, viz. that of the Open Distributed Processing (ODP) reference model. In this paper we present a case study which demonstrates how all these techniques can be combined in order to show consistency between a viewpoint specified in LOTOS and one specified in Z. Keywords: Viewpoints; Consistency; Z; LOTOS; ODP

    Deriving real-time action systems with multiple time bands using algebraic reasoning

    Get PDF
    The verify-while-develop paradigm allows one to incrementally develop programs from their specifications using a series of calculations against the remaining proof obligations. This paper presents a derivation method for real-time systems with realistic constraints on their behaviour. We develop a high-level interval-based logic that provides flexibility in an implementation, yet allows algebraic reasoning over multiple granularities and sampling multiple sensors with delay. The semantics of an action system is given in terms of interval predicates and algebraic operators to unify the logics for an action system and its properties, which in turn simplifies the calculations and derivations

    Differences between Monte Carlo models for DIS at small-x and the relation to BFKL dynamics

    Full text link
    The differences between two standard Monte Carlo models, Lepto and Ariadne, for deep inelastic scattering at small-x is analysed in detail. It is shown that the difference arises from a `unorthodox' suppression factor used in Ariadne which replaces the normal ratio of parton densities. This gives rise to a factor that qualitatively is similar to what one would expect from BFKL dynamics for some observables like the energy flow and forward jets but not for the 2+1 jet cross-section. It is also discussed how one could use the 2+1 jet cross-section as a probe for BFKL dynamics.Comment: 10 pages Latex, 4 eps figure

    Diffractive deeply inelastic scattering of hadronic states with small transverse size

    Get PDF
    Diffractive deeply inelastic scattering from a hadron is described in terms of diffractive quark and gluon distributions. If the transverse size of the hadronic state is sufficiently small, these distributions are calculable using perturbation theory. We present such a calculation and discuss the underlying dynamics. We comment on the relation between this dynamics and the pattern of scaling violation observed in the hard diffraction of large-size states at HERA.Comment: 8 pages including 3 figures, REVTE

    Supporting ODP - Translating LOTOS to Z

    Get PDF
    This paper describes a translation of full LOTOS into Z. A common semantic model is defined and the translation is proved correct with respect to the semantics. The motivation for such a translation is the use of multiple viewpoints for specifying complex systems defined by the reference model of the Open Distributed Processing (ODP) standardization initiative. The postscript version available here is an extended version of what was published

    Defining correctness conditions for concurrent objects in multicore architectures

    Get PDF
    Correctness of concurrent objects is defined in terms of conditions that determine allowable relationships between histories of a concurrent object and those of the corresponding sequential object. Numerous correctness conditions have been proposed over the years, and more have been proposed recently as the algorithms implementing concurrent objects have been adapted to cope with multicore processors with relaxed memory architectures. We present a formal framework for defining correctness conditions for multicore architectures, covering both standard conditions for totally ordered memory and newer conditions for relaxed memory, which allows them to be expressed in uniform manner, simplifying comparison. Our framework distinguishes between order and commitment properties, which in turn enables a hierarchy of correctness conditions to be established. We consider the Total Store Order (TSO) memory model in detail, formalise known conditions for TSO using our framework, and develop sequentially consistent variations of these. We present a work-stealing deque for TSO memory that is not linearizable, but is correct with respect to these new conditions. Using our framework, we identify a new non-blocking compositional condition, fence consistency, which lies between known conditions for TSO, and aims to capture the intention of a programmer-specified fence

    Can One Distinguish Tau Neutrinos from Antineutrinos in Neutral-Current Pion Production Processes?

    Get PDF
    A potential way to distinguish tau-neutrinos from antineutrinos, below the tau-production threshold, but above the pion production one, is presented. It is based on the different behavior of the neutral current pion production off the nucleon, depending on whether it is induced by neutrinos or antineutrinos. This procedure for distinguishing tau-neutrinos from antineutrinos neither relies on any nuclear model, nor it is affected by any nuclear effect (distortion of the outgoing nucleon waves, etc...). We show that neutrino-antineutrino asymmetries occur both in the totally integrated cross sections and in the pion azimuthal differential distributions. To define the asymmetries for the latter distributions we just rely on Lorentz-invariance. All these asymmetries are independent of the lepton family and can be experimentally measured by using electron or muon neutrinos, due to the lepton family universality of the neutral current neutrino interaction. Nevertheless and to estimate their size, we have also used the chiral model of hep-ph/0701149 at intermediate energies. Results are really significant since the differences between neutrino and antineutrino induced reactions are always large in all physical channels.Comment: Revised version. 8 pages, 3 figures. The abstract has been changed and discussion extende
    • …
    corecore