Titlebook: Verification, Model Checking, and Abstract Interpretation; 12th International C Ranjit Jhala,David Schmidt Conference proceedings 2011 Spri

Merited

Refinement-Based CFG Reconstruction from Unstructured Programs,ly an executable file. The problem is tackled in an original way, with a refinement-based static analysis working over finite sets of constant values. Requirement propagation allows the analysis to automatically adjust the domain precision only where it is needed, resulting in precise CFG recovery a

尖牙

SAT-Based Model Checking without Unrolling,e inductive relative to (and augment) stepwise approximate reachability information. In this way, the algorithm gradually refines the property, eventually producing either an inductive strengthening of the property or a counterexample trace. Our experimental studies show that induction is a powerful

減至最低

Beyond Quantifier-Free Interpolation in Extensions of Presburger Arithmetic, of Presburger arithmetic combined with (i)?uninterpreted predicates (QPA+UP), (ii)?uninterpreted functions (QPA+UF) and (iii)?extensional arrays (QPA+AR). We prove that none of these combinations can be effectively interpolated without the use of quantifiers, even if the input formulae are quantifi

thwart

,Probabilistic Büchi Automata with Non-extremal Acceptance Thresholds, strictly between 0 and 1. Many practical randomized algorithms are designed to work under non-extremal threshold probabilities and thus it is important to study power of PBAs for such cases..The paper presents a number of surprising expressiveness and decidability results for PBAs when the threshol

嗎啡

JUST

Proving Stabilization of Biological Systems, scalability, our procedure uses modular proof techniques, where state-space exploration is applied only locally to small pieces of the system rather than the entire system as a whole. Our procedure exploits the observation that, in practice, the form of modular proofs can be restricted to a very li

Largess

Precondition Inference from Intermittent Assertions and Application to Contracts on Collections,y contracts, these assertions would better be given as a precondition of the method/procedure which can detect that a caller has violated the procedure’s contract in a way which definitely leads to an assertion violation (., for separate static analysis). We define precisely and formally the contrac

轉(zhuǎn)向

Strengthening Induction-Based Race Checking with Lightweight Static Analysis,ncorrectly orchestrated DMAs cause ., leading to subtle bugs that are hard to reproduce and fix. In previous work, we have shown that .-induction yields an effective method for proving absence of a restricted class of DMA races. We extend this work to handle a larger class of DMA races. We show that

搖曳

細(xì)胞學(xué)

Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creawned processes allow to extend the basic model with joining of created processes [2]. Orthogonally DPNs can be extended with nested locking [9]. Reachability of a regular set . of configurations in presence of stable constraints as well as reachability without constraints but with nested locking are