423 research outputs found

    Scaling Bounded Model Checking By Transforming Programs With Arrays

    Full text link
    Bounded Model Checking is one the most successful techniques for finding bugs in program. However, model checkers are resource hungry and are often unable to verify programs with loops iterating over large arrays.We present a transformation that enables bounded model checkers to verify a certain class of array properties. Our technique transforms an array-manipulating (ANSI-C) program to an array-free and loop-free (ANSI-C) program thereby reducing the resource requirements of a model checker significantly. Model checking of the transformed program using an off-the-shelf bounded model checker simulates the loop iterations efficiently. Thus, our transformed program is a sound abstraction of the original program and is also precise in a large number of cases - we formally characterize the class of programs for which it is guaranteed to be precise. We demonstrate the applicability and usefulness of our technique on both industry code as well as academic benchmarks

    Analysis of hadronic transitions in Υ(3S) decays

    Get PDF
    This is the publisher's version, also available electronically from http://journals.aps.org/prd/abstract/10.1103/PhysRevD.49.40.Using the CLEO II detector, we have measured the branching fractions for Υ(3S)→ππΥ(1S), Υ(3S)→ππΥ(2S), and the cascade Υ(3S)→Υ(2S)+X, Υ(2S)→π+π−Υ(1S), analyzing the exclusive mode where the daughter Υ state decays to a e(+)e(−) or μ(+)μ(−) pair, as well as the inclusive π(+)π(−) transitions where the final Υ state decays into hadrons. Properties of the ππ system are analyzed. Searches for the cascade decay Υ(3S)→π+π−h(b), h(b)→γη(b) and Υ(3S)→π0h(b) were also performed

    Rich Counter-Examples for Temporal-Epistemic Logic Model Checking

    Full text link
    Model checking verifies that a model of a system satisfies a given property, and otherwise produces a counter-example explaining the violation. The verified properties are formally expressed in temporal logics. Some temporal logics, such as CTL, are branching: they allow to express facts about the whole computation tree of the model, rather than on each single linear computation. This branching aspect is even more critical when dealing with multi-modal logics, i.e. logics expressing facts about systems with several transition relations. A prominent example is CTLK, a logic that reasons about temporal and epistemic properties of multi-agent systems. In general, model checkers produce linear counter-examples for failed properties, composed of a single computation path of the model. But some branching properties are only poorly and partially explained by a linear counter-example. This paper proposes richer counter-example structures called tree-like annotated counter-examples (TLACEs), for properties in Action-Restricted CTL (ARCTL), an extension of CTL quantifying paths restricted in terms of actions labeling transitions of the model. These counter-examples have a branching structure that supports more complete description of property violations. Elements of these counter-examples are annotated with parts of the property to give a better understanding of their structure. Visualization and browsing of these richer counter-examples become a critical issue, as the number of branches and states can grow exponentially for deeply-nested properties. This paper formally defines the structure of TLACEs, characterizes adequate counter-examples w.r.t. models and failed properties, and gives a generation algorithm for ARCTL properties. It also illustrates the approach with examples in CTLK, using a reduction of CTLK to ARCTL. The proposed approach has been implemented, first by extending the NuSMV model checker to generate and export branching counter-examples, secondly by providing an interactive graphical interface to visualize and browse them.Comment: In Proceedings IWIGP 2012, arXiv:1202.422

    RAC: Repository of Antibiotic resistance Cassettes

    Get PDF
    Antibiotic resistance in bacteria is often due to acquisition of resistance genes associated with different mobile genetic elements. In Gram-negative bacteria, many resistance genes are found as part of small mobile genetic elements called gene cassettes, generally found integrated into larger elements called integrons. Integrons carrying antibiotic resistance gene cassettes are often associated with mobile elements and here are designated ‘mobile resistance integrons’ (MRIs). More than one cassette can be inserted in the same integron to create arrays that contribute to the spread of multi-resistance. In many sequences in databases such as GenBank, only the genes within cassettes, rather than whole cassettes, are annotated and the same gene/cassette may be given different names in different entries, hampering analysis. We have developed the Repository of Antibiotic resistance Cassettes (RAC) website to provide an archive of gene cassettes that includes alternative gene names from multiple nomenclature systems and allows the community to contribute new cassettes. RAC also offers an additional function that allows users to submit sequences containing cassettes or arrays for annotation using the automatic annotation system Attacca. Attacca recognizes features (gene cassettes, integron regions) and identifies cassette arrays as patterns of features and can also distinguish minor cassette variants that may encode different resistance phenotypes (aacA4 cassettes and bla cassettes-encoding β-lactamases). Gaps in annotations are manually reviewed and those found to correspond to novel cassettes are assigned unique names. While there are other websites dedicated to integrons or antibiotic resistance genes, none includes a complete list of antibiotic resistance gene cassettes in MRI or offers consistent annotation and appropriate naming of all of these cassettes in submitted sequences. RAC thus provides a unique resource for researchers, which should reduce confusion and improve the quality of annotations of gene cassettes in integrons associated with antibiotic resistance

    Thermal based remediation technologies for soil and groundwater: a review

    Get PDF
    Thermal remediation technologies are fast and effective tools for the remediation of contaminated soils and sediments. Nevertheless, the high energy consumption and the effect of high temperature on the soil properties may hinder the wide applications of thermal remediation methods. This review highlights the recent studies focused on thermal remediation. Eight types of thermal remediation processes are discussed, including incineration, thermal desorption, stream enhanced extraction, electrical resistance heating, microwave heating, smoldering, vitrification, and pyrol-ysis. In addition, the combination of thermal remediation with other remediation technologies is presented. Finally, thermal remediation sustainability is evaluated in terms of energy efficiency and their impact on soil properties. The developments of the past decade show that thermal-based technologies are quite effective in terms of contaminant removal but that these technologies are associated with high energy use and costs and can has an adverse impact on soil properties. Nonetheless, it is anticipated that continued research on thermally based technologies can increase their sustainability and expand their applications. Low temperature thermal desorption is a prom-ising remediation technology in terms of land use and energy cost as it has no adverse effect on soil function after treatment and low temperature is required. Overall, selecting the sustainable remediation technology depends on the contaminant properties, soil properties and predicted risk level. © 2022 Desalination Publications. All rights reserved

    Branching Fractions for D0 -> K+K- and D0 -> pi+pi-, and a Search for CP Violation in D0 Decays

    Full text link
    Using the large hadroproduced charm sample collected in experiment E791 at Fermilab, we have measured ratios of branching fractions for the two-body singly-Cabibbo-suppressed charged decays of the D0: (D0 -> KK)/(D0 -> Kpi) = 0.109 +- 0.003 +- 0.003, (D0 -> pipi)/(D0 -> Kpi) = 0.040 +- 0.002 +- 0.003, and (D0 -> KK)/(D0 -> pipi) = 2.75 +- 0.15 +- 0.16. We have looked for differences in the decay rates of D0 and D0bar to the CP eigenstates K+K- and pi+pi-, and have measured the CP asymmetry parameters A_CP(K+K-) = -0.010 +- 0.049 +- 0.012 and A_CP(pi+pi-) = -0.049 +- 0.078 +- 0.030, both consistent with zero.Comment: 10 Postscript pages, including 2 figures. Submitted to Phys. Lett.

    Search for Rare and Forbidden Dilepton Decays of the D+, Ds, and D0 Charmed Mesons

    Full text link
    We report the results of a search for flavor-changing neutral current, lepton-flavor violating, and lepton-number violating decays of D+, Ds, and D0 mesons (and their antiparticles) into modes containing muons and electrons. Using data from Fermilab charm hadroproduction experiment E791, we examine the pi,l,l and K,l,l decay modes of D+ and Ds and the l+l- decay modes of D0. No evidence for any of these decays is found. Therefore, we present branching-fraction upper limits at 90% confidence level for the 24 decay modes examined. Eight of these modes have no previously reported limits, and fourteen are reported with significant improvements over previously published results.Comment: 12 pages, 3 figures, LaTeX, elsart.cls, epsf.sty, amsmath.sty Submitted to Physics Letters

    Measurement of the Ds Lifetime

    Full text link
    We report the results of a precise measurement of the Ds meson lifetime based on 1662 +/- 56 fully reconstructed Ds -> phi pi decays, from the charm hadroproduction experiment E791 at Fermilab. Using an unbinned maximum likelihood fit, we measure the Ds lifetime to be 0.518 +/- 0.014 +/- 0.007 ps. The ratio of the measured Ds lifetime to the world average D0 lifetime is 1.25 +/- 0.04. This result differs from unity by six standard deviations, indicating significantly different lifetimes for the Ds and the D0.Comment: 12 pages, 3 figures, 2 table. LaTe
    • …
    corecore