Diferencia entre revisiones de «Proving termination with multiset orderings in PVS: theory, methodology and applications (PROTEMO)»
| Línea 1: | Línea 1: | ||
| − | + | {| border="1" | |
| − | + | | '''Title:''' Proving termination with multiset orderings in PVS: theory, methodology and applications | |
| − | + | |- | |
| − | + | | '''Autores:''' {{jalonso}}, {{mjoseh}} y {{fmartin}}. | |
| + | |- | ||
| + | | '''Date:''' November 2009. | ||
| + | |- | ||
| + | | '''Resume:''' This theory present a methodology to organize and simplify non-trivial termination proofs of functions using well-founded multiset orderings. The theory consists of: | ||
** A formalization of the Dershowitz and Manna theorem. | ** A formalization of the Dershowitz and Manna theorem. | ||
** A methodology for proving termination properties. | ** A methodology for proving termination properties. | ||
Revisión del 10:36 2 jun 2010
| Title: Proving termination with multiset orderings in PVS: theory, methodology and applications |
| Autores: José A. Alonso, María J. Hidalgo y Francisco J. Martín. |
| Date: November 2009. |
Resume: This theory present a methodology to organize and simplify non-trivial termination proofs of functions using well-founded multiset orderings. The theory consists of:
|
