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

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

Polynomial Path Orders: A Maximal Model

This paper is concerned with the automated complexity analysis of term rewrite systems (TRSs for short) and the ramification of these in implicit computational complexity theory (ICC for short). We introduce a novel path order with multiset status, the polynomial path order POP*. Essentially relying on the principle of predicative recursion as proposed by Bellantoni and Cook, its distinct feature is the tight control of resources on compatible TRSs: The (innermost) runtime complexity of compatible TRSs is polynomially bounded. We have implemented the technique, as underpinned by our experimental evidence our approach to the automated runtime complexity analysis is not only feasible, but compared to existing methods incredibly fast. As an application in the context of ICC we provide an order-theoretic characterisation of the polytime computable functions. To be precise, the polytime computable functions are exactly the functions computable by an orthogonal constructor TRS compatible with POP*

Polynomial Path Orders

This paper is concerned with the complexity analysis of constructor term rewrite systems and its ramification in implicit computational complexity. We introduce a path order with multiset status, the polynomial path order POP*, that is applicable in two related, but distinct contexts. On the one hand POP* induces polynomial innermost runtime complexity and hence may serve as a syntactic, and fully automatable, method to analyse the innermost runtime complexity of term rewrite systems. On the other hand POP* provides an order-theoretic characterisation of the polytime computable functions: the polytime computable functions are exactly the functions computable by an orthogonal constructor TRS compatible with POP*.Comment: LMCS version. This article supersedes arXiv:1209.379

Compression of Rewriting Systems for Termination Analysis

We adapt the TreeRePair tree compression algorithm and use it as an intermediate step in proving termination of term rewriting systems. We introduce a cost function that approximates the size of constraint systems that specify compatibility of matrix interpretations. We show how to integrate the compression algorithm with the Dependency Pairs transformation. Experiments show that compression reduces running times of constraint solvers, and thus improves the power of automated termination provers

The Missouri Miner, October 13, 1983

https://scholarsmine.mst.edu/missouri_miner/3349/thumbnail.jp

Santa Clara Magazine, Volume 31 Number 3, Spring 1989

10 - VISION Santa Clara\u27s new president talks about his priorities for the University in the decade ahead. 15 - FAMILY IN CRISIS Is the Silicon Valley family an endangered species? 18 - DUBLIN: CITY OF 1,000 YEARS Today it is a bustling European capital. But progress has come at a price. 22 - GEORGE AND THE SILVER FOX A behind-the-scenes look at President and Mrs. Bush. 27 - WHO SHALL CARE .. . AND HOW? By 2020 every fourth American may be 65 or over.https://scholarcommons.scu.edu/sc_mag/1036/thumbnail.jp

Santa Clara Magazine, Volume 31 Number 3, Spring 1989

10 - VISION Santa Clara\u27s new president talks about his priorities for the University in the decade ahead. 15 - FAMILY IN CRISIS Is the Silicon Valley family an endangered species? 18 - DUBLIN: CITY OF 1,000 YEARS Today it is a bustling European capital. But progress has come at a price. 22 - GEORGE AND THE SILVER FOX A behind-the-scenes look at President and Mrs. Bush. 27 - WHO SHALL CARE .. . AND HOW? By 2020 every fourth American may be 65 or over.https://scholarcommons.scu.edu/sc_mag/1036/thumbnail.jp