Diferencia entre revisiones de «Proving termination with multiset orderings in PVS: theory, methodology and applications (PROTEMO)»

De WikiGLC
Saltar a: navegación, buscar
Línea 16: Línea 16:
 
|-
 
|-
 
| '''Code:'''  
 
| '''Code:'''  
| You can find the PVS theories in ...
+
| You can find the PVS theories [http://www.cs.us.es/~mjoseh/pub/PROTEMO.tgz here].
 
|-
 
|-
 
| '''Documentation:'''
 
| '''Documentation:'''
 
| [http://www.cs.us.es/~mjoseh/pub/Proving_termination_with_multiset_orderings_in_PVS.pdf Proving termination with multiset orderings in PVS: theory, methodology and applications]
 
| [http://www.cs.us.es/~mjoseh/pub/Proving_termination_with_multiset_orderings_in_PVS.pdf Proving termination with multiset orderings in PVS: theory, methodology and applications]
 
|}
 
|}

Revisión del 14:11 2 jun 2010

Title: Proving termination with multiset orderings in PVS: theory, methodology and applications
Authors: José A. Alonso, María J. Hidalgo and Francisco J. Martín.
Date: November 2009.
Description: This theory present a methodology to organize and simplify non-trivial termination proofs of functions using well-founded multiset orderings. The theory consists of:
  1. A formalization of the Dershowitz and Manna theorem.
  2. A methodology for proving termination properties.
  3. Three case studies: a tail-recursive definition of Ackermann's function, an iterative definition of McCarthy's 91 function and an iterative function to compute a generic schema for double recursion
Code: You can find the PVS theories here.
Documentation: Proving termination with multiset orderings in PVS: theory, methodology and applications