Treffer: Proving the equivalence of CLP programs
Title:
Proving the equivalence of CLP programs
Authors:
Source:
Logic programming (Copenhagen, 29 July - 1 August 2002)Lecture notes in computer science. :287-301
Publisher Information:
Berlin: Springer, 2002.
Publication Year:
2002
Physical Description:
print, 15 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Induction, Inducción, Logique ordre 1, First order logic, Lógica orden 1, Programmation logique avec contrainte, Constraint logic programming, Programación lógica con restricción, Règle inférence, Inference rule, Regla inferencia, Théorie preuve, Proof theory, Teoría demonstración, Vérification programme, Program verification, Verificación programa, Coinduction, Système formel
Document Type:
Konferenz
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Inria Rocquencourt, Domaine de Voluceau - B.P. 105, 78153 Le Chesnay, France
ISSN:
0302-9743
Rights:
Copyright 2003 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.14840847
Database:
PASCAL Archive
Weitere Informationen
This paper presents two proof systems for the equivalence of programs. The language concerned is CLP to which the universal quantifier is added (CLPV). Both systems are based on first order classical logic. The first uses an induction rule and allows one to prove that the set of finite successes of a program is included in another program's corresponding set. The second uses a coinduction rule for proving the inclusion of the sets of infinite successes which contain the finite successes. Finally we show that the proof systems are equivalent under some natural conditions.