Cantitate/Preț
Produs
Total produse
Vezi coșul
Computer Aided Verification de Isil Dillig

Computer Aided Verification: Lecture Notes in Computer Science, cartea 11562

Editat de Isil Dillig, Serdar Tasiran
en Limba Engleză Paperback – 13 iul 2019
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. 
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (4) 34528 lei  6-8 săpt.
  Saint Philip Street Press – 7 oct 2020 34528 lei  6-8 săpt.
  Springer – 13 iul 2019 36353 lei  6-8 săpt.
  Springer – 13 iul 2019 36986 lei  6-8 săpt.
  Saint Philip Street Press – 7 oct 2020 37922 lei  6-8 săpt.
Hardback (2) 41374 lei  6-8 săpt.
  Saint Philip Street Press – 7 oct 2020 41374 lei  6-8 săpt.
  Saint Philip Street Press – 7 oct 2020 44287 lei  6-8 săpt.

Din seria Lecture Notes in Computer Science

Preț: 36353 lei

Preț vechi: 45440 lei
-20%

Puncte Express: 545
Preț estimativ în valută:
6428€ • 7371$ • 5556£

Carte tipărită la comandă

Livrare economică 27 aprilie-11 mai

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

Specificații

ISBN-13: 9783030255428
ISBN-10: 3030255425
Pagini: 572
Ilustrații: XX, 549 p. 1209 illus., 42 illus. in color.
Dimensiuni: 155 x 235 x 31 mm
Greutate: 0.86 kg
Ediția:1st ed. 2019
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

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.