Proving the Equivalence of CLP Programs

Authors:
Sorin Craciunescu
Affiliations:
-
Venue:
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
Year:
2002

Citing 6
Cited 2

Constraint logic programming

POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Concurrent constraint programming

POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proving concurrent constraint programs correct

ACM Transactions on Programming Languages and Systems (TOPLAS)
Cut-elimination for a logic with definitions and induction

Theoretical Computer Science - Special issue on proof-search in type-theoretic languages
Linear concurrent constraint programming: operational and phase semantics

Information and Computation
Computer-Aided Reasoning: An Approach

Computer-Aided Reasoning: An Approach

A Coinduction Rule for Entailment of Recursively Defined Properties

CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Inference rules for proving the equivalence of recursive procedures

Time for verification

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents two proof systems for the equivalence of programs. The language concerned is CLP to which the universal quantifier isa dded (CLP驴). 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.