Georg Moser

Mach. Learn., October, 2024

Herbrand complexity and the epsilon calculus with equality.

[BibT_eX]

[DOI]

Kenji Miyamoto

Arch. Math. Log., February, 2024

Hopping Proofs of Expectation-Based Properties: Applications to Skiplists and Security Proofs.

[BibT_eX]

[DOI]

Proc. ACM Program. Lang., 2024

Rule by Rule: Learning with Confidence through Vocabulary Expansion.

[BibT_eX]

[DOI]

Albert Nössig

Tobias Hell

CoRR, 2024

Rule-Based, Neural and LLM Back-Translation: Comparative Insights from a Variant of Ladin.

[BibT_eX]

[DOI]

Samuel Frontull

CoRR, 2024

On Complexity of Confluence and Church-Rosser Proofs.

[BibT_eX]

[DOI]

Arnold Beckmann

Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

A Voting Approach for Explainable Classification with Rule Learning.

[BibT_eX]

[DOI]

Albert Nössig

Tobias Hell

Proceedings of the Artificial Intelligence Applications and Innovations, 2024

On the Hardness of Analyzing Quantum Programs Quantitatively.

[BibT_eX]

[DOI]

Proceedings of the Programming Languages and Systems, 2024

2023

Automated Expected Value Analysis of Recursive Programs.

[BibT_eX]

[DOI]

Proc. ACM Program. Lang., 2023

α-Avoidance.

[BibT_eX]

[DOI]

Samuel Frontull

Vincent van Oostrom

Proceedings of the 8th International Conference on Formal Structures for Computation and Deduction, 2023

2022

Type-based analysis of logarithmic amortised complexity.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., June, 2022

Quantum Expectation Transformers for Cost Analysis.

[BibT_eX]

[DOI]

Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

Automated Expected Amortised Cost Analysis of Probabilistic Data Structures.

[BibT_eX]

[DOI]

Lorenz Leutgeb

Florian Zuleger

Proceedings of the Computer Aided Verification - 34th International Conference, 2022

2021

Teaching Software Quality Assurance with Gamification and Continuous Feedback Techniques.

[BibT_eX]

[DOI]

Proceedings of the IEEE Global Engineering Education Conference, 2021

ATLAS: Automated Amortised Complexity Analysis of Self-adjusting Data Structures.

[BibT_eX]

[DOI]

Lorenz Leutgeb

Florian Zuleger

Proceedings of the Computer Aided Verification - 33rd International Conference, 2021

2020

Automated amortised resource analysis for term rewrite systems.

[BibT_eX]

[DOI]

Manuel Schneckenreither

Sci. Comput. Program., 2020

A modular cost analysis for probabilistic programs.

[BibT_eX]

[DOI]

Proc. ACM Program. Lang., 2020

Runtime Complexity Analysis of Logically Constrained Rewriting.

[BibT_eX]

[DOI]

Sarah Winkler

Proceedings of the Logic-Based Program Synthesis and Transformation, 2020

2019

Smarter Features, Simpler Learning?

[BibT_eX]

[DOI]

Sarah Winkler

Proceedings of the Second International Workshop on Automated Reasoning: Challenges, 2019

Modular Runtime Complexity Analysis of Probabilistic While Programs.

[BibT_eX]

[DOI]

CoRR, 2019

The Epsilon Calculus with Equality and Herbrand Complexity.

[BibT_eX]

[DOI]

Kenji Miyamoto

CoRR, 2019

2018

From Jinja bytecode to term rewriting: A complexity reflecting transformation.

[BibT_eX]

[DOI]

Inf. Comput., 2018

Analysis of Logarithmic Amortised Complexity.

[BibT_eX]

[DOI]

CoRR, 2018

MædMax: A Maximal Ordered Completion Tool.

[BibT_eX]

[DOI]

Sarah Winkler

Proceedings of the Automated Reasoning - 9th International Joint Conference, 2018

2017

KBOs, ordinals, subrecursive hierarchies and all that.

[BibT_eX]

[DOI]

J. Log. Comput., 2017

