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

Apoptosis

整體

Cost-Aware Automatic Program Repair,oes not exceed a given repair budget. As part of our predicate abstractionbased solution framework, we present a sound and complete algorithm for repair of Boolean programs. We have developed a prototype tool based on SMT solving and used it successfully to repair diverse errors in benchmark C programs.

上腭

A Decision Tree Abstract Domain for Proving Conditional Termination,g conditional termination of programs written in (a subset of) . and, using experimental evidence, we show that it performs well on a wide variety of benchmarks, it is competitive with the state of the art and is able to analyze programs that are out of the reach of existing methods.

膠狀

Block Me If You Can!,w experimentally the efficiency of the method, on various examples, including a fine-grained model of Szymanski’s mutual exclusion protocol, whose correctness, to the best of our knowledge, has not been proven automatically by any other existing methods.

absolve

Cyclic Abduction of Inductively Defined Safety and Termination Preconditions,uite of heuristically guided tactics. It is often able to automatically infer preconditions describing lists, trees, cyclic and composite structures which, in other tools, previously had to be supplied by hand.

為敵

Verifying Recursive Programs Using Intraprocedural Analyzers,underlying program analyzer. Such function summaries enable our algorithm to check recursive programs. We implement a prototype using the recursion-free program analyzer . and compare it with other program analyzers on the benchmarks in the 2014 Competition on Software Verification.

Mammal

Backward Analysis via over-Approximate Abstraction and under-Approximate Subtraction,mating logical subtraction operation. Unlike general complementation, subtraction more easily allows for increased precision in case its arguments are related. The approach is not restricted to a specific abstract domain and we use it to analyze programs using the abstract domains of intervals and of 3-valued structures

有惡臭

Aviary

沒有準備

An Abstract Domain Combinator for Separately Conjoining Memory Abstractions,s approach eases the design of the analysis as memory abstract domains can be re-used by applying our separating conjunction domain combinator. And more importantly, this combinator enables an analysis designer to easily create a combined domain that applies computationally-expensive abstract domains only where it is required.