Name
Abstract | ||
|---|---|---|
In contrast to popular belief, proving termination is not always impossible. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1145/1941487.1941509 | Commun. ACM |
Keywords | Field | DocType |
proving program termination,popular belief | Discrete mathematics,Entscheidungsproblem,Computer science,Operations research,Theoretical computer science,Input/output,Turing,Halting problem,Undecidable problem | Journal |
Volume | Issue | ISSN |
54 | 5 | 0001-0782 |
Citations | PageRank | References |
50 | 4.65 | 32 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Byron Cook | 1 | 50 | 4.65 |
| Andreas Podelski | 2 | 2760 | 197.87 |
| Andrey Rybalchenko | 3 | 1439 | 68.53 |