Diferencia entre revisiones de «Proving termination with multiset orderings in PVS: theory, methodology and applications (PROTEMO)»
Línea 17: | Línea 17: | ||
| '''Code:''' | | '''Code:''' | ||
| You can find the PVS theories: | | You can find the PVS theories: | ||
− | * [http://www.cs.us.es/~mjoseh/pub/PROTEMO.tgz Version in PVS-3.2 ] | + | * [http://www.cs.us.es/~mjoseh/pub/PROTEMO.tgz Version in PVS-3.2] |
− | * | + | * [http://www.cs.us.es/~mjoseh/pub/PROTEMO_4.2 Version in PVS-4.2]. |
|- | |- | ||
| '''Documentation:''' | | '''Documentation:''' |
Revisión del 11:57 7 oct 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 presents 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: |
Documentation: | Papers and documents related with this work: |