Titlebook: Static Analysis; 20th International S Francesco Logozzo,Manuel F?hndrich Conference proceedings 2013 Springer-Verlag Berlin Heidelberg 2013

disparage

Symbolic Automata for Static Specification Mining,tomata where transitions may be labeled by variables, and a variable can be substituted by a letter, a word, or a regular language. Using symbolic automata, we construct an abstract domain for static specification mining, capturing both the partialness of a specification and the precision of a speci

nascent

Predicate Abstraction for Relaxed Memory Models,ce the problem of verifying a program . running on a memory model . to the problem of verifying a program .. that captures an abstraction of . as part of the program..Second, we present a new technique for discovering predicates that enable verification of ... The core idea is to extrapolate from th

故意釣到白楊

On Solving Universally Quantified Horn Clauses,fication conditions of a program, such that the verification conditions are valid. Generic logical tools exist that can solve such problems modulo certain background theories, and therefore can be used for program analysis. Here, we extend these techniques to solve for . relations. This makes it pos

Isthmus

From Concrete Examples to Heap Manipulating Programs,ets the "hang of things", programming complex pointer manipulations (like reversing a linked list) still makes one reach for a notebook to draw some . diagrams to work out the low-level pointer jugglery. These diagrams are, not surprisingly, used as a basic tool to introduce heap manipulations in in

humectant

arsenal

情愛(ài)

AVANT

Byte-Precise Verification of Low-Level List Manipulation,etic, safe usage of invalid pointers, block operations with memory, reinterpretation of the memory contents, address alignment, etc. Our approach is based on a new representation of sets of heaps, which is to some degree inspired by works on separation logic with higher-order list predicates, but it

notion

glomeruli

Precise Slicing in Imperative Programs via Term-Rewriting and Abstract Interpretation,blem, which is based on term-rewriting, which primarily targets loop-free fragments and is fully precise in this setting. We incorporate abstract interpretation into term-rewriting, using a given arbitrary abstract lattice, resulting in a novel technique for slicing loops whose precision is linked t