Uniform Resource Analysis by Rewriting: Strenghts and Weaknesses (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the 2nd International Conference on Formal Structures for Computation and Deduction, 2017

Quantified Boolean Formulas: Call the Plumber!

[BibT_eX]

[DOI]

Josef Lindsberger

Alexander Maringele

Proceedings of the LPAR-21, 2017

2016

A combination framework for complexity.

[BibT_eX]

[DOI]

Inf. Comput., 2016

Kruskal's Tree Theorem for Acyclic Term Graphs.

[BibT_eX]

[DOI]

Maria Anna Schett

Proceedings of the Proceedings 9th International Workshop on Computing with Terms and Graphs, 2016

TcT: Tyrolean Complexity Tool.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2016

Complexity of Acyclic Term Graph Rewriting.

[BibT_eX]

[DOI]

Proceedings of the 1st International Conference on Formal Structures for Computation and Deduction, 2016

The complexity of interaction.

[BibT_eX]

[DOI]

Stéphane Gimenez

Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2016

2015

A new order-theoretic characterisation of the polytime computable functions.

[BibT_eX]

[DOI]

Naohi Eguchi

Theor. Comput. Sci., 2015

The Complexity of Interaction (Long Version).

[BibT_eX]

[DOI]

Stéphane Gimenez

CoRR, 2015

Analysing the Complexity of Functional Programs: Higher-Order Meets First-Order (Long Version).

[BibT_eX]

[DOI]

Ugo Dal Lago

CoRR, 2015

Multivariate Amortised Resource Analysis for Term Rewrite Systems.

[BibT_eX]

[DOI]

Proceedings of the 13th International Conference on Typed Lambda Calculi and Applications, 2015

Leftmost Outermost Revisited.

[BibT_eX]

[DOI]

Aart Middeldorp

Proceedings of the 26th International Conference on Rewriting Techniques and Applications, 2015

Analysing the complexity of functional programs: higher-order meets first-order.

[BibT_eX]

[DOI]

Ugo Dal Lago

Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming, 2015

On the Computational Content of Termination Proofs.

[BibT_eX]

[DOI]

Thomas Powell

Proceedings of the Evolving Computability - 11th Conference on Computability in Europe, 2015

2014

Amortised Resource Analysis and Typed Polynomial Interpretations (extended version).

[BibT_eX]

[DOI]

CoRR, 2014

Automated Complexity Analysis Based on Context-Sensitive Rewriting.

[BibT_eX]

[DOI]

Proceedings of the Rewriting and Typed Lambda Calculi - Joint International Conference, 2014

Amortised Resource Analysis and Typed Polynomial Interpretations.

[BibT_eX]

[DOI]

Proceedings of the Rewriting and Typed Lambda Calculi - Joint International Conference, 2014

2013

Polynomial Path Orders.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2013

Tyrolean Complexity Tool: Features and Usage.

[BibT_eX]

[DOI]

Proceedings of the 24th International Conference on Rewriting Techniques and Applications, 2013

The Structure of Interaction.

[BibT_eX]

[DOI]

Stéphane Gimenez

Proceedings of the Computer Science Logic 2013 (CSL 2013), 2013

2012

Polynomial Path Orders: A Maximal Model

[BibT_eX]

[DOI]

CoRR, 2012

A Complexity Preserving Transformation from Jinja Bytecode to Rewrite Systems

[BibT_eX]

[DOI]

CoRR, 2012

2011

The Derivational Complexity Induced by the Dependency Pair Method

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2011

Termination Proofs in the Dependency Pair Framework May Induce Multiple Recursive Derivational Complexity.

[BibT_eX]

[DOI]

Proceedings of the 22nd International Conference on Rewriting Techniques and Applications, 2011

A Path Order for Rewrite Systems that Compute Exponential Time Functions.

[BibT_eX]

[DOI]

Naohi Eguchi

Proceedings of the 22nd International Conference on Rewriting Techniques and Applications, 2011

A Bi-Criteria Truthful Mechanism for Scheduling of Workflows in Clouds.

[BibT_eX]

[DOI]

Proceedings of the IEEE 3rd International Conference on Cloud Computing Technology and Science, 2011

Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Informatics - 4th International Conference, 2011

On Transfinite Knuth-Bendix Orders.

[BibT_eX]

[DOI]

Laura Kovács

Andrei Voronkov

Proceedings of the Automated Deduction - CADE-23 - 23rd International Conference on Automated Deduction, Wroclaw, Poland, July 31, 2011

2010

A Path Order for Rewrite Systems that Compute Exponential Time Functions (Technical Report)

[BibT_eX]

[DOI]

Naohi Eguchi

CoRR, 2010

Efficient Implementation of Rewriting Revisited Technical Report

[BibT_eX]

[DOI]

CoRR, 2010

Closing the Gap Between Runtime Complexity and Polytime Computability.

[BibT_eX]

[DOI]

Proceedings of the 21st International Conference on Rewriting Techniques and Applications, 2010

Characterising Space Complexity Classes via Knuth-Bendix Orders.

[BibT_eX]

[DOI]

Guillaume Bonfante

Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

Complexity Analysis by Graph Rewriting.

[BibT_eX]

[DOI]

Proceedings of the Functional and Logic Programming, 10th International Symposium, 2010

2009

Proof Theory at Work: Complexity Analysis of Term Rewrite Systems

[BibT_eX]

[DOI]

CoRR, 2009

The Hydra battle and Cichon's principle.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 2009

Dependency Pairs and Polynomial Path Orders.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 20th International Conference, 2009

2008

Proving Quadratic Derivational Complexities Using Context Dependent Interpretations.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 19th International Conference, 2008

Complexity, Graphs, and the Dependency Pair Method.

[BibT_eX]

[DOI]

Proceedings of the Logic for Programming, 2008

Complexity Analysis of Term Rewriting Based on Matrix and Context Dependent Interpretations.

[BibT_eX]

[DOI]

Johannes Waldmann

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2008

Complexity Analysis by Rewriting.

[BibT_eX]

[DOI]

Proceedings of the Functional and Logic Programming, 9th International Symposium, 2008

Automated Complexity Analysis Based on the Dependency Pair Method.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning, 4th International Joint Conference, 2008

Automated Implicit Computational Complexity Analysis (System Description).

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning, 4th International Joint Conference, 2008

2007

The Hydra Battle Revisited.

[BibT_eX]

[DOI]

Nachum Dershowitz

Proceedings of the Rewriting, 2007

2006

The Epsilon Calculus and Herbrand Complexity.

[BibT_eX]

[DOI]

Richard Zach

Stud Logica, 2006

Ackermann's substitution method (remixed).

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2006

Herbrand's theorem and term induction.

[BibT_eX]

[DOI]

Arch. Math. Log., 2006

Derivational Complexity of Knuth-Bendix Orders Revisited.

[BibT_eX]

[DOI]

Proceedings of the Logic for Programming, 2006

2005

Preface.

[BibT_eX]

[DOI]

Arnold Beckmann

Jeremy Avigad

Ann. Pure Appl. Log., 2005

Proofs of Termination of Rewrite Systems for Polytime Functions.

[BibT_eX]

[DOI]

Toshiyasu Arai

Proceedings of the FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 2005

2003

Relating Derivation Lengths with the Slow-Growing Hierarchy Directly.

[BibT_eX]

[DOI]

Andreas Weiermann

Proceedings of the Rewriting Techniques and Applications, 14th International Conference, 2003

The Epsilon Calculus (Tutorial).

[BibT_eX]

[DOI]

Richard Zach

Proceedings of the Computer Science Logic, 17th International Workshop, 2003

2002

Foreword.

[BibT_eX]

[DOI]

Georg Gottlob

Theor. Comput. Sci., 2002

On Generalizations of Semi-terms of Particularly Simple Form.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 16th International Workshop, 2002

2001

Tableaux for Reasoning About Atomic Updates.

[BibT_eX]

[DOI]

Christian G. Fermüller

Richard Zach

Proceedings of the Logic for Programming, 2001

On a Generalisation of Herbrand's Theorem.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 15th International Workshop, 2001

2000

Have Spass with OCC1N<sub>g</sub><sup>=</sup>.

[BibT_eX]

[DOI]

Christian G. Fermüller

Proceedings of the Logic for Programming and Automated Reasoning, 2000

1999

System Description: CutRes 0.1: Cut Elimination by Resolution.

[BibT_eX]

[DOI]

Alexander Leitsch