Diferencia entre revisiones de «Proving termination with multiset orderings in PVS: theory, methodology and applications (PROTEMO)»
Línea 19: | Línea 19: | ||
|- | |- | ||
| '''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] |
|} | |} |
Revisión del 10:46 2 jun 2010
Title: | Proving termination with multiset orderings in PVS: theory, methodology and applications |
Authors: | José A. Alonso, María J. Hidalgo y 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:
|
Code: | You can find the PVS theories in ... |
Documentation: | Proving termination with multiset orderings in PVS: theory, methodology and applications |