A3PAT, an approach for certified automated termination proofs
PEPM, pp. 63-72, 2010.
terminationsoftware engineeringautomated reasoningtheoryformal proof
Software engineering, automated reasoning, rule-based programming or specifications often use rewriting systems for which termination, among other properties, may have to be ensured.This paper presents the approach developed in Project A3PAT to discover and moreover certify, with full automation, termination proofs for term rewriting syst...More
Full Text (Upload PDF)
PPT (Upload PPT)