Jürgen Giesl

Proceedings of the Automated Reasoning - 6th International Joint Conference, 2012

Exotic Semi-Ring Constraints.

[BibT_eX]

[DOI]

Proceedings of the 10th International Workshop on Satisfiability Modulo Theories, 2012

2011

Polytool: Polynomial interpretations as a basis for termination analysis of logic programs.

[BibT_eX]

[DOI]

Theory Pract. Log. Program., 2011

SAT-based termination analysis using monotonicity constraints over the integers.

[BibT_eX]

[DOI]

Theory Pract. Log. Program., 2011

Automated termination proofs for haskell by term rewriting.

[BibT_eX]

[DOI]

Matthias Raffelsieper

Stephan Swiderski

ACM Trans. Program. Lang. Syst., 2011

Preface: Special Issue of Selected Extended Papers of IJCAR 2010.

[BibT_eX]

[DOI]

Reiner Hähnle

J. Autom. Reason., 2011

Proving Termination by Dependency Pairs and Inductive Theorem Proving.

[BibT_eX]

[DOI]

J. Autom. Reason., 2011

Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting.

[BibT_eX]

[DOI]

Marc Brockschmidt

Carsten Otto

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

A Linear Operational Semantics for Termination and Complexity Analysis of ISO Prolog.

[BibT_eX]

[DOI]

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

Termination of Isabelle Functions via Termination of Rewriting.

[BibT_eX]

[DOI]

Proceedings of the Interactive Theorem Proving - Second International Conference, 2011

Automated Detection of Non-termination and NullPointerExceptions for Java Bytecode.

[BibT_eX]

[DOI]

Proceedings of the Formal Verification of Object-Oriented Software, 2011

A Dependency Pair Framework for Innermost Complexity Analysis of Term Rewrite Systems.

[BibT_eX]

[DOI]

Lars Noschinski

Fabian Emmes

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

2010

Automated termination analysis for logic programs with cut.

[BibT_eX]

[DOI]

Theory Pract. Log. Program., 2010

Current Trends in Automated Deduction.

[BibT_eX]

[DOI]

Künstliche Intell., 2010

Special Issue on Automated Deduction.

[BibT_eX]

[DOI]

Künstliche Intell., 2010

Loops under Strategies ... Continued

[BibT_eX]

[DOI]

Proceedings of the Proceedings International Workshop on Strategies in Rewriting, 2010

Automated Termination Analysis of Java Bytecode by Term Rewriting.

[BibT_eX]

[DOI]

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

Lazy Abstraction for Size-Change Termination.

[BibT_eX]

[DOI]

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

Dependency Triples for Improving Termination Analysis of Logic Programs with Cut.

[BibT_eX]

[DOI]

Thomas Ströder

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

Termination Graphs for Java Bytecode.

[BibT_eX]

[DOI]

Proceedings of the Verification, Induction, Termination Analysis, 2010

2009

Automated termination proofs for logic programs by term rewriting.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2009

Proving Termination of Integer Term Rewriting.

[BibT_eX]

[DOI]

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

The Dependency Triple Framework for Termination of Logic Programs.

[BibT_eX]

[DOI]

Manh Thang Nguyen

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

Inductive Theorem Proving meets Dependency Pairs.

[BibT_eX]

[DOI]

Proceedings of the Interaction versus Automation: The two Faces of Deduction, 04.10., 2009

Termination of Integer Term Rewriting.

[BibT_eX]

[DOI]

Proceedings of the Interaction versus Automation: The two Faces of Deduction, 04.10., 2009

09411 Executive Summary - Interaction versus Automation: The two Faces of Deductions.

[BibT_eX]

[DOI]

Proceedings of the Interaction versus Automation: The two Faces of Deduction, 04.10., 2009

09411 Abstracts Collection - Interaction versus Automation: The two Faces of Deduction.

[BibT_eX]

[DOI]

Proceedings of the Interaction versus Automation: The two Faces of Deduction, 04.10., 2009

Termination Analysis by Dependency Pairs and Inductive Theorem Proving.

[BibT_eX]

[DOI]

Proceedings of the Automated Deduction, 2009

2008

Adding constants to string rewriting.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 2008

Deciding Innermost Loops.

[BibT_eX]

[DOI]

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

Maximal Termination.

