Cantitate/Preț
Produs
Total produse
Vezi coșul
Computer Aided Verification: 33rd International Conference, CAV 2021, Virtual Event, July 20–23, 2021, Proceedings, Part I de Alexandra Silva

Computer Aided Verification: 33rd International Conference, CAV 2021, Virtual Event, July 20–23, 2021, Proceedings, Part I: Lecture Notes in Computer Science, cartea 12759

Editat de Alexandra Silva, K. Rustan M. Leino
en Limba Engleză Paperback – 18 iul 2021
This open access two-volume set LNCS 12759 and 12760 constitutes the refereed proceedings of the 33rd International Conference on Computer Aided Verification, CAV 2021, held virtually in July 2021.
The 63 full papers presented together with 16 tool papers and 5 invited papers were carefully reviewed and selected from 290 submissions. The papers were organized in the following topical sections:
Part I: invited papers; AI verification; concurrency and blockchain; hybrid and cyber-physical systems; security; and synthesis.
Part II: complexity and termination; decision procedures and solvers; hardware and model checking; logical foundations; and software verification.
This is an open access book.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (2) 32916 lei  6-8 săpt.
  Springer International Publishing – 18 iul 2021 32916 lei  6-8 săpt.
  Springer International Publishing – 17 iul 2021 33014 lei  6-8 săpt.

Din seria Lecture Notes in Computer Science

Preț: 32916 lei

Preț vechi: 41145 lei
-20% Nou

Puncte Express: 494
Preț estimativ în valută:
6301€ • 6550$ • 5225£

Carte tipărită la comandă

Livrare economică 05-19 februarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783030816841
ISBN-10: 3030816842
Pagini: 922
Ilustrații: XXIV, 922 p. 287 illus., 171 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 1.3 kg
Ediția:1st ed. 2021
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Cham, Switzerland

Cuprins

Invited Papers.- NNrepair: Constraint-based Repair of Neural Network Classifiers.- Balancing automation and control for formal verification of microprocessors.- Algebraic Program Analysis.- Programmable Program Synthesis.- Deductive Synthesis of Programs with Pointers: Techniques, Challenges, Opportunities.- AI Verification.- DNNV: A Framework for Deep Neural Network Verification.- Robustness Verification of Quantum Classifiers.- BDD4BNN: A BDD-based Quantitative Analysis Framework for Binarized Neural Networks.- Automated Safety Verification of Programs Invoking Neural Networks.- Scalable Polyhedral Verification of Recurrent Neural Networks.- Verisig 2.0: Verification of Neural Network Controllers Using Taylor Model Preconditioning.- Robustness Verification of Semantic Segmentation Neural Networks using Relaxed Reachability.- PEREGRiNN: Penalized-Relaxation Greedy Neural Network Verifier.- Concurrency and Blockchain.- Isla: Integrating full-scale ISA semantics andaxiomatic concurrency models.- Summing Up Smart Transitions.- Stateless Model Checking under a Reads-Value-From Equivalence.- Gobra: Modular Specification and Verification of Go Programs.- Delay-Bounded Scheduling Without Delay!.- Checking Data-Race Freedom of GPU Kernels, Compositionally.- GenMC: A Model Checker for Weak Memory Models.- Hybrid and Cyber-Physical Systems.- Synthesizing Invariant Barrier Certificates via Difference-of-Convex Programming.- An Iterative Scheme of Safe Reinforcement Learning for Nonlinear Systems via Barrier Certificate Generation.- HybridSynchAADL: Modeling and Formal Analysis of Virtually Synchronous CPSs in AADL.- Computing Bottom SCCs Symbolically Using Transition Guided Reduction.- Implicit Semi-Algebraic Abstraction for Polynomial Dynamical Systems.- IMITATOR 3: Synthesis of timing parameters beyond decidability.- Formally Verified Switching Logic for Recoverability of Aircraft Controller.- SceneChecker: Boosting Scenario Verification using Symmetry Abstractions.- Effective Hybrid System Falsification Using Monte Carlo Tree Search Guided by QB-Robustness.- Fast zone-based algorithms for reachability in pushdown timed automata.- Security.- Verified Cryptographic Code for Everybody.- Not All Bugs Are Created Equal, But Robust Reachability Can Tell The Difference.- A Temporal Logic for Asynchronous Hyperproperties.- Product Programs in the Wild: Retrofitting Program Verifiers to Check Information Flow Security.- Constraint-based Relational Verification.- Pre-Deployment Security Assessment for Cloud Services through Semantic Reasoning.- Synthesis.- Synthesis with Asymptotic Resource Bounds.- Program Sketching by Automatically Generating Mocks from Tests.- Counterexample-Guided Partial Bounding for Recursive Function Synthesis.- PAYNT: A Tool for Inductive Synthesis of Probabilistic Programs.- Adapting Behaviors via Reactive Synthesis.- Causality-based Game Solving.

Textul de pe ultima copertă

This open access two-volume set LNCS 12759 and 12760 constitutes the refereed proceedings of the 33rd International Conference on Computer Aided Verification, CAV 2021, held virtually in July 2021.
The 63 full papers presented together with 16 tool papers and 5 invited papers were carefully reviewed and selected from 290 submissions. The papers were organized in the following topical sections:
Part I: invited papers; AI verification; concurrency and blockchain; hybrid and cyber-physical systems; security; and synthesis.
Part II: complexity and termination; decision procedures and solvers; hardware and model checking; logical foundations; and software verification.
This is an open access book.

Caracteristici

This book is open access, which means that you have free and unlimited access