Difference between revisions of "Termination Competition 2014 Registration"
From Termination-Portal.org
Jump to navigationJump to searchJ.waldmann (talk | contribs) |
J.waldmann (talk | contribs) |
||
| Line 1: | Line 1: | ||
(this page to be edited by the competition organizer) | (this page to be edited by the competition organizer) | ||
| − | registrations, by category. last updated Thu | + | registrations, by category. last updated Thu Jun 12 12:22:31 CEST 2014 |
* Termination of Term Rewriting (and Transition Systems) | * Termination of Term Rewriting (and Transition Systems) | ||
Revision as of 10:22, 12 June 2014
(this page to be edited by the competition organizer)
registrations, by category. last updated Thu Jun 12 12:22:31 CEST 2014
- 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
