Automated Technology for Verification and Analysis: 12th International Symposium, ATVA 2014, Sydney, Australia, November 3-7, 2014, ProceedingsFranck Cassez, Jean-Francois Raskin This book constitutes the proceedings of the 12th International Symposium on Automated Technology for Verification and Analysis, ATVA 2014, held in Sydney, Australia, in November 2014. The 29 revised papers presented in this volume were carefully reviewed and selected from 76 submissions. They show current research on theoretical and practical aspects of automated analysis, verification and synthesis by providing an international forum for interaction among the researchers in academia and industry. |
Contents
| 1 | |
An AccelerationBased Verification Framework for Array Programs | 18 |
A Bounded Model Checker for SPARK Programs | 24 |
Acceleration of Affine Hybrid Transformations | 31 |
A Mechanized Proof of Loop Freedom of the Untimed AODV Routing Protocol | 47 |
Quantitative Verification of Weighted Kripke Structures | 64 |
Formal Safety Assessment via ContractBased Design | 81 |
Verification of Markov Decision Processes Using Learning Algorithms | 98 |
Safraless Translation of LTL to Small Deterministic Automata | 235 |
Compositional Verification of Petri Nets Made Easy | 242 |
The ContextFreeness Problem Is coNPComplete for Flat Counter Systems | 248 |
Efficiently and Completely Verifying Synchronized Consistency Models | 264 |
Symmetry Reduction in Infinite Games with Finite Branching | 281 |
Incremental Encoding and Solving of Cardinality Constraints | 297 |
Formal Verification of Skiplists with Arbitrary Many Levels | 314 |
Using Flow Specifications of Parameterized Cache Coherence Protocols for Verifying Deadlock Freedom | 330 |
Test Coverage Estimation Using Threshold Accepting | 115 |
On Time with Minimal Expected Cost | 129 |
Fast Debugging of PRISM Models | 146 |
Automata with Counters Monoids and Equivalence | 163 |
Modelling and Analysis of Markov Reward Automata | 168 |
Extensional Crisis and Proving Identity | 185 |
Deciding Entailments in Inductive Separation Logic with Tree Automata | 201 |
Liveness Analysis for Parameterised Boolean Equation Systems | 219 |
A GameTheoretic Approach to Simulation of DataParameterized Systems | 348 |
Nested Reachability Approximation for DiscreteTime Markov Chains with Univariate Parameters | 364 |
Symbolic Memory with Pointers | 380 |
Trace Abstraction Refinement for Timed Automata | 396 |
Statistically Sound Verification and Optimization for Complex Systems | 411 |
| 428 | |
Other editions - View all
Automated Technology for Verification and Analysis: 12th International ... Franck Cassez,Jean-Francois Raskin No preview available - 2015 |
Automated Technology for Verification and Analysis: 12th International ... Franck Cassez,Jean-Francois Raskin No preview available - 2014 |
Common terms and phrases
agent algorithm analysis AODV approach array ATVA automata automaton bisimulation bounded Commonsense Reasoning component Computer Science constraints context-free corresponding counter systems decision procedure defined Definition denote encoding example extensionality finite set formal formula given graph Heidelberg Heidelberg 2013 IEEE implementation inductive input integer invariants Isabelle/HOL iteration k-DST Kripke structure labelling Lemma linear LNCS loop Markov Markov decision processes MaxSAT memory model method model checking node optimal parameters parity games path Petri nets predicate probabilistic probabilistic automata problem proof properties protocol prove reachability functions reset reward s-deadlock satisfies Section semantics sequence Set Theory simulation skiplist soft clauses solved solver sorting network specification split-width Springer SQMSC stochastic strategy stratifiable synchronization techniques temporal logic tool transition tree tuple update variables vector verification weighted Kripke structure