Name
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. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/978-3-319-21401-6_6 | Lecture Notes in Artificial Intelligence |
Field | DocType | Volume |
Programming language,Functional programming,Programming paradigm,Computer science,Algorithm,Imperative programming,Termination analysis,Mathematical proof,Rewriting,Logic programming,Certification | Conference | 9195 |
ISSN | Citations | PageRank |
0302-9743 | 3 | 0.48 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jürgen Giesl | 1 | 2048 | 124.90 |
| Fred Mesnard | 2 | 203 | 12.21 |
| Albert Rubio | 3 | 149 | 9.38 |
| René Thiemann | 4 | 984 | 69.38 |
| Johannes Waldmann | 5 | 3 | 0.48 |