A Value Propagation Based Equivalence Checking Method for Verification of Code Motion Techniques

被引:8
|
作者
Banerjee, Kunal [1 ]
Karfa, Chandan [2 ]
Sarkar, Dipankar [1 ]
Mandal, Chittaranjan [1 ]
机构
[1] Indian Inst Technol, Dept Comp Sci & Engn, Kharagpur 721302, W Bengal, India
[2] Synopsys India Pvt Ltd, Bangalore 560016, Karnataka, India
关键词
code motion validation; equivalence checking; value propagation; finite state machines with datapath;
D O I
10.1109/ISED.2012.28
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
A novel value propagation based equivalence checking method of finite state machines with datapath (FSMDs) is presented here for validation of code motion transformations commonly applied during scheduling phase of high-level synthesis. Unlike many other reported techniques, our method is able to handle code motions across loop bodies. This is accomplished by repeated propagation of the mismatched values to subsequent paths until the values match or the final path segments are traversed without finding a match. Checking loop invariance of the values being propagated beyond the loops has been underlined to play an important role. The proposed method is capable of handling control structure modification as well. The method has been implemented and satisfactorily tested for some benchmark examples.
引用
收藏
页码:67 / 71
页数:5
相关论文
共 50 条
  • [41] A back propagation neural network based respiratory motion modelling method
    Jiang, Shan
    Li, Bowen
    Yang, Zhiyong
    Li, Yuhua
    Zhou, Zeyang
    INTERNATIONAL JOURNAL OF MEDICAL ROBOTICS AND COMPUTER ASSISTED SURGERY, 2024, 20 (03):
  • [42] Truncation Method of Ground Motion Records Based on the Equivalence of Structural Maximum Displacement Responses
    Li, Shuang
    He, Yiting
    Wei, Yuliang
    JOURNAL OF EARTHQUAKE ENGINEERING, 2022, 26 (10) : 5268 - 5289
  • [43] Development and Verification of Hexagonal Quasi-diffusion Code Based on Variational Nodal Method
    Zhuang K.
    Wang L.
    Liu K.
    Yan J.
    Shang W.
    Yuanzineng Kexue Jishu/Atomic Energy Science and Technology, 2023, 57 (01): : 147 - 155
  • [44] Method of Formal Verification of Program Code based on Petri Net with Additional Semantic Relations
    Ivutin, Alexey N.
    Voloshko, Anna G.
    13TH INTERNATIONAL CONFERENCE ON ELEKTRO (ELEKTRO 2020), 2020,
  • [45] A Path-Based Equivalence Checking Method Between System Level and RTL Descriptions Using Machine Learning
    Hu, Jian
    Hu, Yongyang
    Lv, Qi
    Wang, Wentao
    Wang, Guanwu
    Chen, Guilin
    Wang, Kang
    Kang, Yun
    Yang, Haitao
    JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS, 2021, 30 (04)
  • [46] Verification of motion control method with estimated equivalent mass based on workspace observer
    Togashi, Nobuyuki
    Yamashita, Toru
    Shimono, Tomoyuki
    Motoi, Naoki
    Oda, Naoki
    IEEJ Transactions on Industry Applications, 2014, 134 (02) : 115 - 126
  • [47] A novel image based verification method for respiratory motion management in radiation therapy
    Khamene, Ali
    Schaller, Christian
    Homegger, Joachim
    Celi, Juan Carlos
    Ofstad, Barbara
    Rietzel, Eike
    Li, X. Allen
    Tai, An
    Bayouth, John
    2007 IEEE 11TH INTERNATIONAL CONFERENCE ON COMPUTER VISION, VOLS 1-6, 2007, : 2386 - +
  • [48] A new technique for copy propagation and dead code elimination using hash based value numbering
    Sunitha, K. V. N.
    Kumar, V. Vijaya
    2006 INTERNATIONAL CONFERENCE ON ADVANCED COMPUTING AND COMMUNICATIONS, VOLS 1 AND 2, 2007, : 585 - +
  • [49] The self-checking structures implementation features based on the inverting data and linear block code method
    Efanov, Dmitry, V
    VESTNIK TOMSKOGO GOSUDARSTVENNOGO UNIVERSITETA-UPRAVLENIE VYCHISLITELNAJA TEHNIKA I INFORMATIKA-TOMSK STATE UNIVERSITY JOURNAL OF CONTROL AND COMPUTER SCIENCE, 2023, (65): : 126 - 138
  • [50] A social recommendation method based on trust propagation and singular value decomposition
    Li, Weijiang
    Qi, Jing
    Yu, Zhengtao
    Li, Dongjun
    JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2017, 32 (01) : 807 - 816