123 Hits in 5.0 sec

Synthesis and transformation of logic programs using unfold/fold proofs

Alberto Pettorossi, Maurizio Proietti
1999 The Journal of Logic Programming  
We present a method for proving properties of de®nite logic programs. This method is called unfold/fold proof method because it is based on the unfold/fold transformation rules.  ...  Given a program and two goals (that is, conjunctions of atoms) p Y and q Y , where , , and are pairwise disjoint vectors of variables, the unfold/fold proof method can be used to show that the equivalence  ...  We would like to thank all members of the community of the Logic Program Synthesis and Transformation (LoPSTr) Workshops and the referees who stimulated us with suggestions and comments.  ... 
doi:10.1016/s0743-1066(99)00029-1 fatcat:zg5rjcqe4bbczjlpsu5iiy2vyy

Unfold/fold transformations of CCP programs [chapter]

Sandro Etalle, Maurizio Gabbrielli, Maria Chiara Meo
1998 Lecture Notes in Computer Science  
Furthermore, since it preserves the deadlock behaviour of programs, it can be used for p roving deadlock freeness of a class of queries in a given program.  ...  We introduce a transformation system for concurrent constraint programming (CCP).  ...  Unfold/fold transformation techniques were rst introduced for functional programs in [2] , and then adapted to logic programming (LP) both for program synthesis [3, 10] , and for program specialization  ... 
doi:10.1007/bfb0055633 fatcat:2egakociorgvnalcktecyuu3de

Unfold/fold transformations for definite clause programs [chapter]

Manolis Gergatsoulis, Maria Katzouraki
1994 Lecture Notes in Computer Science  
An unfold/fold program transformation system which extends the unfold/fold transformations of H. Tamaki and T. Sato is presented in this paper.  ...  A proof of the correctness of the proposed transformations in the sense of the least Herbrand model semantics of the program is also presented. De nition2 (Logic Program).  ...  An unfold/fold program transformation system which extends the unfold/fold transformations of Tamaki and Sato TS84] is presented in this paper.  ... 
doi:10.1007/3-540-58402-1_24 fatcat:ueizhnrrlrerholteo7ipazr3u

Unfold/fold transformation of stratified programs

Hirohisa Seki
1991 Theoretical Computer Science  
., Unfold/fold transformation of stratified programs, Theoretical Computer Science 86 (1991) 107-139.  ...  This paper describes some extensions of Tamaki-Sato's (1984) unfold/fold transformation of definite programs.  ...  Tamaki and Sato proposed an elegant framework for unfold/fold transformation of logic programs [16] .  ... 
doi:10.1016/0304-3975(91)90007-o fatcat:noikwoqfq5ag7maa5k7y4h5o5q

Equivalence-preserving first-order unfold/fold transformation systems

Taisuke Sato
1992 Theoretical Computer Science  
Equivalence-preserving first-order unfold/fold transformation systems* Sate, T., Equivalence-preserving first-order unfold/fold transformation systems, Theoretical Computer Science 105 (1992) 57-84.  ...  Two unfoldjfold transformation systems for first-order programs, one basic and the other extended, are presented. The systems comprise an unfolding rule, a folding rule and a replacement rule.  ...  Section 2 gives a brief overview of related work on unfold/fold transformation of logic programs. In Section 3, we describe properties of three-valued logic.  ... 
doi:10.1016/0304-3975(92)90287-p fatcat:hr5pvhghpbfz3kmg762ay6nrsa

Preservation of stronger equivalence in unfold/fold logic program transformation

