288 search results - page 4 / 58 » Interactive Termination Proofs Using Termination Cores |
LPAR
2005
Springer
15 years 2 months ago
2005
Springer
In this paper the Recursive Path Ordering is adapted for proving termination of rewriting incrementally. The new ordering, called Recursive Path Ordering with Modules, has as ingre...
CSL
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. We give the first mechanized proof of the fact that for showing termination of a term rewrite system, we may restrict to well-formed terms using just the function symbols...
MST
2008
14 years 9 months ago
2008
Abstract. Datatype-generic programs are programs that are parameterised by a datatype. We review the allegorical foundations of a methodology of designing datatype-generic programs...
121
click to vote
TACAS
2012
Springer
13 years 5 months ago
2012
Springer
Abstract. Automated verification of multi-threaded programs is difficult. Direct treatment of all possible thread interleavings by reasoning about the program globally is a prohib...
CAV
2012
Springer
12 years 12 months ago
2012
Springer
Abstract. In earlier work, we developed a technique to prove termination of Java programs automatically: first, Java programs are automatically transformed to term rewrite systems...