Termination Competition 2014 Registration

From Termination-Portal.org
Revision as of 11:05, 12 June 2014 by J.waldmann (talk | contribs)
Jump to navigationJump to search

Termination Competition 2014 Registration Information

Procedure

solver submissions:

  • make sure your solver is running on starexec
  • send to the organizer, in email, the solver-id and configuration-id for each category that you want to enter.
  • put this information about your solver in its info field on starexec:
    • name of solver, name and affiliation of (main) author(s), URL for more detail.

benchmark submission:

  • upload benchmarks on starexec (in some subspace of your space)
  • send to organizer, in email, the pathname of this subspace

Participants

registrations, by (meta-)categories. last updated Thu Jun 12 12:22:31 CEST 2014

(This list to be edited by the competition organizer only. Please send email in case of any errors or omissions.)

  • Termination of Term Rewriting (and Transition Systems)
    • TRS Standard: TTT2
    • SRS Standard: TTT2
    • TRS Relative: TTT2
    • SRS Relative: TTT2
    • TRS Standard certified: TTT2, matchbox
    • SRS Standard certified: TTT2, matchbox
    • TRS Relative certified: TTT2
    • SRS Relative certified: TTT2
    • integer transition systems: T2
  • Complexity Analysis of Term Rewriting
    • Derivational Complexity - Full Rewriting: TCT, CaT
    • Runtime Complexity – Full Rewriting: TCT, CaT
    • Runtime Complexity – Innermost Rewriting: TCT
    • Derivational Complexity - Full Rewriting certified: CaT
    • Runtime Complexity – Full Rewriting certified: CaT
  • Termination of Programming Languages
    • C: AProVE, T2
  • Verification of Termination of Term Rewriting
    • TRS Standard: CeTA, Rainbow
    • TRS Relative: CeTA
    • TRS Innermost: CeTA
    • TRS Outermost: CeTA
    • TRS Conditional: CeTA
    • TRS Context-Sensitive: CeTA
    • SRS Standard: CeTA
    • SRS Relative: CeTA
  • Verification of Complexity Analysis of Term Rewriting:
    • Derivational Complexity - Full Rewriting: CeTA
    • Runtime Complexity – Full Rewriting: CeTA

Note on Certified Categories

  • Participants of a certified category need to state which verifier they are targetting (it could be several).
  • Writers of verifiers need to state the syntax and semantics of the certificates that they are accepting (e.g., by publishing their verifier specification and/or implementation, with exact version information)