000 04202nam a22005657a 4500
001 sulb-eb0025366
003 BD-SySUS
005 20160413122523.0
007 cr nn 008mamaa
008 130711s2013 gw | s |||| 0|eng d
020 _a9783642397998
_9978-3-642-39799-8
024 7 _a10.1007/978-3-642-39799-8
_2doi
050 4 _aQA76.9.L63
050 4 _aQA76.5913
050 4 _aQA76.63
072 7 _aUM
_2bicssc
072 7 _aUYF
_2bicssc
072 7 _aCOM051000
_2bisacsh
072 7 _aCOM036000
_2bisacsh
082 0 4 _a005.1015113
_223
245 1 0 _aComputer Aided Verification
_h[electronic resource] :
_b25th International Conference, CAV 2013, Saint Petersburg, Russia, July 13-19, 2013. Proceedings /
_cedited by Natasha Sharygina, Helmut Veith.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2013.
300 _aXXII, 1015 p. 237 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v8044
505 0 _aAutomata 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.
520 _aThis 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. The 54 regular and 16 tool papers presented were carefully selected from 209 submissions. The papers are organized in topical sections on biology, concurrency, hardware, hybrid systems, interpolation, loops and termination, new domains, probability and statistics, SAT and SMZ, security, shape analysis, synthesis, and time.
650 0 _aComputer science.
650 0 _aSpecial purpose computers.
650 0 _aSoftware engineering.
650 0 _aComputer logic.
650 1 4 _aComputer Science.
650 2 4 _aLogics and Meanings of Programs.
650 2 4 _aSoftware Engineering.
650 2 4 _aSpecial Purpose and Application-Based Systems.
700 1 _aSharygina, Natasha.
_eeditor.
700 1 _aVeith, Helmut.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783642397981
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v8044
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-642-39799-8
912 _aZDB-2-SCS
912 _aZDB-2-LNC
942 _2Dewey Decimal Classification
_ceBooks
999 _c47458
_d47458