The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase unfold/fold (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1984-1992 (16) 1993-1997 (18) 1998-2002 (16) 2004-2010 (15) 2011-2024 (4)
Publication types (Num. hits)
article(16) incollection(1) inproceedings(52)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 21 occurrences of 17 keywords

Results
Found 69 publication records. Showing 69 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
139Jirí Vyskocil, Petr Stepánek Improving Efficiency of Prolog Programs by Fully Automated Unfold/Fold Transformation. Search on Bibsonomy MICAI The full citation details ... 2007 DBLP  DOI  BibTeX  RDF unfold/fold transformation, homeomorphic embedding, logic programming, prolog, partial deduction
122David Sands Total Correctness by Local Improvement in the Transformation of Functional Programs. Search on Bibsonomy ACM Trans. Program. Lang. Syst. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF operational equivalence, unfold-fold, program transformation, correctness, improvement
113Abhik Roychoudhury, K. Narayan Kumar, C. R. Ramakrishnan 0001, I. V. Ramakrishnan An unfold/fold transformation framework for definite logic programs. Search on Bibsonomy ACM Trans. Program. Lang. Syst. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF inductive theorem proving, Logic programming, program transformation, unfolding, folding
94Nicoletta De Francesco, Antonella Santone Unfold/Fold Transformations of Concurrent Processes. Search on Bibsonomy PLILP The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
81Abhik Roychoudhury, K. Narayan Kumar, C. R. Ramakrishnan 0001, I. V. Ramakrishnan Beyond Tamaki-Sato Style Unfold/Fold Transformations for Normal Logic Programs. Search on Bibsonomy ASIAN The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
77David Sands 0001 Total Correctness by Local Improvement in Program Transformation. (long version: ACM Trans. Program. Lang. Syst. 18(2): 175-234(1996)) Search on Bibsonomy POPL The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
75Manolis Gergatsoulis, Maria Katzouraki Unfold/Fold Transformations For Definite Clause Programs. Search on Bibsonomy PLILP The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
75Saumya K. Debray Unfold/Fold Transformations and Loop Optimization of Logic Programs. Search on Bibsonomy PLDI The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
57Nicoletta De Francesco, Antonella Santone A Transformation System for Concurrent Processes. Search on Bibsonomy Acta Informatica The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
57Sandro Etalle, Maurizio Gabbrielli, Elena Marchiori A Transformation System for CLP with Dynamic Scheduling and CCP. Search on Bibsonomy PEPM The full citation details ... 1997 DBLP  DOI  BibTeX  RDF concurrent constraint logic programming, transformation, deadlock, coroutining
55Alberto Pettorossi, Maurizio Proietti Perfect Model Checking via Unfold/Fold Transformations. Search on Bibsonomy Computational Logic The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
55Torben Amtoft Unfold/fold Transformations Preserving Termination Properties. Search on Bibsonomy PLILP The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
55Taisuke Sato An Equivalence Preserving First Order Unfold/fold Transformation System. Search on Bibsonomy ALP The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
45Janis Voigtländer Using Circular Programs to Deforest in Accumulating Parameters. Search on Bibsonomy High. Order Symb. Comput. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF intermediate results, accumulating arguments, unfold/fold, (short cut) deforestation, tree transducers, program transformation, tupling, circular programs
38Alberto Pettorossi, Maurizio Proietti, Valerio Senni Automatic Correctness Proofs for Logic Program Transformations. Search on Bibsonomy ICLP The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
38Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti Verification of Sets of Infinite State Processes Using Program Transformation. Search on Bibsonomy LOPSTR The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
38Abhik Roychoudhury, K. Narayan Kumar, C. R. Ramakrishnan 0001, I. V. Ramakrishnan, Scott A. Smolka Verification of Parameterized Systems Using Logic Program Transformations. Search on Bibsonomy TACAS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
38Robert Glück, Jesper Jørgensen, Bern Martens, Morten Heine Sørensen Controlling Conjunctive Partial Deduction. Search on Bibsonomy PLILP The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
38Annalisa Bossi, Sandro Etalle Transforming Acyclic Programs. Search on Bibsonomy ACM Trans. Program. Lang. Syst. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF acyclic programs, terminating programs, termination
36Mahmudul Faisal Al Ameen, Naoki Kobayashi 0001, Ryosuke Sato 0001 Asynchronous unfold/fold transformation for fixpoint logic. Search on Bibsonomy Sci. Comput. Program. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
36Mahmudul Faisal Al Ameen, Naoki Kobayashi 0001, Ryosuke Sato 0001 Asynchronous Unfold/Fold Transformation for Fixpoint Logic. Search on Bibsonomy FLOPS The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
36Geoff W. Hamilton, Neil D. Jones Proving the Correctness of Unfold/Fold Program Transformations Using Bisimulation. Search on Bibsonomy Ershov Memorial Conference The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
36Hirohisa Seki Proving Properties of Co-Logic Programs by Unfold/Fold Transformations. Search on Bibsonomy LOPSTR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
36Hirohisa Seki On Inductive Proofs by Extended Unfold/Fold Transformation Rules. Search on Bibsonomy LOPSTR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
36Hirohisa Seki On Inductive and Coinductive Proofs via Unfold/Fold Transformations. Search on Bibsonomy LOPSTR The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
36Mark Johnson 0001 Transforming Projective Bilexical Dependency Grammars into efficiently-parsable CFGs with Unfold-Fold. Search on Bibsonomy ACL The full citation details ... 2007 DBLP  BibTeX  RDF
36Alberto Pettorossi, Maurizio Proietti, Valerio Senni Proofs of Program Properties via Unfold/Fold Transformations of Constraint Logic Programs. Search on Bibsonomy Transformation Techniques in Software Engineering The full citation details ... 2005 DBLP  BibTeX  RDF
36Abhik Roychoudhury, C. R. Ramakrishnan 0001 Unfold/Fold Transformations for Automated Verification of Parameterized Concurrent Systems. Search on Bibsonomy Program Development in Computational Logic The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
36Abhik Roychoudhury, K. Narayan Kumar, C. R. Ramakrishnan 0001, I. V. Ramakrishnan Beyond Tamaki-Sato Style Unfold/Fold Transformations for Normal Logic Programs. Search on Bibsonomy Int. J. Found. Comput. Sci. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
36Hironohu Aoki, Motoki Miura, Jiro Tanaka A Web Site Editing System Based on Unfold/ Fold Operations. Search on Bibsonomy International Conference on Internet Computing The full citation details ... 2002 DBLP  BibTeX  RDF
36Alberto Pettorossi, Maurizio Proietti Synthesis and Transformation of Logic Programs Using Unfold/Fold Proofs. Search on Bibsonomy J. Log. Program. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
36Abhik Roychoudhury, K. Narayan Kumar, I. V. Ramakrishnan Generalized Unfold/fold Transformation Systems for Normal Logic Programs. Search on Bibsonomy ICLP The full citation details ... 1999 DBLP  BibTeX  RDF
36Abhik Roychoudhury, K. Narayan Kumar, C. R. Ramakrishnan 0001, I. V. Ramakrishnan A Parameterized Unfold/Fold Transformation Framework for Definite Logic Programs. Search on Bibsonomy PPDP The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
36Rym Salem, Khaled Bsaïes Unfold/Fold Inductive Proof: An Extension of a Folding Technique. Search on Bibsonomy IEA/AIE The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
36Alberto Pettorossi, Maurizio Proietti Program Specialization via Algorithmic Unfold/Fold Transformations. Search on Bibsonomy ACM Comput. Surv. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
36Sandro Etalle, Maurizio Gabbrielli, Maria Chiara Meo Unfold/Fold Transformations of CCP Programs. Search on Bibsonomy CONCUR The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
36Manolis Gergatsoulis Unfold/fold Transformations for Disjunctive Logic Programs. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
36Alberto Pettorossi, Maurizio Proietti, Sophie Renault Enhancing Partial Deduction via Unfold/Fold Rules. Search on Bibsonomy LOPSTR The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
36Chandrabose Aravindan, Phan Minh Dung On the Correctness of Unfold/Fold Transformation of Normal and Extended Logic Programs. Search on Bibsonomy J. Log. Program. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
36Maurizio Proietti, Alberto Pettorossi Total correctness of a goal replacement rule based on the unfold/fold proof method. Search on Bibsonomy GULP-PRODE (1) The full citation details ... 1994 DBLP  BibTeX  RDF
36Annalisa Bossi, Nicoletta Cocco Preserving Universal Termination through Unfold/Fold. Search on Bibsonomy ALP The full citation details ... 1994 DBLP  DOI  BibTeX  RDF universal termination, program transformations
36Khaled Bsaïes Implementing the Synthesis of Properties in Unfold/Fold Transformations. Search on Bibsonomy PLILP The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
36Annalisa Bossi, Sandro Etalle More on Unfold/Fold Transformations of Normal Programs: Preservation of Fitting's Semantics. Search on Bibsonomy META The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
36Hirohisa Seki Unfold/Fold Transformation of General Logic Programs for the Well-Founded Semantics. Search on Bibsonomy J. Log. Program. The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
36Maurizio Proietti, Alberto Pettorossi Synthesis of Programs from Unfold/Fold Proofs. Search on Bibsonomy LOPSTR The full citation details ... 1993 DBLP  BibTeX  RDF
36John C. Shepherdson Unfold/Fold Transformations of Logic Programs. Search on Bibsonomy Math. Struct. Comput. Sci. The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
36Taisuke Sato Equivalence-Preserving First-Order Unfold/Fold Transformation Systems. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
36Hirohisa Seki Unfold/Fold Transformations of Stratified Programs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
36Philippa Gardner, John C. Shepherdson Unfold/Fold Transformations of Logic Programs. Search on Bibsonomy Computational Logic - Essays in Honor of Alan Robinson The full citation details ... 1991 DBLP  BibTeX  RDF
36Tadashi Kawamura, Tadashi Kanamori Preservation of Stronger Equivalence in Unfold/Fold Logic Program Transformation. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
36Hirohisa Seki Unfold/Fold Transformation of Stratified Programs. (long version: TCS 86(1): 107-139 (1991)) Search on Bibsonomy ICLP The full citation details ... 1989 DBLP  BibTeX  RDF
36Tadashi Kawamura, Tadashi Kanamori Preserving of Stronger Equivalence in Unfold/Fold Logic Program Transformation. Search on Bibsonomy FGCS The full citation details ... 1988 DBLP  BibTeX  RDF
36Tadashi Kanamori, Kenji Horiuchi Construction of Logic Programs Based on Generalized Unfold/Fold Rules. Search on Bibsonomy ICLP The full citation details ... 1987 DBLP  BibTeX  RDF
36Hisao Tamaki, Taisuke Sato Unfold/Fold Transformation of Logic Programs. Search on Bibsonomy ICLP The full citation details ... 1984 DBLP  BibTeX  RDF
19Huu Hai Nguyen, Wei-Ngan Chin Enhancing Program Verification with Lemmas. Search on Bibsonomy CAV The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Lemma Proving, Lemma Application, Program Verification, Separation Logic, Entailment
19Javier Álvez, Paqui Lucio A Generalization of the Folding Rule for the Clark-Kunen Semantics. Search on Bibsonomy FLOPS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
19Hirohisa Seki On Negative Unfolding in the Answer Set Semantics. Search on Bibsonomy LOPSTR The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
19Huu Hai Nguyen, Cristina David, Shengchao Qin, Wei-Ngan Chin Automated Verification of Shape and Size Properties Via Separation Logic. Search on Bibsonomy VMCAI The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
19Alberto Pettorossi, Maurizio Proietti, Valerio Senni Proving Properties of Constraint Logic Programs by Eliminating Existential Variables. Search on Bibsonomy ICLP The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
19Alberto Pettorossi, Maurizio Proietti, Valerio Senni Transformational Verification of Parameterized Protocols Using Array Formulas. Search on Bibsonomy LOPSTR The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
19Kazunori Ueda A Pure Meta-interpreter for Flat GHC, a Concurrent Constraint Language. Search on Bibsonomy Computational Logic: Logic Programming and Beyond The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
19Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti Combining Logic Programs and Monadic Second Order Logics by Program Transformation. Search on Bibsonomy LOPSTR The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
19Morten Heine Sørensen Convergence of Program Transformers in the Metric Space of Trees. Search on Bibsonomy MPC The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
19María Alpuente, Moreno Falaschi, Ginés Moreno, Germán Vidal Safe Folding/Unfolding with Conditional Narrowing. Search on Bibsonomy ALP/HOA The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
19Alberto Momigliano, Mario Ornaghi Towards a Logic for Reasoning About Logic Programs Transformation. Search on Bibsonomy LOPSTR The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
19Maurizio Proietti, Alberto Pettorossi Unfolding - Definition - Folding, in this Order, for Avaoiding Unnecessary Variables in Logic Programs. (long version: TCS 142(1): 89-124 (1995)) Search on Bibsonomy PLILP The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
19Hiroshi Tsuda, Kôiti Hasida, Hidetosi Sirai cu-Prolog and its Application to a JPSG Parser. Search on Bibsonomy LP The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
19Norihiko Yoshida A transformational approach to the derivation of hardware algorithms from recurrence equations. Search on Bibsonomy SC The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
19Etsuo Itoh, Hiroshi Nakagawa Heuristic Applied in Tree Manipulation Algorithm Synthesis. Search on Bibsonomy LP The full citation details ... 1985 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #69 of 69 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license