Program slicing based on data-flow computation of path dependence flow graphs

被引：0
|
作者：
Naoi, Kuniaki [1 ]
Takahashi, Naohisa [1 ]
机构：
[1] NTT Software Lab, Musachino, Japan
来源：
Systems and Computers in Japan | 1997年 / 28卷 / 11期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：22 / 33
相关论文
共 50 条
  • [31] Optimal scheduling of digital signal processing data-flow graphs using shortest-path algorithms
    Shatnawi, A. (ali@just.edu.jo), 1600, Oxford University Press (45):
  • [32] An Effective Buffer Overflow Detection With Super Data-Flow Graphs
    Zhang, Yuantong
    Chen, Liwei
    Nie, Xiaofan
    Shi, Gang
    2022 IEEE INTL CONF ON PARALLEL & DISTRIBUTED PROCESSING WITH APPLICATIONS, BIG DATA & CLOUD COMPUTING, SUSTAINABLE COMPUTING & COMMUNICATIONS, SOCIAL COMPUTING & NETWORKING, ISPA/BDCLOUD/SOCIALCOM/SUSTAINCOM, 2022, : 684 - 691
  • [33] Optimal scheduling of digital signal processing data-flow graphs using shortest-path algorithms
    Shatnawi, A
    Ahmad, MO
    Swamy, MNS
    COMPUTER JOURNAL, 2002, 45 (01): : 88 - 100
  • [34] Fully static processor optimal assignment of data-flow graphs
    Ho, YC
    Tsay, JC
    IEEE SIGNAL PROCESSING LETTERS, 1997, 4 (05) : 146 - 148
  • [35] Retiming synchronous data-flow graphs to reduce execution time
    O'Neil, TW
    Sha, EHM
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2001, 49 (10) : 2397 - 2407
  • [36] FROM CONTROL FLOW TO DATA-FLOW
    BECK, M
    JOHNSON, R
    PINGALI, K
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1991, 12 (02) : 118 - 129
  • [37] DATA-FLOW ARCHITECTURE
    LERNER, EJ
    IEEE SPECTRUM, 1984, 21 (04) : 57 - 62
  • [38] DATA-FLOW ARCHITECTURES
    CULLER, A
    CULLER, DE
    ANNUAL REVIEW OF COMPUTER SCIENCE, 1986, 1 : 225 - 253
  • [39] Abstract program slicing on dependence condition graphs
    Halder, Raju
    Cortesi, Agostino
    SCIENCE OF COMPUTER PROGRAMMING, 2013, 78 (09) : 1240 - 1263
  • [40] DATA-FLOW AT MIT
    DETTMER, R
    ELECTRONICS AND POWER, 1986, 32 (08): : 570 - 571
12345