Termination Competition (termCOMP 2015)

  • Jürgen Giesl
  • Frédéric Mesnard
  • Albert Rubio
  • René Thiemann
  • Johannes Waldmann
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9195)

Abstract

The termination competition focuses on automated termination analysis for all kinds of programming paradigms, including categories for term rewriting, imperative programming, logic programming, and functional programming. Moreover, the competition also features categories for automated complexity analysis. In all categories, the competition also welcomes the participation of tools providing certified proofs. The goal of the termination competition is to demonstrate the power of the leading tools in each of these areas.

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Jürgen Giesl
    • 1
  • Frédéric Mesnard
    • 2
  • Albert Rubio
    • 3
  • René Thiemann
    • 4
  • Johannes Waldmann
    • 5
  1. 1.RWTH Aachen UniversityAachenGermany
  2. 2.Université de la RéunionSaint DenisFrance
  3. 3.Universitat Politècnica de Catalunya - BarcelonaTechBarcelonaSpain
  4. 4.Universität InnsbruckInnsbruckAustria
  5. 5.HTWK LeipzigLeipzigGermany

Personalised recommendations