Name
Abstract | ||
|---|---|---|
When using rewrite techniques for termination analysis of programs, a main problem are pre-defined data types like integers. We extend term rewriting by built-in integers and adapt the dependency pair framework to prove termination of integer term rewriting automatically. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/978-3-642-02348-4_3 | RTA |
Field | DocType | Volume |
Integer,Logic program,Discrete mathematics,Programming language,Computer science,Algorithm,Termination analysis,Data type,Mathematical proof,Confluence,Rewriting,Dependency graph | Conference | 5595 |
ISSN | Citations | PageRank |
0302-9743 | 17 | 0.96 |
References | Authors | |
22 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Carsten Fuhs | 1 | 331 | 20.42 |
| Jürgen Giesl | 2 | 2048 | 124.90 |
| Martin Plücker | 3 | 78 | 3.34 |
| Peter Schneider-kamp | 4 | 985 | 58.56 |
| Stephan Falke | 5 | 511 | 27.86 |