Titlebook: Verification, Model Checking, and Abstract Interpretation; 10th International C Neil D. Jones,Markus Müller-Olm Conference proceedings 2009

變色龍

我吃花盤旋

Model Checking: Progress and Problemst (symbolic) representation..Unfortunately, none of these techniques scale well beyond a certain range. Nor is temporal logic universally viewed as a natural specification framework. We will discuss some possible ways to enhance efficiency and expressiveness of model checking.

IDEAS

Mostly-Functional Behavior in Java Programslly, we find significant amounts of . behavior in realistic Java programs: in the benchmarks we analyzed, between 48–53% of declared fields were identifiable as quiescing and between 24–78% of dynamic field reads were from quiescing fields.

用不完

An Abstract Interpretation-Based Framework for Control Flow Reconstruction from Binariesindirect jumps which safely combines a pluggable abstract domain with the notion of partial control flow graphs. Using our framework, we are able to show that the control flow reconstruction algorithm of our disassembly tool Jakstab produces the most precise overapproximation of the control flow graph with respect to the used abstract domain.

敲竹杠

Model Checking Concurrent Programss, symbolic model checking with partial order reduction, and dynamic techniques for verifying concurrent programs. These techniques have been implemented in a unified verification platform, currently targeted at multi-threaded C programs. I will also report on our experiences on some challenging examples from the public domain and the industry.

Highbrow

LTL Generalized Model Checking Revisitedlating program abstractions. We show that LTL GMC with this weaker preorder is only EXPSPACE-complete in the size of the formula, and can be solved in linear time and logarithmic space in the size of the model. Finally, we identify classes of formulas for which the model complexity of standard GMC is reduced.

罐里有戒指

Constraint-Based Invariant Inference over Predicate Abstractionximally-weak preconditions for safety assertions. An interesting application of maximally-weak precondition generation is to produce maximally-general counterexamples for safety assertions. We also present preliminary experimental evidence demonstrating the feasibility of this technique.

IST

Abstraction Refinement for Probabilistic Softwareng and components from GOTO-CC, SATABS and PRISM. Experimental results show that our approach performs very well in practice, successfully verifying actual networking software whose complexity is significantly beyond the scope of existing probabilistic verification tools.

fallible

放逐