A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Filters
Fold/Unfold Transformations for Fixpoint Logic
[chapter]
2020
Lecture Notes in Computer Science
Preserved Fulltext
We formalize fold/unfold transformations for fixpoint logic formulas and show how they can be used to enhance a recent fixpoint-logic approach to automated program verification, including automated verification ...
Fixpoint logics have recently been drawing attention as common foundations for automated program verification. ...
We would like to thank anonymous referees for useful comments, especially for bringing the work on PBES to our attention. ...
doi:10.1007/978-3-030-45237-7_12
fatcat:c3islramjnagvfc5rgjby4p56i
Page 6927 of Mathematical Reviews Vol. , Issue 93m
[page]
1993
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Compared to traditional program transformation methods, such as the fold/unfold method, our method has the following no- table features. ...
Secondly, the transformation proceeds very efficiently. The transformed proof is immediately obtained by our method, whereas in the fold/unfold method the transformation proceeds step by step.” ...
Page 3618 of Mathematical Reviews Vol. , Issue 95f
[page]
1995
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
“Once these three functions are supplied, our abstract strategy becomes a concrete one which can be used during program de- velopment for driving the application of the definition, folding, unfolding, ...
{For the entire collection see MR 95b:68014.}
95f:68041 68N17 03B70
Proietti, Maurizio (I-IASI; Rome);
Pettorossi, Alberto (I-ROME2-EE; Rome)
An abstract strategy for transforming logic programs. ...
Editorial
1992
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In particular, it may be,any first-order theory and this generality is expected to expand the field of fold/unfold transformations. ...
In "Unfolding and fixpoint semantics of concurrent constraint logic programs", M. Gabbrielli and G. Levi propose a semantics for a family of concurrent constraint logic languages. ...
doi:10.1016/0304-3975(92)90283-l
fatcat:nb6jl2blyrfg3pkdq6yrch5wwi
Page 5963 of Mathematical Reviews Vol. , Issue 94j
[page]
1994
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Sato’s fold/unfold transformation rules for general logic pro-
68P Theory of data
94j:-68042
grams [in Proceedings of the Second International Logic Program- ming Conference (Uppsala, 1984), 127-138; per ...
A reformulation of the partial deduction procedure in terms of the fold/unfold transformation is given that permits the incorpo- ration into the partial deduction not only of folding and unfolding but ...
Transforming constraint logic programs
1998
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We give an operational and fixpoint semantics of our constraint logic programs; we extend the Tamaki-Sato transformation system into a transformation system for constraint programs including fold-unfold ...
Assume that PO = P, PI,. . . , PN = P' is a sequence of Tamaki-Sato fold-unfold transformations, then M(P+l ) = M(Pi) = -. . = M(Po). Theorem 4.3 then immediately follows. ...
the fold-unfold transformation. ...
doi:10.1016/s0304-3975(97)00077-7
fatcat:54uhym5s2rexba3t4nmzlasizi
PAM: A process algebra manipulator
[chapter]
1992
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The logic that PAM implements is equational logic plus recursion, with some features tailored to the particular requirements of process algebras. ...
PAM is a general proof tool for process algebras. It allows users to define their own calculi and then perform algebraic style proofs in these calculi by directly manipulating process terms. ...
Bainbridge for discussions on the proof system, to Astrid Kiehn and Anna Ing61fsd6ttir for their helps during the implementation of PAM. ...
doi:10.1007/3-540-55179-4_14
fatcat:wsav5mizsjckxbe3cpcusui3ba
Page 1790 of Mathematical Reviews Vol. , Issue 96c
[page]
1996
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Summary: “We extend the Tamaki-Sato transformation system for logic programs into a transformation system for constraint logic programs including fold, unfold, replacement, thinning and fattening, and ...
A fixpoint algorithm to compute the abstract semantics is then presented. ...
Logic programs as specifications in the inductive verification of logic programs
2001
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Then we show how the resulting conditions can be proved using program transformation techniques. ...
In this paper we define a new verification method based on an assertion language able to express properties defined by the user through a logic program. ...
Some examples of transformation rules are fold/unfold transformation rules. In our case we prove assertions on the user defined predicates by means of transformations on the user program. ...
doi:10.1016/s1571-0661(04)00153-7
fatcat:rdsdamodtjefnnjy52c7rl5xoy
Page 4563 of Mathematical Reviews Vol. , Issue 98G
[page]
1998
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
In this paper some strategies based on folding, unfolding and generation of schemata are presented.”
98g:68019 68N17 68Q55 68Q60
Barbuti, R. (1-PISA-IF; Pisa); De Francesco, N. (1-PISA-IE; Pisa); Santone ...
For this reason the second part of the presentation is the stage of transformation. ...
Foreword
1998
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Old ideas which seemed to have fallen asleep, like static analysis of programs and program transformations via folding-unfolding now are revived and booming. ...
As an example, perhaps I can mention "fixpoints", which underly most of the work on formal semantics, the design of programs and the methods of verifying that they do indeed what they were designed for ...
doi:10.1016/s0304-3975(98)80006-6
fatcat:vzy6b6wivnbwdge6k3fpoqlqni
Analysis and Transformation of Constrained Horn Clauses for Program Verification
2021
Theory and Practice of Logic Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
We also give an overview of some transformation techniques based on specialization and fold/unfold rules, which are useful for improving the effectiveness of CHC satisfiability tools. ...
This paper surveys recent work on applying analysis and transformation techniques that originate in the field of constraint logic programming (CLP) to the problem of verifying software systems. ...
Acknowledgments We would like to thank Isabel García-Contreras, Bishoksan Kafle, and José Francisco Morales for discussions. ...
doi:10.1017/s1471068421000211
fatcat:zfzmqjuozzd5dlfgog7kfmxhce
Analysis and Transformation of Constrained Horn Clauses for Program Verification
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
We also give an overview of some transformation techniques based on specialisation and fold/unfold rules, which are useful for improving the effectiveness of CHC satisfiability tools. ...
This paper surveys recent work on applying analysis and transformation techniques that originate in the field of constraint logic programming (CLP) to the problem of verifying software systems. ...
Acknowledgments We would like to thank Isabel García-Contreras, Bishoksan Kafle, and José Francisco Morales for discussions. ...
arXiv:2108.00739v1
fatcat:gevl2xlor5hrzentqc77irt6gu
Foundations for natural proofs and quantifier instantiation
2017
Proceedings of the ACM on Programming Languages
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We develop a framework for first order logic (FOL) over an uninterpreted combination of background theories. ...
Furthermore, we study recursive definitions with least fixpoint semantics and show that though they are not amenable to complete procedures, we can systematically introduce induction principles that in ...
ACKNOWLEDGEMENTS We would like to thank Rupak Majumdar for discussions on complete logics for program verification. ...
doi:10.1145/3158098
dblp:journals/pacmpl/LodingMP18
fatcat:u5xnpsg2arbuxovuyvwmkdddoa
Pushing constraint selections
1993
The Journal of Logic Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Our procedure can be combined with the Magic Templates transformation to propagate query binding information in addition to the constraint information. ...
The C transformation is expressed as a sequence of fold, unfold, and definition steps using the fold/unfold transformations of Tamaki and Sato [14] . ...
The fold/unfold transformations work on the SCC structure of P. ...
doi:10.1016/0743-1066(93)90048-l
fatcat:tlua2vpnuncftcr5wvcwywroei
« Previous
Showing results 1 — 15 out of 90 results