Titlebook: Static Analysis; 4th International Sy Pascal Hentenryck Conference proceedings 1997 Springer-Verlag Berlin Heidelberg 1997 Abstract Interpr

EXERT

书目名称Static Analysis影响因子(影响力)




书目名称Static Analysis影响因子(影响力)学科排名




书目名称Static Analysis网络公开度




书目名称Static Analysis网络公开度学科排名




书目名称Static Analysis被引频次




书目名称Static Analysis被引频次学科排名




书目名称Static Analysis年度引用




书目名称Static Analysis年度引用学科排名




书目名称Static Analysis读者反馈




书目名称Static Analysis读者反馈学科排名

陶醉

贫穷地活

vitreous-humor

0302-9743 monstration, three posters, and six invited contributions by leading scientists. The papers are organized in topical sections on procedural languages, logic programming, concurrency, and termination.978-3-540-63468-3978-3-540-69576-9Series ISSN 0302-9743 Series E-ISSN 1611-3349

Tinea-Capitis

档案

Fast and effective procedure inlining,rcising those opportunities. This paper presents a new inlining algorithm for higher-order languages that combines simple analysis techniques with demand-driven online transformation to achieve consistent and often dramatic performance gains in fast linear time. The algorithm is shown to be as effec

macular-edema

Set-sharing is redundant for pair-sharing,racterizes set-sharing. In this paper, we question, apparently for the first time, whether this domain is over-complex for pair-sharing analysis. We show that the answer is .. By defining an equivalence relation over the set-sharing domain we obtain a simpler domain, reducing the complexity of the a

A简洁的

mechanical

Towards a cost-effective estimation of uncaught exceptions in SML programs,sis will predict abrupt termination of SML programs, which is SML‘s only one “safety hole”..Even though SML program‘s control flow and exception flow are in general mutually dependent, analyzing the two flows are safely decoupled. Program‘s control-flow is firstly estimated from a set of equations d

依法逮捕

Program analysis using mixed term and set constraints,tion of equality constraints over terms are very fast but often imprecise. At the other extreme, methods based on the resolution of inclusion constraints over set expressions are quite precise, but are often inefficient in practice. We describe a parameterized framework for constraint-based program