000 05541nam a22006135i 4500
001 978-3-030-25543-5
003 DE-He213
005 20200127152617.0
007 cr nn 008mamaa
008 190712s2019 gw | s |||| 0|eng d
020 _a9783030255435
_9978-3-030-25543-5
024 7 _a10.1007/978-3-030-25543-5
_2doi
050 4 _aQA76.758
072 7 _aUMZ
_2bicssc
072 7 _aCOM051230
_2bisacsh
072 7 _aUMZ
_2thema
082 0 4 _a005.1
_223
245 1 0 _aComputer Aided Verification
_h[electronic resource] :
_b31st International Conference, CAV 2019, New York City, NY, USA, July 15-18, 2019, Proceedings, Part II /
_cedited by Isil Dillig, Serdar Tasiran.
250 _a1st ed. 2019.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2019.
300 _aXX, 549 p. 1209 illus., 42 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues ;
_v11562
505 0 _aLogics, Decision Procedures, and Solvers -- Satisfiability Checking for Mission-Time LTL -- High-Level Abstractions for Simplifying Extended String Constraints in SMT -- Alternating Automata Modulo First Order Theories -- Q3B: An Efficient BDD-based SMT Solver for Quantified Bit-Vectors -- CVC4SY: Smart and Fast Term Enumeration for Syntax-Guided Synthesis -- Incremental Determinization for Quantifier Elimination and Functional Synthesis -- Numerical Programs -- Loop Summarization with Rational Vector Addition Systems -- Invertibility Conditions for Floating-Point Formulas -- Numerically-Robust Inductive Proof Rules for Continuous Dynamical Systems -- Icing: Supporting Fast-math Style Optimizations in a Verified Compiler -- Sound Approximation of Programs with Elementary Functions -- Verification -- Formal verification of quantum algorithms using quantum Hoare logic -- SecCSL: Security Concurrent Separation Logic -- Reachability Analysis for AWS-based Networks -- Distributed Systems and Networks -- Verification of Threshold-Based Distributed Algorithms by Decomposition to Decidable Logics -- Gradual Consistency Checking -- Checking Robustness Against Snapshot Isolation -- Efficient verification of network fault tolerance via counterexampleguided refinement -- On the Complexity of Checking Consistency for Replicated Data Types -- Communication-closed asynchronous protocols -- Verification and Invariants -- Interpolating Strong Induction -- Verifying Asynchronous Event-Driven Programs Using Partial Abstract Transformers -- Inferring Inductive Invariants from Phase Structures -- Termination of Triangular Integer Loops is Decidable -- AliveInLean: A Verified LLVM Peephole Optimization Verifier -- Concurrency -- Automated Parameterized Verification of CRDTs -- What's wrong with on-the-y partial order reduction -- Integrating Formal Schedulability Analysis into a Verifed OS Kernel -- Rely-guarantee Reasoning about Concurrent Memory Management in Zephyr RTOS -- Violat: Generating Tests of Observational Refinement for Concurrent Objects. .
506 0 _aOpen Access
520 _aThe open access two-volume set LNCS 11561 and 11562 constitutes the refereed proceedings of the 31st International Conference on Computer Aided Verification, CAV 2019, held in New York City, USA, in July 2019. The 52 full papers presented together with 13 tool papers and 2 case studies, were carefully reviewed and selected from 258 submissions. The papers were organized in the following topical sections: Part I: automata and timed systems; security and hyperproperties; synthesis; model checking; cyber-physical systems and machine learning; probabilistic systems, runtime techniques; dynamical, hybrid, and reactive systems; Part II: logics, decision procedures; and solvers; numerical programs; verification; distributed systems and networks; verification and invariants; and concurrency. .
650 0 _aSoftware engineering.
650 0 _aComputer logic.
650 0 _aMathematical logic.
650 0 _aComputer system failures.
650 0 _aComputers.
650 0 _aArtificial intelligence.
650 1 4 _aSoftware Engineering.
_0http://scigraph.springernature.com/things/product-market-codes/I14029
650 2 4 _aLogics and Meanings of Programs.
_0http://scigraph.springernature.com/things/product-market-codes/I1603X
650 2 4 _aMathematical Logic and Formal Languages.
_0http://scigraph.springernature.com/things/product-market-codes/I16048
650 2 4 _aSystem Performance and Evaluation.
_0http://scigraph.springernature.com/things/product-market-codes/I13049
650 2 4 _aThe Computing Profession.
_0http://scigraph.springernature.com/things/product-market-codes/I24075
650 2 4 _aLogic in AI.
_0http://scigraph.springernature.com/things/product-market-codes/I21020
700 1 _aDillig, Isil.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aTasiran, Serdar.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783030255428
776 0 8 _iPrinted edition:
_z9783030255442
830 0 _aTheoretical Computer Science and General Issues ;
_v11562
856 4 0 _uhttps://doi.org/10.1007/978-3-030-25543-5
912 _aZDB-2-SCS
912 _aZDB-2-LNC
912 _aZDB-2-SOB
999 _c524201
_d524199