Titlebook: Static Analysis; 16th International S Jens Palsberg,Zhendong Su Conference proceedings 2009 Springer-Verlag Berlin Heidelberg 2009 abstract

可能性

Bottom-Up Shape Analysis-up and non-iterative. We present our algorithm as an inference system for computing Hoare triples summarizing heap manipulating programs. Our inference rules are compositional: Hoare triples for a compound statement are computed from the Hoare triples of its component statements. These inference ru

方舟

The Complexity of Andersen’s Analysis in Practicedes. We examine algorithmic factors that help account for this gap. In particular, we show that a simple algorithm can compute Andersen’s analysis in worst-case quadratic time as long as the input program is .-., . it has at most . statements dereferencing each variable and a sparse flow graph. We t

neoplasm

Peak-Bone-Mass

陶醉

Abstract Parsing: Static Analysis of Dynamically Generated String Output Using LR-Parsing Technologyd on the document language’s context-free reference grammar and the program’s control structure, the analysis . how the documents will be generated and . the predicted documents. Our strategy remembers context-free structure by computing .. The technique is implemented in Objective Caml and has stat

Fretful

diathermy

Inferring Dataflow Properties of User Defined Table Processorsence of universally quantified loop invariants..We prototyped the analysis as Scooby, a static analyzer for .NET iterators. Scooby is able to discover useful properties for typical SCOPE programs automatically and efficiently.

Liberate

使隔离

0302-9743 A in August 2009 - co-located with LICS 2009, the 24th IEEE Symposium on Logic in Computer Science.The 21 revised full papers presented together with two invited lectures were carefully reviewed and selected from 52 submissions. The papers address all aspects of static analysis including abstract do

支柱

Refinement of Trace Abstractionby the infeasibility proof for an error trace) in order to automatically construct such an automaton. A data base of . has an interesting potential for reuse of theorem proving work (from one program to another).