Frontiers of Combining Systems

We describe a line of work that started in 2011 towards enriching Isabelle/HOL’s language with coinductive datatypes, which allow infinite values, and with a more expressive notion of inductive datatype than previously supported by any system based on higher-order logic. These (co)datatypes are complemented by definitional principles for (co)recursive functions and reasoning principles for (co)induction. In contrast with other systems offering codatatypes, no additional axioms or logic extensions are necessary with our approach.

[1]  Thomas A. Henzinger,et al.  ABC: Algebraic Bound Computation for Loops , 2010, LPAR.

[2]  Martin Hofmann,et al.  Multivariate amortized resource analysis , 2011, POPL '11.

[3]  Paliath Narendran,et al.  On sufficient-completeness and related properties of term rewriting systems , 1987, Acta Informatica.

[4]  Sumit Gulwani,et al.  SPEED: Symbolic Complexity Bound Analysis , 2009, CAV.

[5]  Dieter Hofbauer,et al.  Termination Proofs and the Length of Derivations (Preliminary Version) , 1989, RTA.

[6]  Georg Moser,et al.  TcT: Tyrolean Complexity Tool , 2016, TACAS.

[7]  Antonio Flores-Montoya,et al.  Upper and Lower Amortized Cost Bounds of Programs Expressed as Cost Relations , 2016, FM.

[8]  Jürgen Giesl,et al.  Analyzing Runtime and Size Complexity of Integer Programs , 2016, ACM Trans. Program. Lang. Syst..

[9]  Paul Feautrier,et al.  Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs , 2010, SAS.

[10]  Jürgen Giesl,et al.  Analyzing Program Termination and Complexity Automatically with AProVE , 2016, Journal of Automated Reasoning.

[11]  Saumya K. Debray,et al.  Cost analysis of logic programs , 1993, TOPL.

[12]  Reiner Hähnle,et al.  Resource Analysis of Complex Programs with Cost Equations , 2014, APLAS.

[13]  Ben Wegbreit,et al.  Mechanical program analysis , 1975, CACM.

[14]  Guillaume Bonfante,et al.  Algorithms with polynomial interpretation termination proof , 2001, Journal of Functional Programming.

[15]  Jürgen Giesl,et al.  Lower Bounds for Runtime Complexity of Term Rewriting , 2017, Journal of Automated Reasoning.

[16]  Martin Hofmann,et al.  Multivariate Amortised Resource Analysis for Term Rewrite Systems , 2015, TLCA.

[17]  Jan Hoffmann,et al.  Types with potential: polynomial resource bounds via automatic amortized analysis , 2011 .

[18]  Harald Zankl,et al.  Modular Complexity Analysis for Term Rewriting , 2014, Log. Methods Comput. Sci..

[19]  Jürgen Giesl,et al.  Analyzing Innermost Runtime Complexity of Term Rewriting by Dependency Pairs , 2013, Journal of Automated Reasoning.

[20]  Elvira Albert,et al.  Cost analysis of object-oriented bytecode programs , 2012, Theor. Comput. Sci..

[21]  Emmanuel Kounalis,et al.  Completeness in Data Type Specifications , 1985, European Conference on Computer Algebra.

[22]  Raúl Gutiérrez,et al.  A Transformational Approach to Resource Analysis with Typed-norms Inference , 2019, Theory and Practice of Logic Programming.

[23]  Manuel V. Hermenegildo,et al.  Resource Usage Analysis of Logic Programs via Abstract Interpretation Using Sized Types* , 2014, Theory and Practice of Logic Programming.

[24]  Georg Moser,et al.  A combination framework for complexity , 2013, Inf. Comput..

[25]  Jürgen Giesl,et al.  Proving Termination by Dependency Pairs and Inductive Theorem Proving , 2011, Journal of Automated Reasoning.

[26]  Zhong Shao,et al.  Compositional certified resource bounds , 2015, PLDI.

[27]  Helmut Veith,et al.  Complexity and Resource Bound Analysis of Imperative Programs Using Difference Constraints , 2017, Journal of Automated Reasoning.

[28]  Georg Moser,et al.  Automated Complexity Analysis Based on the Dependency Pair Method , 2008, IJCAR.

[29]  Tobias Nipkow,et al.  Term rewriting and all that , 1998 .

[30]  Elvira Albert,et al.  Closed-Form Upper Bounds in Static Cost Analysis , 2011, Journal of Automated Reasoning.

[31]  Ankush Das,et al.  Towards automatic resource bound analysis for OCaml , 2016, POPL.

[32]  Ugo Dal Lago,et al.  On quasi-interpretations, blind abstractions and implicit complexity , 2012, Math. Struct. Comput. Sci..

[33]  Jürgen Giesl,et al.  Analyzing Runtime Complexity via Innermost Runtime Complexity , 2017, LPAR.

[34]  Jürgen Giesl,et al.  Lower Runtime Bounds for Integer Programs , 2016, IJCAR.