[BibT_eX]

[DOI]

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

Improving Context-Sensitive Dependency Pairs.

[BibT_eX]

[DOI]

Proceedings of the Logic for Programming, 2008

Search Techniques for Rational Polynomial Orders.

[BibT_eX]

[DOI]

Carsten Fuhs

Rafael Navarro-Marset

Proceedings of the Intelligent Computer Mathematics, 9th International Conference, 2008

2007

Deaccumulation techniques for improving provability.

[BibT_eX]

[DOI]

Armin Kühnemann

Janis Voigtländer

J. Log. Algebraic Methods Program., 2007

RTA 2005.

[BibT_eX]

[DOI]

Inf. Comput., 2007

Preface.

[BibT_eX]

[DOI]

Proceedings of the 7th International Workshop on Reduction Strategies in Rewriting and Programming, 2007

SAT Solving for Termination Analysis with Polynomial Interpretations.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing, 2007

Termination Analysis of Logic Programs Based on Dependency Graphs.

[BibT_eX]

[DOI]

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

Proving Termination Using Recursive Path Orders and SAT Solving.

[BibT_eX]

[DOI]

Proceedings of the Frontiers of Combining Systems, 6th International Symposium, 2007

Decision Procedures for Loop Detection.

[BibT_eX]

[DOI]

Proceedings of the Deduction and Decision Procedures, 30.09. - 05.10.2007, 2007

Implementing RPO and POLO using SAT.

[BibT_eX]

[DOI]

Proceedings of the Deduction and Decision Procedures, 30.09. - 05.10.2007, 2007

Termination of Programs using Term Rewriting and SAT Solving.

[BibT_eX]

[DOI]

Proceedings of the Deduction and Decision Procedures, 30.09. - 05.10.2007, 2007

07401 Abstracts Collection -- Deduction and Decision Procedures.

[BibT_eX]

[DOI]

Proceedings of the Deduction and Decision Procedures, 30.09. - 05.10.2007, 2007

07401 Executive Summary -- Deduction and Decision Procedures.

[BibT_eX]

[DOI]

Proceedings of the Deduction and Decision Procedures, 30.09. - 05.10.2007, 2007

Proving Termination by Bounded Increase.

[BibT_eX]

[DOI]

Proceedings of the Automated Deduction, 2007

2006

Mechanizing and Improving Dependency Pairs.

[BibT_eX]

[DOI]

J. Autom. Reason., 2006

Third Special Issue on Techniques for Automated Termination Proofs.

[BibT_eX]

[DOI]

J. Autom. Reason., 2006

Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages.

[BibT_eX]

[DOI]

Proceedings of the Term Rewriting and Applications, 17th International Conference, 2006

SAT Solving for Argument Filterings.

[BibT_eX]

[DOI]

Proceedings of the Logic for Programming, 2006

Automated Termination Analysis for Logic Programs by Term Rewriting.

[BibT_eX]

[DOI]

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

Automatic Termination Proofs in the Dependency Pair Framework.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning, Third International Joint Conference, 2006

2005

Preface.

[BibT_eX]

[DOI]

J. Autom. Reason., 2005

The size-change principle and dependency pairs for termination of term rewriting.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 2005

Proving and Disproving Termination of Higher-Order Functions.

[BibT_eX]

[DOI]

Proceedings of the Frontiers of Combining Systems, 5th International Workshop, 2005

Proving and Disproving Termination in the Dependency Pair Framework.

[BibT_eX]

[DOI]

Proceedings of the Deduction and Applications, 23.-28. October 2005, 2005

2004

Transformation techniques for context-sensitive rewrite systems.

[BibT_eX]

[DOI]

J. Funct. Program., 2004

Automated Termination Proofs with AProVE.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 15th International Conference, 2004

The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs.

[BibT_eX]

[DOI]

Proceedings of the Logic for Programming, 2004

Improved Modular Termination Proofs Using Dependency Pairs.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning - Second International Joint Conference, 2004

2003

Simulating liveness by reduction strategies.

[BibT_eX]

[DOI]

Hans Zantema

Proceedings of the 3rd International Workshop on Reduction Strategies in Rewriting and Programming, 2003

Size-Change Termination for Term Rewriting.

[BibT_eX]

[DOI]

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

Liveness in Rewriting.

