Titlebook: Automated Technology for Verification and Analysis; 12th International S Franck Cassez,Jean-Fran?ois Raskin Conference proceedings 2014 Spr

Proclaim

RAFF

Test Coverage Estimation Using Threshold Accepting,e in each exploration step is, on one hand, computationally costly, and on the other hand, not always a good choice since this may make the system try to expand in the directions which are not reachable (due to the controllability of the system). Instead of considering all the boxes in the partition

Preserve

承認(rèn)

A. J. Dolman,A. Verhagen,C. A. Roversties in MDPs. In contrast with other related techniques, our approach is not restricted to time-bounded (finite-horizon) or discounted properties, nor does it assume any particular properties of the MDP. We also show how our methods extend to LTL objectives. We present experimental results showing t

Offensive

Global Environmental Change and Land Usee in each exploration step is, on one hand, computationally costly, and on the other hand, not always a good choice since this may make the system try to expand in the directions which are not reachable (due to the controllability of the system). Instead of considering all the boxes in the partition

insipid

Acceleration of Affine Hybrid Transformations,ng the data transformations that label these cycles, by reasoning about the geometrical features of the corresponding system of linear constraints. This approach is complete over Multiple Counters Systems (MCS), and is able to accelerate hybrid transformations that are out of scope of existing techniques.

detach

A Mechanized Proof of Loop Freedom of the (Untimed) AODV Routing Protocol, of nodes. We exploit the mechanization to analyse several improvements of AODV and show that Isabelle/HOL can re-establish most proof obligations automatically and identify exactly the steps that are no longer valid.

提名的名單

Fast Debugging of PRISM Models, ., a technique identifying a subset of critical commands has recently been proposed. Based on repeatedly solving .?instances, our novel approach to computing a minimal critical command set achieves a speed-up of up to five orders of magnitude over the previously existing technique.

FANG

Liveness Analysis for Parameterised Boolean Equation Systems,low graph, needed for the analysis, may suffer from an exponential blow-up, and we define an approximate analysis that avoids this problem. The effectiveness of our techniques is evaluated using a number of case studies.

捏造

Rabinizer 3: Safraless Translation of LTL to Small Deterministic Automata,which can also be used for probabilistic model checking and are sometimes by orders of magnitude smaller. We also link our tool to . and show that this leads to a?significant speed-up of probabilistic LTL model checking, especially with the generalized Rabin automata.