10,609 research outputs found

    Proving Termination of Graph Transformation Systems using Weighted Type Graphs over Semirings

    Full text link
    We introduce techniques for proving uniform termination of graph transformation systems, based on matrix interpretations for string rewriting. We generalize this technique by adapting it to graph rewriting instead of string rewriting and by generalizing to ordered semirings. In this way we obtain a framework which includes the tropical and arctic type graphs introduced in a previous paper and a new variant of arithmetic type graphs. These type graphs can be used to assign weights to graphs and to show that these weights decrease in every rewriting step in order to prove termination. We present an example involving counters and discuss the implementation in the tool Grez

    Thermal Tolerances of Interior Alaskan Arctic Grayling (Thymallus arcticus)

    Get PDF
    The work upon which this report is based was supported in part by funds (Project A-041-ALAS) provided by the United States Department of the Interior, Office of Water Resources Research, as authorized under the Water Resources Act of 1964, as amended

    CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verification of termination certificates

    Get PDF
    Termination is an important property of programs; notably required for programs formulated in proof assistants. It is a very active subject of research in the Turing-complete formalism of term rewriting systems, where many methods and tools have been developed over the years to address this problem. Ensuring reliability of those tools is therefore an important issue. In this paper we present a library formalizing important results of the theory of well-founded (rewrite) relations in the proof assistant Coq. We also present its application to the automated verification of termination certificates, as produced by termination tools

    Oscillatory subglacial drainage in the absence of surface melt

    Get PDF
    The presence of strong diurnal cycling in basal water pressure records obtained during the melt season is well established for many glaciers. The behaviour of the drainage system outside the melt season is less well understood. Here we present borehole observations from a surge-type valley glacier in the St Elias Mountains, Yukon Territory, Canada. Our data indicate the onset of strongly correlated multi-day oscillations in water pressure in multiple boreholes straddling a main drainage axis, starting several weeks after the disappearance of a dominant diurnal mode in August 2011 and persisting until at least January 2012, when multiple data loggers suffered power failure. Jökulhlaups provide a template for understanding spontaneous water pressure oscillations not driven by external supply variability. Using a subglacial drainage model, we show that water pressure oscillations can also be driven on a much smaller scale by the interaction between conduit growth and distributed water storage in smaller water pockets, basal crevasses and moulins, and that oscillations can be triggered when water supply drops below a critical value. We suggest this in combination with a steady background supply of water from ground water or englacial drainage as a possible explanation for the observed wintertime pressure oscillations

    12th International Workshop on Termination (WST 2012) : WST 2012, February 19–23, 2012, Obergurgl, Austria / ed. by Georg Moser

    Get PDF
    This volume contains the proceedings of the 12th International Workshop on Termination (WST 2012), to be held February 19–23, 2012 in Obergurgl, Austria. The goal of the Workshop on Termination is to be a venue for presentation and discussion of all topics in and around termination. In this way, the workshop tries to bridge the gaps between different communities interested and active in research in and around termination. The 12th International Workshop on Termination in Obergurgl continues the successful workshops held in St. Andrews (1993), La Bresse (1995), Ede (1997), Dagstuhl (1999), Utrecht (2001), Valencia (2003), Aachen (2004), Seattle (2006), Paris (2007), Leipzig (2009), and Edinburgh (2010). The 12th International Workshop on Termination did welcome contributions on all aspects of termination and complexity analysis. Contributions from the imperative, constraint, functional, and logic programming communities, and papers investigating applications of complexity or termination (for example in program transformation or theorem proving) were particularly welcome. We did receive 18 submissions which all were accepted. Each paper was assigned two reviewers. In addition to these 18 contributed talks, WST 2012, hosts three invited talks by Alexander Krauss, Martin Hofmann, and Fausto Spoto
    corecore