|
|
|
|
| LEADER |
03859nmm a2200409 u 4500 |
| 001 |
EB000899228 |
| 003 |
EBX01000000000000000696348 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
141103 ||| eng |
| 020 |
|
|
|a 9783319119366
|
| 100 |
1 |
|
|a Cassez, Franck
|e [editor]
|
| 245 |
0 |
0 |
|a Automated Technology for Verification and Analysis
|h Elektronische Ressource
|b 12th International Symposium, ATVA 2014, Sydney, Australia, November 3-7, 2014, Proceedings
|c edited by Franck Cassez, Jean-Francois Raskin
|
| 250 |
|
|
|a 1st ed. 2014
|
| 260 |
|
|
|a Cham
|b Springer International Publishing
|c 2014, 2014
|
| 300 |
|
|
|a XXIV, 430 p. 109 illus
|b online resource
|
| 505 |
0 |
|
|a Verifying Communicating Multi-pushdown Systems via Split-Width -- Booster: An Acceleration-Based Verification Framework for Array Programs -- A Bounded Model Checker for SPARK Programs -- Acceleration of Affine Hybrid Transformations -- A Mechanized Proof of Loop Freedom of the (Untimed) AODV Routing Protocol -- Quantitative Verification of Weighted Kripke Structures -- Formal Safety Assessment via Contract-Based Design -- Verification of Markov Decision Processes Using Learning Algorithms -- Test Coverage Estimation Using Threshold Accepting -- On Time with Minimal Expected Cost! -- Fast Debugging of PRISM Models -- ACME: Automata with Counters, Monoids and Equivalence (Tool Paper).-Modelling and Analysis of Markov Reward Automata -- Extensional Crisis and Proving Identity -- Deciding Entailments in Inductive Separation Logic with Tree Automata -- Liveness Analysis for Parameterised Boolean Equation Systems -- Rabinizer 3: Safraless Translation of LTL to Small Deterministic Automata -- PeCAn: Compositional Verification of Petri Nets Made Easy -- The Context-Freeness Problem Is coNP-Complete for Flat Counter Systems -- Efficiently and Completely Verifying Synchronized Consistency Models -- Symmetry Reduction in Infinite Games with Finite Branching -- Incremental Encoding and Solving of Cardinality Constraints -- Formal Verification of Skiplists with Arbitrary Many Levels -- Using Flow Specifications of Parameterized Cache Coherence Protocols for Verifying Deadlock Freedom -- A Game-Theoretic Approach to Simulation of Data-Parameterized Systems -- Nested Reachability Approximation for Discrete-Time Markov Chains with Univariate Parameters -- Symbolic Memory with Pointers -- Trace Abstraction Refinement for Timed Automata -- Statistically Sound Verification and Optimization for Complex Systems
|
| 653 |
|
|
|a Computer Communication Networks
|
| 653 |
|
|
|a Compilers (Computer programs)
|
| 653 |
|
|
|a Computer Science Logic and Foundations of Programming
|
| 653 |
|
|
|a Compilers and Interpreters
|
| 653 |
|
|
|a Software engineering
|
| 653 |
|
|
|a Programming Techniques
|
| 653 |
|
|
|a Computer science
|
| 653 |
|
|
|a Computer programming
|
| 653 |
|
|
|a Software Engineering
|
| 653 |
|
|
|a Formal Languages and Automata Theory
|
| 653 |
|
|
|a Computer networks
|
| 653 |
|
|
|a Machine theory
|
| 700 |
1 |
|
|a Raskin, Jean-Francois
|e [editor]
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b Springer
|a Springer eBooks 2005-
|
| 490 |
0 |
|
|a Programming and Software Engineering
|
| 028 |
5 |
0 |
|a 10.1007/978-3-319-11936-6
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/978-3-319-11936-6?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 005.1
|
| 520 |
|
|
|a 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
|