Tadashi Kawamura, Tadashi Kanamori
1990 Theoretical Computer Science  
The effectiveness of the unfold/fold rules in program transformation was first demonstrated in [ 11 for functional programs. anna and Waldinger [8] independently proposed a program synthesis method based  ...  This paper shruws th;at Tamnki-Sate's unfold/fold transformation of Prolog programs preserves equivalence in a stronger serxe than chat of the usual least Herbrand model semantics, which Tam&i and Sato  ...  used at the root of any proof tree of I?  ... 
doi:10.1016/0304-3975(90)90065-p fatcat:yicpvocp7zeifc2wa3dxtoonfy

On the correctness of unfold/fold transformation of normal and extended logic programs

Chandrabose Aravindan, Dung Phan Minh
1995 The Journal of Logic Programming  
We show that the framework for unfold/fold transformation of logic programs, first proposed by Tamaki and Sato and later extended by various researchers, preserves various nonmonotonic semantics of normal  ...  In fact, we observe that the unfold/fold transformation framework of normal programs can be applied to extended logic programs, without any modification.  ...  The first author would like to thank the Government of Japan for financially supporting his studies at the Asian Institute of Technology, Bangkok, Thailand.  ... 
doi:10.1016/0743-1066(94)00104-e fatcat:ywjtmdgrmjacvg4stl6v4i33qy

More on unfold/fold transformations of normal programs: Preservation of fitting's semantics [chapter]

Annalisa Bossi, Sandro Etalle
1994 Lecture Notes in Computer Science  
The unfold/fold transformation system defined by Tamaki and Sato was meant for definite programs.  ...  It transforms a program into an equivalent one in the sense of both the least tterbrand model semantics and the Computed Answer Substitution semantics.  ...  Soon later, Tamaki and Sato [26] proposed an elegant framework for the transformation of logic programs based on unfold/fold rules.  ... 
doi:10.1007/3-540-58792-6_20 fatcat:5w7s5ukyr5dypi2sk6zndx5ubu

Recursive Program Optimization Through Inductive Synthesis Proof Transformation

Peter Madden, Alan Bundy, Alan Smaill
1999 Journal of automated reasoning  
The research described in this paper involved developing transformation techniques which increase the efficiency of the noriginal program, the source, by transforming its synthesis proof into one, the  ...  We compare and contrast this approach with the more traditional approaches to program transformation, and highlight the benefits of proof transformation with regards to search, correctness, automatability  ...  In particular we compare our approach to the unfold/fold technique and the use of dependency graph analysis for tupling program transformations.  ... 
doi:10.1023/a:1005969312327 dblp:journals/jar/MaddenBS99 fatcat:bfa4t4khaje2donwrokh4u7yc4

A general technique for automatically optimizing programs through the use of proof plans [chapter]

Peter Madden, Ian Green
1995 Lecture Notes in Computer Science  
Such steps have typically required user-intervention in more traditional ("pure") transformational systems such as unfold/fold [BD77].  ...  In this paper we investigate how proof plans -formal patterns of reasoning for theorem proving -can be used for controlling the synthesis of efficient functional programs from standard sets of equational  ...  Benefits and Comparisons Using proof plans to synthesize efficient algorithms presents search and control advantages over the unfold/fold approach to transformation [BD77] .  ... 
doi:10.1007/3-540-60156-2_6 fatcat:2qc6rwkbknbzjfbidypieybqpm

Page 2911 of Mathematical Reviews Vol. , Issue 2000d [page]

2000 Mathematical Reviews  
(I-CNR-ASI; Rome) Synthesis and transformation of logic programs using unfold/fold proofs.  ...  This method is called the unfold/fold proof method because it is based on unfold/fold transformation rules.  ... 

Guest editors' introduction Special Issue: synthesis, transformation and analysis of logic programs 2

Annalisa Bossi, Yves Deville
1999 The Journal of Logic Programming  
This volume contains the second part of the Special Issue on Synthesis, Transformation and Analysis of Logic Programs. The ®rst part on program analysis appeared in Vol 39(1±3).  ...  The ®rst paper, Inductive synthesis of recursive logic programs: achievements and prospects, by Pierre Flener and Serap Yõlmaz overviews the achievements of inductive synthesis of logic programs from incomplete  ...  second paper of this volume Synthesis and transformation of logic programs using unfold/fold proofs by Alberto Pettorossi and Maurizio Proietti.  ... 
doi:10.1016/s0743-1066(99)00027-8 fatcat:tjzp4frx7beozeujr7ndjxa3iu

Foundations for natural proofs and quantifier instantiation

Christof Löding, P. Madhusudan, Lucas Peña
2017 Proceedings of the ACM on Programming Languages  
We give foundational results that explain the efficacy of heuristics used for dealing with quantified formulas and recursive definitions.  ...  explains the efficacy of verification engines like natural proofs that resort to such heuristics.  ...  We would also like to thank Mahesh Viswanathan and Xiaokang Qiu for early discussions on automatic discovery of induction principles for natural proofs.  ... 
doi:10.1145/3158098 dblp:journals/pacmpl/LodingMP18 fatcat:u5xnpsg2arbuxovuyvwmkdddoa

Page 1580 of Mathematical Reviews Vol. , Issue 92c [page]

1992 Mathematical Reviews  
This paper addresses the problem of unfold/fold transformations in logic programming.  ...  The effectiveness of a transformation sys- tem based on the unfold/fold rules for program optimization and/or synthesis has been demonstrated by many authors, starting from the pioneering work by Burstall  ... 

Symbolic Execution Proofs for Higher Order Store Programs

Bernhard Reus, Nathaniel Charlton, Ben Horsfall
2014 Journal of automated reasoning  
We give an operational semantics for programs and a step-indexed interpretation of assertions, and use these to show soundness of our reasoning rules, which include a deep frame rule which allows more  ...  Our automated reasoning algorithms include a scheme for separation logic based symbolic execution of programs, and automated provers for solving various kinds of entailment problems.  ...  This research has been sponsored by the Engineering and Physical Sciences Research Council, grant EP/G003173/1: "From Reasoning Principles for Function Pointers To Logics for Self-Configuring Programs"  ... 
doi:10.1007/s10817-014-9319-8 fatcat:rfdo6zach5hd7aljr2nupluqzu
« Previous Showing results 1 — 15 out of 123 results