A3PAT, an approach for certified automated termination proofs

PEPM, pp. 63-72, 2010.

Cited by: 35|Bibtex|Views2|Links
EI
Keywords:
terminationsoftware engineeringautomated reasoningtheoryformal proof

Abstract:

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

Code:

Data:

Your rating :
0

 

Tags
Comments