您当前的位置:
首页 >
文章列表页 >
An Approach to Analyzing Dependence of Concurrent Programs Based on Program Reachability Graphs
更新时间:2025-07-16
    • An Approach to Analyzing Dependence of Concurrent Programs Based on Program Reachability Graphs

    • Acta Electronica Sinica   Vol. 35, Issue 2, Pages: 287-291(2007)
    • CLC: TP311
    • Published:2007

    移动端阅览

  • QI Xiao-fang, XU Bao-wen, ZHOU Xiao-yu. An Approach to Analyzing Dependence of Concurrent Programs Based on Program Reachability Graphs[J]. Acta Electronica Sinica, 2007, 35(2): 287-291. DOI:

  •  
  •  
icon
试读结束,您可以激活您的VIP账号继续阅读。
去激活 >
icon
试读结束,您可以通过登录账户,到个人中心,购买VIP会员阅读全文。
已是VIP会员?
去登录 >

0

Views

1683

下载量

8

CSCD

Alert me when the article has been cited
提交
Tools
Download
Export Citation
Share
Add to favorites
Add to my album

Related Articles

P-Slicer: A Program Slicing Approach Based on Learning Path Representations
Formal Analysis of Security Protocols Using Petri Nets

Related Author

LIU Tian-yang
SHI Jian-jun
YE Jia-wei
JI Wei-xing
LIU Dao-bin
Guo Li
BAI Shuo

Related Institution

School of Computer Science and Technology, Beijing Institute of Technology
School of Artificial Intelligence, Beijing Normal University
Institute of Computing Technology,Chinese Academy of Sciences
0