WeightedPushdownSystemsandtheirApplicationtoInterpr.ppt

WeightedPushdownSystemsandtheirApplicationtoInterpr.ppt

  1. 1、本文档共51页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
WeightedPushdownSystemsandtheirApplicationtoInterpr.ppt

Weighted Pushdown Systems and their Application to Interprocedural Dataflow Analysis; Weighted Pushdown Systems and their Application to Interprocedural Dataflow Analysis; Weighted Pushdown Systems and their Application to Interprocedural Dataflow Analysis;Intraprocedural Analysis;x = 3;Context-Sensitive Interprocedural Analysis;void p() { if (...) { x = x + 1; p(); // p_calls_p1 x = x - 1; } if (...) { x = x - 1; p(); // p_calls_p2 x = x + 1; } return; };An Expanded Set of Queries;An Expanded Set of Queries;An Expanded Set of Queries;An Expanded Set of Queries;An Expanded Set of Queries;So What? Who Cares? [Yawn] ;d;a;Pushdown System (PDS);Pushdown System (PDS);Pushdown System (PDS);Pushdown System (PDS);Rules Define a Transition Relation;Pushdown System (PDS);Supergraph as a PDS;Supergraph as a PDS;Supergraph as a PDS;Supergraph as a PDS;Supergraph as a PDS;Supergraph as a PDS;Supergraph as a PDS;Supergraph as a PDS;a;PDS Terminology;a;a;a;Representing Distributive Functions [POPL 95];“Gen/Kill” Function;x = 3;?;The set of configurations pre*(S) can be infinite Example σ,A ? σ, e pre* ( {σ,A}) = { σ Ai | i ≥ 1 } Solution in the PDS literature: Represent a set of configurations with an automaton;From M to Pre*(M);Observation;Interprocedural Dataflow Analysis;Weighted Pushdown System (WPDS);Idempotent Semiring (D, ?, ?, 0, 1) [= Meet Semilattice (D, ?, ..., ?, ...)];From M to Pre*(M);PS(p,A,q) ::= PS(p’,A’,q);An Application;Contributions;Related Work;void p() { if (...) { x = x + 1; p(); // p_calls_p1 x = x - 1; } if (...) { x = x - 1; p(); // p_calls_p2 x = x + 1; } return; }

文档评论(0)

ailuojue + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档