5,422 research outputs found

    A Logical Product Approach to Zonotope Intersection

    Full text link
    We define and study a new abstract domain which is a fine-grained combination of zonotopes with polyhedric domains such as the interval, octagon, linear templates or polyhedron domain. While abstract transfer functions are still rather inexpensive and accurate even for interpreting non-linear computations, we are able to also interpret tests (i.e. intersections) efficiently. This fixes a known drawback of zonotopic methods, as used for reachability analysis for hybrid sys- tems as well as for invariant generation in abstract interpretation: intersection of zonotopes are not always zonotopes, and there is not even a best zonotopic over-approximation of the intersection. We describe some examples and an im- plementation of our method in the APRON library, and discuss some further in- teresting combinations of zonotopes with non-linear or non-convex domains such as quadratic templates and maxplus polyhedra

    Incrementally Closing Octagons

    Get PDF
    The octagon abstract domain is a widely used numeric abstract domain expressing relational information between variables whilst being both computationally efficient and simple to implement. Each element of the domain is a system of constraints where each constraint takes the restricted form ±xi±xj≤c. A key family of operations for the octagon domain are closure algorithms, which check satisfiability and provide a normal form for octagonal constraint systems. We present new quadratic incremental algorithms for closure, strong closure and integer closure and proofs of their correctness. We highlight the benefits and measure the performance of these new algorithms

    Bifurcation of hyperbolic planforms

    Get PDF
    Motivated by a model for the perception of textures by the visual cortex in primates, we analyse the bifurcation of periodic patterns for nonlinear equations describing the state of a system defined on the space of structure tensors, when these equations are further invariant with respect to the isometries of this space. We show that the problem reduces to a bifurcation problem in the hyperbolic plane D (Poincar\'e disc). We make use of the concept of periodic lattice in D to further reduce the problem to one on a compact Riemann surface D/T, where T is a cocompact, torsion-free Fuchsian group. The knowledge of the symmetry group of this surface allows to carry out the machinery of equivariant bifurcation theory. Solutions which generically bifurcate are called "H-planforms", by analogy with the "planforms" introduced for pattern formation in Euclidean space. This concept is applied to the case of an octagonal periodic pattern, where we are able to classify all possible H-planforms satisfying the hypotheses of the Equivariant Branching Lemma. These patterns are however not straightforward to compute, even numerically, and in the last section we describe a method for computation illustrated with a selection of images of octagonal H-planforms.Comment: 26 pages, 11 figure

    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)

    On the Rate of Quantum Ergodicity on hyperbolic Surfaces and Billiards

    Full text link
    The rate of quantum ergodicity is studied for three strongly chaotic (Anosov) systems. The quantal eigenfunctions on a compact Riemannian surface of genus g=2 and of two triangular billiards on a surface of constant negative curvature are investigated. One of the triangular billiards belongs to the class of arithmetic systems. There are no peculiarities observed in the arithmetic system concerning the rate of quantum ergodicity. This contrasts to the peculiar behaviour with respect to the statistical properties of the quantal levels. It is demonstrated that the rate of quantum ergodicity in the three considered systems fits well with the known upper and lower bounds. Furthermore, Sarnak's conjecture about quantum unique ergodicity for hyperbolic surfaces is confirmed numerically in these three systems.Comment: 19 pages, Latex, This file contains no figures. A postscript file with all figures is available at http://www.physik.uni-ulm.de/theo/qc/ (Delay is expected to 23.7.97 since our Web master is on vacation.

    The double torus as a 2D cosmos: groups, geometry and closed geodesics

    Full text link
    The double torus provides a relativistic model for a closed 2D cosmos with topology of genus 2 and constant negative curvature. Its unfolding into an octagon extends to an octagonal tessellation of its universal covering, the hyperbolic space H^2. The tessellation is analysed with tools from hyperbolic crystallography. Actions on H^2 of groups/subgroups are identified for SU(1, 1), for a hyperbolic Coxeter group acting also on SU(1, 1), and for the homotopy group \Phi_2 whose extension is normal in the Coxeter group. Closed geodesics arise from links on H^2 between octagon centres. The direction and length of the shortest closed geodesics is computed.Comment: Latex, 27 pages, 5 figures (late submission to arxiv.org
    • …
    corecore