A Formal Framework for Synthesis and Verification of Logic Programs

Authors:
Alessandro Avellone;Mauro Ferrari;Camillo Fiorentini
Affiliations:
-;-;-
Venue:
LOPSTR '00 Selected Papers form the 10th International Workshop on Logic Based Program Synthesis and Transformation
Year:
2000

Citing 8
Cited 0

Foundations of logic programming; (2nd extended ed.)

Foundations of logic programming; (2nd extended ed.)
Negation in logic programming

Foundations of deductive databases and logic programming
The halting problem for deductive synthesis of logic programs

Proceedings of the eleventh international conference on Logic programming
Abstract parametric classes and abstract data types defined by classical and constructive logical methods

Journal of Symbolic Computation
Basic proof theory

Basic proof theory
On Specification Frameworks and Deductive Synthesis of Logic Programs

LOPSTR '94/META '94 Proceedings of the 4th International Workshops on Logic Programming Synthesis and Transformation - Meta-Programming in Logic
Regular Search Spaces as a Foundation of Logic Programming

ELP '93 Proceedings of the 4th International Workshop on Extensions of Logic Programming
Extracting information from intermediate semiconstructive HA-systems – extended abstract

Mathematical Structures in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a formal framework, based on the notion of extraction calculus, which has been applied to define procedures for extracting information from constructive proofs. Here we apply such a mechanism to give a proof-theoretic account of SLD-derivations. We show how proofs of suitable constructive systems can be used in the context of deductive synthesis of logic programs, and we state a link between constructive and deductive program synthesis.