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 considering the structure of its code and specification, we propose regularity conditions on the predicate transformer associated to the fixed-point equation of a general (non deterministic) recursive program to prove it correct by induction on a well founded ordering of a covering of the domain of its corresponding input-output relation. All fixed point solutions associated to a predicate transformer satisfying these regularity conditions coincide when restricted to the domain of its least fixed point solution. We find these conditions non unduly restrictive, since continuous operators defining deterministic programs as their corresponding least fixed-point solutions must fulfill them. We couch deterministic programs (viewed as least solutions of fixed-point equations) in a restriction of Hoare and Jifeng's P programming language of (partial) finitary relations into the greatest solutions of fixed-point equations expressed in terms of “total finitary” relations of an adequate restriction of their D language

• 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