UNFOLD FOLD TRANSFORMATIONS AND LOOP OPTIMIZATION OF LOGIC PROGRAMS

被引:0
|
作者
DEBRAY, SK [1 ]
机构
[1] UNIV ARIZONA,DEPT COMP SCI,TUCSON,AZ 85721
来源
SIGPLAN NOTICES | 1988年 / 23卷 / 07期
关键词
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
引用
收藏
页码:297 / 307
页数:11
相关论文
共 50 条
  • [1] Unfold/fold transformations for disjunctive logic programs
    Gergatsoulis, M
    INFORMATION PROCESSING LETTERS, 1997, 62 (01) : 23 - 29
  • [3] Fold/Unfold Transformations for Fixpoint Logic
    Kobayashi, Naoki
    Fedyukovich, Grigory
    Gupta, Aarti
    TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, PT II, TACAS 2020, 2020, 12079 : 195 - 214
  • [4] Unfold/fold transformations of CCP programs
    Etalle, S
    Gabbrielli, M
    Meo, MC
    CONCUR'98: CONCURRENCY THEORY, 1998, 1466 : 348 - 363
  • [5] An unfold/fold transformation framework for definite logic programs
    Roychoudhury, A
    Kumar, KN
    Ramakrishnan, CR
    Ramakrishnan, IV
    ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 2004, 26 (03): : 464 - 509
  • [6] A parameterized unfold/fold transformation framework for definite logic programs
    Roychoudhury, A
    Kumar, KN
    Ramakrishnan, CR
    Ramakrishnan, IV
    PRINCIPLES AND PRACTICE OF DECLARATIVE PROGRAMMING, PROCEEDINGS, 1999, 1702 : 396 - 413
  • [7] ON THE CORRECTNESS OF UNFOLD/FOLD TRANSFORMATION OF NORMAL AND EXTENDED LOGIC PROGRAMS
    ARAVINDAN, C
    DUNG, PM
    JOURNAL OF LOGIC PROGRAMMING, 1995, 24 (03): : 201 - 217
  • [8] DERIVING FOLD UNFOLD TRANSFORMATIONS OF LOGIC PROGRAMS USING EXTENDED OLDT-BASED ABSTRACT INTERPRETATION
    BOULANGER, D
    BRUYNOOGHE, M
    JOURNAL OF SYMBOLIC COMPUTATION, 1993, 15 (5-6) : 495 - 521
  • [9] Generalized unfold/fold transformation systems for normal logic programs
    Roychoudhury, A
    Kumar, KN
    Ramakrishnan, IV
    LOGIC PROGRAMMING: PROCEEDINGS OF THE 1999 INTERNATIONAL CONFERENCE ON LOGIC PROGRAMMING, 1999, : 616 - 616
  • [10] Synthesis and transformation of logic programs using unfold/fold proofs
    Pettorossi, A
    Proietti, M
    JOURNAL OF LOGIC PROGRAMMING, 1999, 41 (2-3): : 197 - 230