An Inductive Theorem on the Correctness of General Recursive Programs
We prove a relatively simple inductive theorem (analogous to Floyd and Dijkstra's Invariance Theorem for iterative programs) to verify the correctness of an ample class of non-deterministic general recursive programs. This result is based on Hoare and Jifeng's relational semantics. By cons...
- Autores:
-
Bohórquez, Jaime
- Tipo de recurso:
- Article of journal
- Fecha de publicación:
- 2007
- Institución:
- Escuela Colombiana de Ingeniería Julio Garavito
- Repositorio:
- Repositorio Institucional ECI
- Idioma:
- eng
- OAI Identifier:
- oai:repositorio.escuelaing.edu.co:001/1913
- Acceso en línea:
- https://repositorio.escuelaing.edu.co/handle/001/1913
- Palabra clave:
- Lenguajes de programación
Teoría de punto fijo
Ecuaciones de operadores no lineales
Programming Lenguages
Fixed point theory
Nonlinear operator equations
- Rights
- closedAccess
- License
- © The Author, 2007. Published by Oxford University Press. All rights reserved