Succinct Representations for Abstract Interpretation

Abstract interpretation techniques can be made more precise by distinguishing paths inside loops, at the expense of possibly exponential complexity. SMT-solving techniques and sparse representations of paths and sets of paths avoid this pitfall. We improve previously proposed techniques for guided static analysis and the generation of disjunctive invariants by combining them with techniques for succinct representations of paths and symbolic representations for transitions based on static single assignment. Because of the non-monotonicity of the results of abstract interpretation with widening operators, it is difficult to conclude that some abstraction is more precise than another based on theoretical local precision results. We thus conducted extensive comparisons between our new techniques and previous ones, on a variety of open-source packages.Comment: Static analysis symposium (SAS), Deauville : France (2012

Implementing Groundness Analysis with Definite Boolean Functions

The domain of definite Boolean functions, Def, can be used to express the groundness of, and trace grounding dependencies between, program variables in (constraint) logic programs. In this paper, previously unexploited computational properties of Def are utilised to develop an efficient and succinct groundness analyser that can be coded in Prolog. In particular, entailment checking is used to prevent unnecessary least upper bound calculations. It is also demonstrated that join can be defined in terms of other operations, thereby eliminating code and removing the need for preprocessing formulae to a normal form. This saves space and time. Furthermore, the join can be adapted to straightforwardly implement the downward closure operator that arises in set sharing analyses. Experimental results indicate that the new Def implementation gives favourable results in comparison with BDD-based groundness analyses

Efficient Generation of Correctness Certificates for the Abstract Domain of Polyhedra

Polyhedra form an established abstract domain for inferring runtime properties of programs using abstract interpretation. Computations on them need to be certified for the whole static analysis results to be trusted. In this work, we look at how far we can get down the road of a posteriori verification to lower the overhead of certification of the abstract domain of polyhedra. We demonstrate methods for making the cost of inclusion certificate generation negligible. From a performance point of view, our single-representation, constraints-based implementation compares with state-of-the-art implementations

Ureteroscopic lithotripsy for ureteral stones in children using holmium: yag laser energy: results of a multicentric survey

BACKGROUND: Holmium:YAG (Ho:YAG) laser lithotripsy has broadened the indications for ureteroscopic stone managements in adults, but few evidence are currently available in the pediatric population. OBJECTIVE: This article aimed to assess the outcome of Ho:YAG laser lithotripsy during retrograde ureteroscopic management of ureteral stones in different locations in children. STUDY DESIGN: The medical records of 149 patients (71 boys and 78 girls; median age 9.2 years) treated with Ho:YAG laser ureteroscopic lithotripsy in five international pediatric urology units over the last 5 years were retrospectively reviewed. Exclusion criteria included patients with renal calculi and/or with a history of ipsilateral stricture, renal failure, active urinary tract infection, or coagulation disorder. RESULTS: Stones were treated with dusting technique in all cases. The median stone size was 10.3 mm (range 5-17). Stones were located in the distal ureter in 77 cases (51.7%), in the middle ureter in 23 cases (15.4%), and in the proximal ureter in 49 cases (32.9%). The median operative time was 29.8 min (range 20-95). Intra-operative complications included five bleedings (3.3%) and seven stone retropulsions (4.7%). Overall stone-free rate was 97.3%. Overall postoperative complications rate was 4.0% and included two cases of stent migration (1.3%) (Clavien II) and four residual stone fragments (2.7%) that were successfully treated using the same technique (Clavien IIIb). On multivariate analysis, re-operation rate was significantly dependent on the proximal stone location and presence of residual fragments >2 mm (P = 0.001). DISCUSSION: This study is one of the largest pediatric series among those published until now. The study series reported a shorter operative time, a higher success rate, and a lower postoperative complications rate compared with previous series. A limitation of this study is that stone-free rates may be somewhat inaccurate using ultrasonography and plain X-ray compared with computed tomography (CT); the study's 97.3% success rate may be overestimated because no CT scan was done postoperatively to check the stone-free rate. Other limitations of this article include its retrospective nature, the multi-institutional participation, and the heterogeneous patient collective. CONCLUSION: The Ho:YAG laser ureteroscopic lithotripsy seems to be an excellent first-line treatment for children with ureteral stones, independently from primary location and size. However, patients with proximal ureteral stones and residual fragments >2 mm reported a higher risk to require a secondary procedure to become stone-free. Combination of techniques as well as appropriate endourologic tools are key points for the success of the procedure regardless of stones' size and location

Automatic Abstraction for Congruences

One approach to verifying bit-twiddling algorithms is to derive invariants between the bits that constitute the variables of a program. Such invariants can often be described with systems of congruences where in each equation $\vec{c} \cdot \vec{x} = d \mod m$, (unknown variable m)$is a power of two,$\vec{c}$is a vector of integer coefficients, and$\vec{x}$ is a vector of propositional variables (bits). Because of the low-level nature of these invariants and the large number of bits that are involved, it is important that the transfer functions can be derived automatically. We address this problem, showing how an analysis for bit-level congruence relationships can be decoupled into two parts: (1) a SAT-based abstraction (compilation) step which can be automated, and (2) an interpretation step that requires no SAT-solving. We exploit triangular matrix forms to derive transfer functions efficiently, even in the presence of large numbers of bits. Finally we propose program transformations that improve the analysis results

Unusual development of light-reflecting pigment cells in intact and regenerating tail in the periodic albino mutant of Xenopus laevis

Unusual light-reflecting pigment cells, “white pigment cells”, specifically appear in the periodic albino mutant (ap/ap) of Xenopus laevis and localize in the same place where melanophores normally differentiate in the wild-type. The mechanism responsible for the development of unusual pigment cells is unclear. In this study, white pigment cells in the periodic albino were compared with melanophores in the wild-type, using a cell culture system and a tail-regenerating system. Observations of both intact and cultured cells demonstrate that white pigment cells are unique in (1) showing characteristics of melanophore precursors at various stages of development, (2) accumulating reflecting platelets characteristic of iridophores, and (3) exhibiting pigment dispersion in response to α-melanocyte stimulating hormone (α-MSH) in the same way that melanophores do. When a tadpole tail is amputated, a functionally competent new tail is regenerated. White pigment cells appear in the mutant regenerating tail, whereas melanophores differentiate in the wild-type regenerating tail. White pigment cells in the mutant regenerating tail are essentially similar to melanophores in the wild-type regenerating tail with respect to their localization, number, and response to α-MSH. In addition to white pigment cells, iridophores which are never present in the intact tadpole tail appear specifically in the somites near the amputation level in the mutant regenerating tail. Iridophores are distinct from white pigment cells in size, shape, blue light-induced fluorescence, and response to α-MSH. These findings strongly suggest that white pigment cells in the mutant arise from melanophore precursors and accumulate reflecting platelets characteristic of iridophores

Polyhedral Analysis using Parametric Objectives

The abstract domain of polyhedra lies at the heart of many program analysis techniques. However, its operations can be expensive, precluding their application to polyhedra that involve many variables. This paper describes a new approach to computing polyhedral domain operations. The core of this approach is an algorithm to calculate variable elimination (projection) based on parametric linear programming. The algorithm enumerates only non-redundant inequalities of the projection space, hence permits anytime approximation of the output

LTL Parameter Synthesis of Parametric Timed Automata

The parameter synthesis problem for parametric timed automata is undecidable in general even for very simple reachability properties. In this paper we introduce restrictions on parameter valuations under which the parameter synthesis problem is decidable for LTL properties. The investigated bounded integer parameter synthesis problem could be solved using an explicit enumeration of all possible parameter valuations. We propose an alternative symbolic zone-based method for this problem which results in a faster computation. Our technique extends the ideas of the automata-based approach to LTL model checking of timed automata. To justify the usefulness of our approach, we provide experimental evaluation and compare our method with explicit enumeration technique.Comment: 23 pages, extended versio

LNCS

We present two algorithmic approaches for synthesizing linear hybrid automata from experimental data. Unlike previous approaches, our algorithms work without a template and generate an automaton with nondeterministic guards and invariants, and with an arbitrary number and topology of modes. They thus construct a succinct model from the data and provide formal guarantees. In particular, (1) the generated automaton can reproduce the data up to a specified tolerance and (2) the automaton is tight, given the first guarantee. Our first approach encodes the synthesis problem as a logical formula in the theory of linear arithmetic, which can then be solved by an SMT solver. This approach minimizes the number of modes in the resulting model but is only feasible for limited data sets. To address scalability, we propose a second approach that does not enforce to find a minimal model. The algorithm constructs an initial automaton and then iteratively extends the automaton based on processing new data. Therefore the algorithm is well-suited for online and synthesis-in-the-loop applications. The core of the algorithm is a membership query that checks whether, within the specified tolerance, a given data set can result from the execution of a given automaton. We solve this membership problem for linear hybrid automata by repeated reachability computations. We demonstrate the effectiveness of the algorithm on synthetic data sets and on cardiac-cell measurements