ComplexityParser: An Automatic Tool for Certifying Poly-Time Complexity of Java Programs

[1]  Daniel Leivant,et al.  Ramified Recurrence and Computational Complexity II: Substitution and Poly-Space , 1994, CSL.

[2]  Elvira Albert,et al.  Cost Analysis of Java Bytecode , 2007, ESOP.

[3]  Georg Moser,et al.  From Jinja bytecode to term rewriting: A complexity reflecting transformation , 2018, Inf. Comput..

[4]  Martin Hofmann,et al.  Resource Aware ML , 2012, CAV.

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

[6]  Romain Péchoux,et al.  A Type-Based Complexity Analysis of Object Oriented Programs , 2018, Inf. Comput..

[7]  Jürgen Giesl,et al.  Complexity Analysis for Java with AProVE , 2017, IFM.

[8]  Petr Hájek,et al.  Arithmetical Hierarchy and Complexity of Computation , 1979, Theor. Comput. Sci..

[9]  Jean-Yves Marion,et al.  Type-Based Complexity Analysis for Fork Processes , 2013, FoSSaCS.

[10]  Stephen A. Cook,et al.  A new recursion-theoretic characterization of the polytime functions , 1992, STOC '92.

[11]  Romain Péchoux,et al.  Objects in Polynomial Time , 2015, APLAS.

[12]  Andreas Podelski,et al.  Transition predicate abstraction and fair termination , 2007, TOPL.

[13]  Martin Hofmann,et al.  Efficient Type-Checking for Amortised Heap-Space Analysis , 2009, CSL.

[14]  Daniel Leivant,et al.  Evolving Graph-Structures and Their Implicit Computational Complexity , 2013, ICALP.

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

[16]  Daniel Leivant,et al.  Lambda Calculus Characterizations of Poly-Time , 1993, Fundam. Informaticae.

[17]  Jean-Yves Marion,et al.  Two function algebras defining functions in NCk boolean circuits , 2016, Inf. Comput..

[18]  Étienne Payet,et al.  A termination analyzer for Java bytecode based on path-length , 2010, TOPL.

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

[20]  Jean-Yves Marion,et al.  Complexity Information Flow in a Multi-threaded Imperative Language , 2014, TAMC.

[21]  Martin Hofmann,et al.  Automatic Type Inference for Amortised Heap-Space Analysis , 2013, ESOP.

[22]  M. Sharir,et al.  A strong-connectivity algorithm and its applications in data flow analysis. , 2018 .