Diferencia entre revisiones de «Refinements»

De WikiGLC
Saltar a: navegación, buscar
(New page: * '''Title:''' * '''Autores:''' {{jalonso}} y {{mjoseh}}. * '''Fecha de realización:''' * '''Abstract:''' * '''Code:''' You can find the PVS theories in ... * '''Documentation:''')
 
 
(No se muestran 2 ediciones intermedias del mismo usuario)
Línea 1: Línea 1:
* '''Title:'''  
+
{| border="1"
* '''Autores:''' {{jalonso}} y {{mjoseh}}.
+
| '''Title:'''  
* '''Fecha de realización:'''  
+
| Theory of refinements in PVS.
* '''Abstract:'''  
+
|-
* '''Code:''' You can find the PVS theories in ...
+
| '''Authors:'''  
* '''Documentation:'''
+
| {{jalonso}} and {{mjoseh}}.
 +
|-
 +
| '''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:'''
 +
| [http://www.cs.us.es/~jalonso/trabajos_dirigidos/2004-tesis-MJHD.pdf Teoría computacional (en PVS) de la programación lógica y del análisis formal de conceptos (Tesis, Universidad de Sevilla, 2004)].
 +
|}

Revisión actual del 11:34 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: Teoría computacional (en PVS) de la programación lógica y del análisis formal de conceptos (Tesis, Universidad de Sevilla, 2004).