Muutke küpsiste eelistusi

Computer Aided Verification: 31st International Conference, CAV 2019, New York City, NY, USA, July 15-18, 2019, Proceedings, Part II 2019 ed. [Pehme köide]

Edited by , Edited by
  • Formaat: Paperback / softback, 549 pages, kõrgus x laius: 235x155 mm, kaal: 866 g, 42 Illustrations, color; 1167 Illustrations, black and white; XX, 549 p. 1209 illus., 42 illus. in color., 1 Paperback / softback
  • Sari: Lecture Notes in Computer Science 11562
  • Ilmumisaeg: 13-Jul-2019
  • Kirjastus: Springer Nature Switzerland AG
  • ISBN-10: 3030255425
  • ISBN-13: 9783030255428
Teised raamatud teemal:
  • Pehme köide
  • Hind: 48,70 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Tavahind: 57,29 €
  • Säästad 15%
  • Raamatu kohalejõudmiseks kirjastusest kulub orienteeruvalt 2-4 nädalat
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Tellimisaeg 2-4 nädalat
  • Lisa soovinimekirja
Computer Aided Verification: 31st International Conference, CAV 2019, New York City, NY, USA, July 15-18, 2019, Proceedings, Part II 2019 ed.Suurem pilt
  • Formaat: Paperback / softback, 549 pages, kõrgus x laius: 235x155 mm, kaal: 866 g, 42 Illustrations, color; 1167 Illustrations, black and white; XX, 549 p. 1209 illus., 42 illus. in color., 1 Paperback / softback
  • Sari: Lecture Notes in Computer Science 11562
  • Ilmumisaeg: 13-Jul-2019
  • Kirjastus: Springer Nature Switzerland AG
  • ISBN-10: 3030255425
  • ISBN-13: 9783030255428
Teised raamatud teemal:
Püsilink: https://www.kriso.ee/db/9783030255428.html
Märksõnad:

The 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. 

Logics, 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.