9,069 research outputs found

    Finite domain constraint programming systems

    Get PDF
    Tutorial at CP'2002, Principles and Practice of Constraint Programming. Powerpoint slides.</p

    A Static Analyzer for Large Safety-Critical Software

    Get PDF
    We show that abstract interpretation-based static program analysis can be made efficient and precise enough to formally verify a class of properties for a family of large programs with few or no false alarms. This is achieved by refinement of a general purpose static analyzer and later adaptation to particular programs of the family by the end-user through parametrization. This is applied to the proof of soundness of data manipulation operations at the machine level for periodic synchronous safety critical embedded software. The main novelties are the design principle of static analyzers by refinement and adaptation through parametrization, the symbolic manipulation of expressions to improve the precision of abstract transfer functions, the octagon, ellipsoid, and decision tree abstract domains, all with sound handling of rounding errors in floating point computations, widening strategies (with thresholds, delayed) and the automatic determination of the parameters (parametrized packing)

    Invariant Generation through Strategy Iteration in Succinctly Represented Control Flow Graphs

    Full text link
    We consider the problem of computing numerical invariants of programs, for instance bounds on the values of numerical program variables. More specifically, we study the problem of performing static analysis by abstract interpretation using template linear constraint domains. Such invariants can be obtained by Kleene iterations that are, in order to guarantee termination, accelerated by widening operators. In many cases, however, applying this form of extrapolation leads to invariants that are weaker than the strongest inductive invariant that can be expressed within the abstract domain in use. Another well-known source of imprecision of traditional abstract interpretation techniques stems from their use of join operators at merge nodes in the control flow graph. The mentioned weaknesses may prevent these methods from proving safety properties. The technique we develop in this article addresses both of these issues: contrary to Kleene iterations accelerated by widening operators, it is guaranteed to yield the strongest inductive invariant that can be expressed within the template linear constraint domain in use. It also eschews join operators by distinguishing all paths of loop-free code segments. Formally speaking, our technique computes the least fixpoint within a given template linear constraint domain of a transition relation that is succinctly expressed as an existentially quantified linear real arithmetic formula. In contrast to previously published techniques that rely on quantifier elimination, our algorithm is proved to have optimal complexity: we prove that the decision problem associated with our fixpoint problem is in the second level of the polynomial-time hierarchy.Comment: 35 pages, conference version published at ESOP 2011, this version is a CoRR version of our submission to Logical Methods in Computer Scienc

    Fusion pacing with biventricular, left ventricular-only and multipoint pacing in cardiac resynchronisation therapy: Latest evidence and strategies for use

    Get PDF
    Despite advances in the field of cardiac resynchronisation therapy (CRT), response rates and durability of therapy remain relatively static. Optimising device timing intervals may be the most common modifiable factor influencing CRT efficacy after implantation. This review addresses the concept of fusion pacing as a method for improving patient outcomes with CRT. Fusion pacing describes the delivery of CRT pacing with a programming strategy to preserve intrinsic atrioventricular (AV) conduction and ventricular activation via the right bundle branch. Several methods have been assessed to achieve fusion pacing. QRS complex duration (QRSd) shortening with CRT is associated with improved clinical response. Dynamic algorithm-based optimisation targeting narrowest QRSd in patients with intact AV conduction has shown promise in people with heart failure with left bundle branch block. Individualised dynamic programming achieving fusion may achieve the greatest magnitude of electrical synchrony, measured by QRSd narrowing
    • …
    corecore