343 research outputs found

    Modeling pollen-mediated gene flow from glyphosate-resistant to -susceptible giant ragweed (\u3ci\u3eAmbrosia trifida\u3c/i\u3e L.) under field conditions

    Get PDF
    A field experiment was conducted to quantify pollen mediated gene flow (PMGF) from glyphosateresistant (GR) to glyphosate-susceptible (GS) giant ragweed under simulated field conditions using glyphosate resistance as a selective marker. Field experiments were conducted in a concentric design with the GR giant ragweed pollen source planted in the center and GS giant ragweed pollen receptors surrounding the center in eight directional blocks at specified distances (between 0.1 and 35 m in cardinal and ordinal directions; and additional 50 m for ordinal directions). Seeds of GS giant ragweed were harvested from the pollen receptor blocks and a total of 100,938 giant ragweed plants were screened with glyphosate applied at 2,520 g ae ha−1 and 16,813 plants confirmed resistant. The frequency of PMGF was fit to a double exponential decay model selected by information-theoretic criteria. The highest frequency of gene flow (0.43 to 0.60) was observed at ≤0.5 m from the pollen source and reduced rapidly with increasing distances; however, gene flow (0.03 to 0.04) was detected up to 50 m. The correlation between PMGF and wind parameters was inconsistent in magnitude, direction, and years

    Interpolation Properties and SAT-based Model Checking

    Full text link
    Craig interpolation is a widespread method in verification, with important applications such as Predicate Abstraction, CounterExample Guided Abstraction Refinement and Lazy Abstraction With Interpolants. Most state-of-the-art model checking techniques based on interpolation require collections of interpolants to satisfy particular properties, to which we refer as "collectives"; they do not hold in general for all interpolation systems and have to be established for each particular system and verification environment. Nevertheless, no systematic approach exists that correlates the individual interpolation systems and compares the necessary collectives. This paper proposes a uniform framework, which encompasses (and generalizes) the most common collectives exploited in verification. We use it for a systematic study of the collectives and of the constraints they pose on propositional interpolation systems used in SAT-based model checking

    TIME-DOMAIN AND FREQUENCY-DOMAIN REFLECTOMETRY TYPE SOIL MOISTURE SENSOR PERFORMANCE AND SOIL TEMPERATURE EFFECTS IN FINE- AND COARSE-TEXTURED SOILS

    Get PDF
    The performances of six time-domain reflectometry (TDR) and frequency-domain reflectometry (FDR) type soil moisture sensors were investigated for measuring volumetric soil-water content (θv) in two different soil types. Soil-specific calibration equations were developed for each sensor using calibrated neutron probe-measured θv. Sensors were also investigated for their performance response in measuring θv to changes in soil temperature. The performance of all sensors was significantly different (P\u3c0.05) than the neutron probe-measured θv, with the same sensor also exhibiting variation between soils. In the silt loam soil, the 5TE sensor had the lowest root mean squared error (RMSE) of 0.041 m3/m3, indicating the best performance among all sensors investigated. The performance ranking of the other sensors from high performance to low was: TDR300 (High Clay Mode), CS616 (H) and 10HS, SM150, TDR300 (Standard Mode), and CS616 (V) (H: horizontal installation and V: vertical installation). In the loamy sand, the CS616 (H) performed best with an RMSE of 0.014 m3/m3 and the performance ranking of other sensors was: 5TE, CS616 (V), TDR300 (S), SM150, and 10HS. When θv was near or above field capacity, the performance error of most sensors increased. Most sensors exhibited a linear response to increase in soil temperature. Most sensors exhibited substantial sensitivity to changes in soil temperature and the θv response of the same sensor to high vs. normal soil temperatures differed significantly between the soils. All sensors underestimated θv in high temperature range in both soils. The ranking order of the magnitude of change in θv in response to 1°C increase in soil temperature (from the lowest to the greatest impact of soil temperature on sensor performance) in silt loam soil was: SM150, 5TE, TDR300 (S), 10HS, CS620, CS616 (H), and CS616 (V). The ranking order from lower to higher sensitivity to soil temperature changes in loamy sand was: 10HS, CS616 (H), 5TE, CS616 (V), SM150, and TDR300 (S). When the data from all sensors and soils are pooled, the overall average of change in θv for a 1°C increase in soil temperature was 0.21 m3/m3 in silt loam soil and -0.052 m3/m3 in loamy sand. When all TDR- and FDR-type sensors were pooled separately for both soils, the average change in θv for a 1°C increase in soil temperature for the TDR- and FDR-type sensors was 0.1918 and -0.0273 m3/m3, respectively, indicating that overall TDR-type sensors are more sensitive to soil temperature changes than FDR-type sensors when measuring θv

    Automatic Verification of Erlang-Style Concurrency

    Full text link
    This paper presents an approach to verify safety properties of Erlang-style, higher-order concurrent programs automatically. Inspired by Core Erlang, we introduce Lambda-Actor, a prototypical functional language with pattern-matching algebraic data types, augmented with process creation and asynchronous message-passing primitives. We formalise an abstract model of Lambda-Actor programs called Actor Communicating System (ACS) which has a natural interpretation as a vector addition system, for which some verification problems are decidable. We give a parametric abstract interpretation framework for Lambda-Actor and use it to build a polytime computable, flow-based, abstract semantics of Lambda-Actor programs, which we then use to bootstrap the ACS construction, thus deriving a more accurate abstract model of the input program. We have constructed Soter, a tool implementation of the verification method, thereby obtaining the first fully-automatic, infinite-state model checker for a core fragment of Erlang. We find that in practice our abstraction technique is accurate enough to verify an interesting range of safety properties. Though the ACS coverability problem is Expspace-complete, Soter can analyse these verification problems surprisingly efficiently.Comment: 12 pages plus appendix, 4 figures, 1 table. The tool is available at http://mjolnir.cs.ox.ac.uk/soter

    Sharper and Simpler Nonlinear Interpolants for Program Verification

    Full text link
    Interpolation of jointly infeasible predicates plays important roles in various program verification techniques such as invariant synthesis and CEGAR. Intrigued by the recent result by Dai et al.\ that combines real algebraic geometry and SDP optimization in synthesis of polynomial interpolants, the current paper contributes its enhancement that yields sharper and simpler interpolants. The enhancement is made possible by: theoretical observations in real algebraic geometry; and our continued fraction-based algorithm that rounds off (potentially erroneous) numerical solutions of SDP solvers. Experiment results support our tool's effectiveness; we also demonstrate the benefit of sharp and simple interpolants in program verification examples

    Splitting Proofs for Interpolation

    Full text link
    We study interpolant extraction from local first-order refutations. We present a new theoretical perspective on interpolation based on clearly separating the condition on logical strength of the formula from the requirement on the com- mon signature. This allows us to highlight the space of all interpolants that can be extracted from a refutation as a space of simple choices on how to split the refuta- tion into two parts. We use this new insight to develop an algorithm for extracting interpolants which are linear in the size of the input refutation and can be further optimized using metrics such as number of non-logical symbols or quantifiers. We implemented the new algorithm in first-order theorem prover VAMPIRE and evaluated it on a large number of examples coming from the first-order proving community. Our experiments give practical evidence that our work improves the state-of-the-art in first-order interpolation.Comment: 26th Conference on Automated Deduction, 201

    Reversing resistance to tembotrione in an Amaranthus tuberculatus (var. rudis) population from Nebraska, USA with cytochrome P450 inhibitors

    Get PDF
    Background: A population of Amaranthus tuberculatus (var. rudis) was confirmed resistant to 4-hydroxyphenylpyruvate dioxygenase (HPPD)-inhibitor herbicides (mesotrione, tembotrione, and topramezone) in a seed corn/soybean rotation in Nebraska. Further investigation confirmed a non-target-site resistance mechanism in this population. The main objective of this study was to explore the role of cytochrome P450 inhibitors in restoring the efficacy of HPPD-inhibitor herbicides on the HPPD-inhibitor resistant A. tuberculatus population from Nebraska, USA (HPPD-R). Background: A population of Amaranthus tuberculatus (var. rudis) was confirmed resistant to 4-hydroxyphenylpyruvate dioxygenase (HPPD)-inhibitor herbicides (mesotrione, tembotrione, and topramezone) in a seed corn/soybean rotation in Nebraska. Further investigation confirmed a non-target-site resistance mechanism in this population. The main objective of this study was to explore the role of cytochrome P450 inhibitors in restoring the efficacy of HPPD-inhibitor herbicides on the HPPD-inhibitor resistant A. tuberculatus population from Nebraska, USA (HPPD-R). Results: Enhanced metabolism via cytochrome P450 enzymes is the mechanism of resistance in HPPD-R. Amitrole partially restored the activity of mesotrione, whereas malathion, amitrole, and piperonyl butoxide restored the activity of tembotrione and topramezone in HPPD-R. Although corn was injured through malathion followed by mesotrione application a week after treatment, the injury was transient, and the crop recovered. Includes supplementary file

    Intersection and Rotation of Assumption Literals Boosts Bug-Finding

    Get PDF
    SAT-based techniques comprise the state-of-the-art in functional verification of safety-critical hardware and software, including IC3/PDR-based model checking and Bounded Model Checking (BMC). BMC is the incontrovertible best method for unsafety checking, aka bug-finding. Complementary Approximate Reachability (CAR) and IC3/PDR complement BMC for bug-finding by detecting different sets of bugs. To boost the efficiency of formal verification, we introduce heuristics involving intersection and rotation of the assumption literals used in the SAT encodings of these techniques. The heuristics generate smaller unsat cores and diverse satisfying assignments that help in faster convergence of these techniques, and have negligible runtime overhead. We detail these heuristics, incorporate them in CAR, and perform an extensive experimental evaluation of their performance, showing a 25% boost in bug-finding efficiency of CAR.We contribute a detailed analysis of the effectiveness of these heuristics: their influence on SAT-based bug-finding enables detection of different bugs from BMCbased checking. We find the new heuristics are applicable to IC3/PDR-based algorithms as well, and contribute a modified clause generalization procedure
    • …
    corecore