Journals

• Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, and Stephan Falke:
  Mechanizing and Improving Dependency Pairs
  Journal of Automated Reasoning 37(3), pages 155-203, 2006. ©Springer-Verlag
  [ Abstract | BibTeX | Preliminary Version (ps.gz) | Preliminary Version (pdf) | Paper on SpringerLink ]

Conferences

• Stephan Falke and Deepak Kapur:
  A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs
  In Proceedings of the 22nd International Conference on Automated Deduction (CADE '09), Montréal, Canada.
  Lecture Notes in Artificial Intelligence, 2009. To appear. ©Springer-Verlag
  [ Abstract | Paper (ps.gz) | Paper (pdf) ]
  
  
• Carsten Fuhs, Jürgen Giesl, Martin Plücker, Peter Schneider-Kamp, and Stephan Falke:
  Proving Termination of Integer Term Rewriting
  In Proceedings of the 20th International Conference on Rewriting Techniques and Applications (RTA '09), Brasília, Brazil.
  Lecture Notes in Computer Science, 2009. To appear. ©Springer-Verlag
  [ Abstract | BibTeX | Paper (ps.gz) | Paper (pdf) | Paper on SpringerLink ]
  
  
• Stephan Falke and Deepak Kapur:
  Dependency Pairs for Rewriting with Built-in Numbers and Semantic Data Structures
  In Proceedings of the 19th International Conference on Rewriting Techniques and Applications (RTA '08), Hagenberg, Austria.
  Lecture Notes in Computer Science 5117, pages 94-109, 2008. ©Springer-Verlag
  [ Abstract | BibTeX | Paper (ps.gz) | Paper (pdf) | Paper on SpringerLink ]
  
  
• Stephan Falke and Deepak Kapur:
  Dependency Pairs for Rewriting with Non-Free Constructors
  In Proceedings of the 21st International Conference on Automated Deduction (CADE '07), Bremen, Germany.
  Lecture Notes in Artificial Intelligence 4603, pages 426-442, 2007. ©Springer-Verlag
  [ Abstract | BibTeX | Paper (ps.gz) | Paper (pdf) | Paper on SpringerLink ]
  
  
• Stephan Falke and Deepak Kapur:
  Inductive Decidability using Implicit Induction
  In Proceedings of the 13th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR '06), Phnom Penh, Cambodia.
  Lecture Notes in Artificial Intelligence 4246, pages 45-59, 2006. ©Springer-Verlag
  [ Abstract | BibTeX | Paper (ps.gz) | Paper (pdf) | Paper on SpringerLink ]
  
  
• Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, and Stephan Falke:
  Automated Termination Proofs with AProVE
  In Proceedings of the 15th International Conference on Rewriting Techniques and Applications (RTA '04), Aachen, Germany.
  Lecture Notes in Computer Science 3091, pages 210-220, 2004. ©Springer-Verlag
  [ Abstract | BibTeX | Paper (ps.gz) | Paper (pdf) | Paper on SpringerLink ]
  
  
• Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, and Stephan Falke:
  Improving Dependency Pairs
  In Proceedings of the 10th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR '03), Almaty, Kazakhstan.
  Lecture Notes in Artificial Intelligence 2850, pages 167-182, 2003. ©Springer-Verlag
  [ Abstract | BibTeX | Paper (ps.gz) | Paper (pdf) | Paper on SpringerLink ]

Workshops

• Stephan Falke and Deepak Kapur:
  Termination of Context-Sensitive Rewriting with Built-In Numbers and Collection Data Structures
  In Proceedings of the 18th International Workshop on Functional and (Constraint) Logic Programming (WFLP '09), Brasília, Brazil.
  Workshop Proceedings, pages 111-125, 2009.
  [ Abstract | BibTeX | Paper (ps.gz) | Paper (pdf) ]
  
  
• Stephan Falke and Deepak Kapur:
  Operational Termination of Conditional Rewriting with Built-in Numbers and Semantic Data Structures
  In Proceedings of the 8th International Workshop on Reduction Strategies in Rewriting and Programming (WRS '08), Hagenberg, Austria.
  Electronic Notes in Theoretical Computer Science 237, pages 75-90, 2009. ©Elsevier
  [ Abstract | BibTeX | Preliminary Version (ps.gz) | Preliminary Version (pdf) | Paper on ScienceDirect ]
  
  
• Mahadevan Subramaniam, Deepak Kapur, and Stephan Falke:
  Predicting Failures of and Repairing Inductive Proof Attempts
  In Next Generation Design and Verification Methodologies for Distributed Embedded Control Systems (Proceedings of the GM R&D Workshop).
  Pages 177-192, 2007. ©Springer-Verlag
  [ Abstract | BibTeX | Preliminary Version (ps.gz) | Preliminary Version (pdf) | Paper on SpringerLink ]
  
  
• Mahadevan Subramaniam, Deepak Kapur, and Stephan Falke:
  Predicting Failures of Inductive Proof Attempts
  In Proceedings of the 3rd Workshop on Disproving: Non-Theorems, Non-Validity, Non-Provability (DISPROVING '06), Seattle, USA.
  Workshop Proceedings, pages 70-81, 2006.
  [ Abstract | BibTeX | Paper (ps.gz) | Paper (pdf) ]

Technical Reports

• Stephan Falke and Deepak Kapur:
  A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs
  Technical Report TR-CS-2009-02, Department of Computer Science, University Of New Mexico, Albuquerque, NM, USA, 2009.
  [ Abstract | BibTeX | Paper (ps.gz) | Paper (pdf) ]
  
  
• Stephan Falke and Deepak Kapur:
  Termination of Context-Sensitive Rewriting with Built-In Numbers and Collection Data Structures
  Technical Report TR-CS-2009-01, Department of Computer Science, University Of New Mexico, Albuquerque, NM, USA, 2009.
  [ Abstract | BibTeX | Paper (ps.gz) | Paper (pdf) | Erratum (ps.gz) | Erratum (pdf) ]
  
  
• Stephan Falke and Deepak Kapur:
  Proving Termination of Imperative Programs via Term Rewriting
  Technical Report TR-CS-2008-03, Department of Computer Science, University Of New Mexico, Albuquerque, NM, USA, 2008.
  [ Abstract | BibTeX | Paper (ps.gz) | Paper (pdf) ]
  
  
• Stephan Falke and Deepak Kapur:
  Operational Termination of Conditional Rewriting with Built-in Numbers and Semantic Data Structures
  Technical Report TR-CS-2007-22, Department of Computer Science, University Of New Mexico, Albuquerque, NM, USA, 2007.
  [ Abstract | BibTeX | Paper (ps.gz) | Paper (pdf) | Erratum (ps.gz) | Erratum (pdf) ]
  
  
• Stephan Falke and Deepak Kapur:
  Dependency Pairs for Rewriting with Built-in Numbers and Semantic Data Structures
  Technical Report TR-CS-2007-21, Department of Computer Science, University Of New Mexico, Albuquerque, NM, USA, 2007.
  [ Abstract | BibTeX | Paper (ps.gz) | Paper (pdf) | Erratum (ps.gz) | Erratum (pdf) ]
  
  
• Stephan Falke and Deepak Kapur:
  Dependency Pairs for Rewriting with Non-Free Constructors
  Technical Report TR-CS-2007-07, Department of Computer Science, University Of New Mexico, Albuquerque, NM, USA, 2007.
  [ Abstract | BibTeX | Paper (ps.gz) | Paper (pdf) ]
  
  
• Stephan Falke and Deepak Kapur:
  Implicit Induction Methods and Decision Procedures
  Technical Report TR-CS-2006-04, Department of Computer Science, University Of New Mexico, Albuquerque, NM, USA, 2006.
  [ Abstract | BibTeX | Paper (ps.gz) | Paper (pdf) ]
  
  
• Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, and Stephan Falke:
  Mechanizing Dependency Pairs
  Technical Report AIB-2003-08, Department of Computer Science, Rheinisch-Westfälische Technische Hochschule Aachen, Germany, 2003.
  [ Abstract | BibTeX | Paper (ps.gz) | Paper (pdf) ]
  
  
• Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, and Stephan Falke:
  Improving Dependency Pairs
  Technical Report AIB-2003-04, Department of Computer Science, Rheinisch-Westfälische Technische Hochschule Aachen, Germany, 2003.
  [ Abstract | BibTeX | Paper (ps.gz) | Paper (pdf) ]

Other Publications

• Stephan Falke:
  Automated Termination Analysis for Equational Rewriting
  Diplomarbeit, Department of Computer Science, Rheinisch-Westfälische Technische Hochschule Aachen, Germany, 2004.
  [ Abstract | BibTeX | Paper (ps.gz) | Paper (pdf) ]

• CS 401, Theoretical Foundations of Computer Science, Fall 2006

Stephan Falke

(since April 11, 2007) Last modified: June 22, 2009