Titlebook: Static Analysis; 21st International S Markus Müller-Olm,Helmut Seidl Conference proceedings 2014 Springer International Publishing Switzerl

传家宝

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




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




书目名称Static Analysis网络公开度




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




书目名称Static Analysis被引频次




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




书目名称Static Analysis年度引用




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




书目名称Static Analysis读者反馈




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

Tractable

neolith

Invariance of Conjunctions of Polynomial Equalities for Algebraic Differential Equations,s. The procedure is based on a necessary and sufficient condition that characterizes invariant conjunctions of polynomial equalities. We contrast this approach to an alternative one which combines fast and sufficient (but not necessary) conditions using differential cuts for soundly restricting the system evolution domain.

yohimbine

Conference proceedings 2014 aspects of static analysis, including abstract interpretation, abstract testing, bug detection, data flow analysis, model checking, program transformation, program verification, security analysis, and type checking.

内阁

0302-9743 ddress all aspects of static analysis, including abstract interpretation, abstract testing, bug detection, data flow analysis, model checking, program transformation, program verification, security analysis, and type checking.978-3-319-10935-0978-3-319-10936-7Series ISSN 0302-9743 Series E-ISSN 1611-3349

emission

Peak Cost Analysis of Distributed Systems,tion is the novel notion of . which captures the worst-case cost of the tasks that may be simultaneously pending to execute at each location along the execution. A prototype implementation demonstrates the accuracy and feasibility of the proposed peak cost analysis.

JUST

Expectation Invariants for Probabilistic Program Loops as Fixed Points,ent an iterative analysis that synthesizes expectation invariants for probabilistic program loops. We show how the standard polyhedral abstract domain can be used to synthesize expectation invariants for probabilistic programs, and demonstrate the usefulness of our approach on some examples of probabilistic program loops.

施加

语言学

ANA

Synthesis of Memory Fences via Refinement Propagation,reduces the time required to discover a proof for ...We implemented our technique and successfully applied it to several challenging concurrent algorithms, including state of the art concurrent work-stealing queues.