[BibT_eX]

[DOI]

Hans Zantema

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

Improving Dependency Pairs.

[BibT_eX]

[DOI]

Proceedings of the Logic for Programming, 2003

Deciding Inductive Validity of Equations.

[BibT_eX]

[DOI]

Proceedings of the Automated Deduction - CADE-19, 19th International Conference on Automated Deduction Miami Beach, FL, USA, July 28, 2003

Deaccumulation - Improving Provability.

[BibT_eX]

[DOI]

Armin Kühnemann

Janis Voigtländer

Proceedings of the Advances in Computing Science, 2003

2002

Modular Termination Proofs for Rewriting Using Dependency Pairs.

[BibT_eX]

[DOI]

Enno Ohlebusch

J. Symb. Comput., 2002

Innermost Termination of Context-Sensitive Rewriting.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 6th International Conference, 2002

2001

Induction Proofs with Partial Functions.

[BibT_eX]

[DOI]

J. Autom. Reason., 2001

Special Issue "Termination".

[BibT_eX]

[DOI]

Pierre Lescanne

Appl. Algebra Eng. Commun. Comput., 2001

Verification of Erlang Processes by Dependency Pairs.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 2001

Dependency Pairs for Equational Rewriting.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 12th International Conference, 2001

Decidable Classes of Inductive Theorems.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning, First International Joint Conference, 2001

2000

Termination of term rewriting using dependency pairs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

Closure Induction in a Z-Like Language.

[BibT_eX]

[DOI]

David A. Duffy

Proceedings of the ZB 2000: Formal Specification and Development in Z and B, First International Conference of B and Z Users, York, UK, August 29, 2000

Equational Termination by Semantic Labelling.

[BibT_eX]

[DOI]

Hitoshi Ohsaki

Proceedings of the Computer Science Logic, 2000

Eliminating Dummy Elimination.

[BibT_eX]

[DOI]

Proceedings of the Automated Deduction, 2000

1999

Approximating the Domains of Functional and Imperative Programs.

[BibT_eX]

[DOI]

Jürgen Brauburger

Sci. Comput. Program., 1999

Transforming Context-Sensitive Rewrite Systems.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 10th International Conference, 1999

Context-Moving Transformations for Function Verification.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming Synthesis and Transformation, 1999

Applying Rewriting Techniques to the Verification of Erlang Processes.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 13th International Workshop, 1999

1998

Modularity of Termination Using Dependency pairs.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 9th International Conference, 1998

Pushing the Frontiers of Combining Rewrite Systems Farther Outwards.

[BibT_eX]

Enno Ohlebusch

Proceedings of the Frontiers of Combining Systems, Second International Workshop, 1998

Termination Analysis by Inductive Evaluation.

[BibT_eX]

[DOI]

Jürgen Brauburger

Proceedings of the Automated Deduction, 1998

1997

Termination of Nested and Mutually Recursive Algorithms.

[BibT_eX]

[DOI]

J. Autom. Reason., 1997

Automatically Proving Termination Where Simplification Orderings Fail.

[BibT_eX]

[DOI]

Proceedings of the TAPSOFT'97: Theory and Practice of Software Development, 1997

Proving Innermost Normalisation Automatically.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 8th International Conference, 1997

1996

Termination Analysis for Partial Functions.

[BibT_eX]

[DOI]

Jürgen Brauburger

Proceedings of the Static Analysis, Third International Symposium, 1996

Termination of Constructor Systems.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 7th International Conference, 1996

1995

Termination Analysis for Functional Programs using Term Orderings

[BibT_eX]

[DOI]

Proceedings of the Static Analysis, 1995

Generating Polynomial Orderings for Termination Proofs.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 6th International Conference, 1995

Automated Termination Proofs with Measure Functions.

[BibT_eX]

[DOI]

Proceedings of the KI-95: Advances in Artificial Intelligence, 1995

Automatisierung von Terminierungsbeweisen für rekursiv definierte Algorithmen.

[BibT_eX]

[DOI]

PhD thesis, 1995

1994

Strategies for Semantical Contractions.

[BibT_eX]

[DOI]

Ingrid Neumann

Proceedings of the KI-94: Advances in Artificial Intelligence, 1994

1993

The Semantics of Rational Contractions.

[BibT_eX]

[DOI]