Computer Aided Verification

25th International Conference, CAV 2013, Saint Petersburg, Russia, July 13-19, 2013, Proceedings

Häftad, Engelska, 2013

1 449 kr

Beställningsvara. Skickas inom 10-15 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

This book constitutes the thoroughly refereed proceedings of the 25th International Conference on Computer Aided Verification, CAV 2013 held in St. Petersburg, Russia in July 2013.

Produktinformation

Utgivningsdatum2013-07-14
Mått155 x 235 x 56 mm
Vikt1 539 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor1 015
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783642397981

Tillhör följande kategorier

Systemvetenskap och AI inom Data och it
Programvaruutveckling inom Data och it

Automata Networks.- Model-Checking Signal Transduction Networks through Decreasing Reachability Sets.- TTP: Tool for Tumor Progression.- Exploring Parameter Space of Stochastic Biochemical Systems using Quantitative Model Checking.- Parameterized Verification of Asynchronous Shared-Memory Systems.- Partial Orders for Efficient BMC of Concurrent Software.- Incremental, Inductive Coverability.- Automatic linearizability proofs of concurrent objects with cooperating.- Updates.- Duet: Static Analysis for Unbounded Parallelism.- SVA and PSL Local Variables.- A Practical Approach.- Formal Verification of Hardware Synthesis.- CacBDD: A BDD Package with Dynamic Cache Management.- Distributed Explicit State Model Checking of Deadlock Freedom.- Exponential-Condition-Based Barrier Certificate Generation for Safety.- Verification of Hybrid Systems .- Efficient Robust Monitoring for STL.- Abstraction based Model-Checking of Stability of Hybrid Systems.- Faster Algorithms for Markov Decision Processes with Low Tree width.- Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis.- Importance Splitting for Statistical Model Checking Rare Properties.- Minimal Sets over Monotone Predicates in Boolean Formulae.- Smten: Automatic Translation of High-level Symbolic Computations into SMT Queries.- QUAIL: a quantitative security analyzer for imperative code.- Effectively Propositional Reasoning about Reachability in Linked Data Structures.- Learning Universally Quantified Invariants of Linear Data Structures.- GOAL for Games, Omega-Automata, and Logics.- Efficient synthesis for concurrency using semantics-preserving Transformations.