Titlebook: Verification, Model Checking, and Abstract Interpretation; 20th International C Constantin Enea,Ruzica Piskac Conference proceedings 2019 S

他很灵活

变量

Synthesize

CARK

Relatively Complete Pushdown Analysis of Escape Continuations, compiler designs profitably leverage escape continuations, all previous approaches to analyze them statically in a higher-order setting have been ad hoc or imprecise. We present ., a generalization of . that analyzes them with pushdown precision in their most-general form. In particular, the summar

wreathe

craving

Effect-Driven Flow Analysis, a set of seen states as part of their fixed-point computation. This may require many state comparisons, which gives rise to a computational overhead. Even an analysis with a global store has to clear its set of seen states each time the store updates because of allocation or side-effects, which res

Flirtatious

火车车轮

Solving and Interpolating Constant Arrays Based on Weak Equivalences,nt arrays. Constant arrays store the same value at every index, which is useful for model checking of programs with initialised memory. Instead of using a store chain to explicitly initialise the memory, using a constant array can considerably simplify the queries and thus reduce the solving and int

苍白

A Decidable Logic for Tree Data-Structures with Measurements, functions based on Max or Sum, and recursive predicates based on these measure functions, such as AVL trees or red-black trees. We prove that the logic’s satisfiability is decidable. The crux of the decidability proof is a small model property which allows us to reduce the satisfiability of . to qu

consolidate

A Practical Algorithm for Structure Embedding, homomorphism from one to the other? The structure embedding problem is NP-complete in the general case, but for . structures (each predicate has arity .) we observe that it can be solved in polytime by reduction to bipartite graph matching. Our algorithm, MatchEmbeds, extends the bipartite matching