75 search results - page 2 / 15 » Certification of Automated Termination Proofs |
ICLP
2009
Springer
13 years 2 months ago
2009
Springer
CADE
2004
Springer
13 years 10 months ago
2004
Springer
The dependency pair approach is one of the most powerful techniques for automated (innermost) termination proofs of term rewrite systems (TRSs). For any TRS, it generates inequalit...
TPHOL
2007
IEEE
13 years 11 months ago
2007
IEEE
Terminator is a static analysis tool developed by Microsoft Research for proving termination of Windows device drivers written in C. This proof pearl describes a formalization in h...
RTA
2004
Springer
13 years 10 months ago
2004
Springer
We describe the system AProVE, an automated prover to verify (innermost) termination of term rewrite systems (TRSs). For this system, we have developed and implemented efficient al...
CADE
2001
Springer
14 years 5 months ago
2001
Springer
We propose the notion of rewriting modules in order to provide a structural and hierarchical approach of TRS. We define then relative dependency pairs built upon these modules whic...