Diferencia entre revisiones de «Refinements»
| Línea 1: | Línea 1: | ||
{| border="1" | {| border="1" | ||
| '''Title:''' | | '''Title:''' | ||
| − | | | + | | Theory of refinements in PVS. |
|- | |- | ||
| '''Authors:''' | | '''Authors:''' | ||
| − | | {{jalonso}} | + | | {{jalonso}} and {{mjoseh}}. |
|- | |- | ||
| '''Date:''' | | '''Date:''' | ||
| − | | | + | | 2002. |
|- | |- | ||
| '''Description:''' | | '''Description:''' | ||
| − | | | + | | Based on the notion of refinement used for Dold and Jones we have built a PVS theory establishing the general notions of refinements and its main properties. As a case study, we have established a refinement of the theory of finite sets by the theory of lists. |
|- | |- | ||
| '''Code:''' | | '''Code:''' | ||
Revisión del 11:33 2 jun 2010
| Title: | Theory of refinements in PVS. |
| Authors: | José A. Alonso and María J. Hidalgo. |
| Date: | 2002. |
| Description: | Based on the notion of refinement used for Dold and Jones we have built a PVS theory establishing the general notions of refinements and its main properties. As a case study, we have established a refinement of the theory of finite sets by the theory of lists. |
| Code: | You can find the PVS theories in ... |
| Documentation: | Proving termination with multiset orderings in PVS: theory, methodology and applications |
