Difference between revisions of "Termination Competition 2014 Registration"

Revision as of 10:21, 12 June 2014

(this page to be edited by the competition organizer)

registrations, by category. last updated Thu June 12.

Verification of Complexity Analysis of Term Rewriting:
- Derivational Complexity - Full Rewriting: CeTA
- Runtime Complexity – Full Rewriting: CeTA

@@ Line 4: / Line 4: @@
 * Termination of Term Rewriting (and Transition Systems)
-**
+** TRS Standard: TTT2
-** integer transition systems
+** SRS Standard: TTT2
-*** T2
+** TRS Relative: TTT2
+** SRS Relative: TTT2
+** TRS Standard certified: TTT2
+** SRS Standard certified: TTT2
+** TRS Relative certified: TTT2
+** SRS Relative certified: TTT2
+** integer transition systems: T2
 * Complexity Analysis of Term Rewriting
-** Derivational Complexity - Full Rewriting
+** Derivational Complexity - Full Rewriting: TCT, CaT
-*** TCT
+** Runtime Complexity – Full Rewriting: TCT, CaT
-** Runtime Complexity – Full Rewriting
+** Runtime Complexity – Innermost Rewriting: TCT
-*** TCT
+** Derivational Complexity - Full Rewriting certified: CaT
-** Runtime Complexity – Innermost Rewriting
+** Runtime Complexity – Full Rewriting certified: CaT
-*** TCT
 * Termination of Programming Languages
-** C
+** C: AProVE, T2
-*** AProVE
-*** T2
 * Verification of Termination of Term Rewriting
-** Standard TRS
+** TRS Standard: CeTA, Rainbow
-*** CeTA
+** TRS Relative: CeTA
-*** Rainbow
+** 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