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

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

Editat de Isil Dillig, Serdar Tasiran
en Limba Engleză Paperback – 13 iul 2019
This 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ț: 36986 lei

Preț vechi: 46233 lei
-20%

Puncte Express: 555
Preț estimativ în valută:
6540€ • 74100$ • 5652£

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: 9783030255398
ISBN-10: 3030255395
Pagini: 696
Ilustrații: XIX, 673 p. 1003 illus., 106 illus. in color.
Dimensiuni: 155 x 235 x 38 mm
Greutate: 1.04 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

Automata and Timed Systems.- Symbolic Register Automata.- Abstraction Refinement Algorithms for Timed Automata.- Fast Algorithms for Handling Diagonal Constraints in Timed Automata.- Safety and co-safety comparator automata for discounted-sum inclusion.- Clock Bound Repair for Timed Systems.- Verifying Asynchronous Interactions via Communicating Session Automata.- Security and Hyperproperties.- Verifying Hyperliveness.- Quantitative Mitigation of Timing Side Channels.- Property Directed Self Composition.- Security-Aware Synthesis Using Delayed-Action Games.- Automated Hypersafety Verification.- Automated Synthesis of Secure Platform Mappings.- Synthesis.- Synthesizing Approximate Implementations for Unrealizable Specifications.- Quantified Invariants via Syntax-Guided Synthesis.- Efficient Synthesis with Probabilistic Constraints.- Membership-based Synthesis of Linear Hybrid Automata.- Overfitting in Synthesis: Theory and Practice.- Proving Unrealizability for Syntax-Guided Synthesis.- Model Checking.- BMC for Weak Memory Models: Relation Analysis for Compact SMT Encodings.- When Human Intuition Fails: Using Formal Methods to Find an Error in the "Proof" of a Multi-Agent Protocol.- Extending NUXMV with Timed Transition Systems and Timed Temporal Properties.- Cerberus-BMC: a Principled Reference Semantics and Exploration Tool for Concurrent and Sequential C.- Cyber-physical Systems and Machine Learning.- Multi-Armed Bandits for Boolean Connectives in Hybrid System Falsification.- StreamLAB: Stream-based Monitoring of Cyber-Physical Systems.- VerifAI: A Toolkit for the Formal Design and Analysis of Artificial Intelligence-Based Systems.- The Marabou Framework for Verification and Analysis of Deep Neural Networks.- Probabilistic Systems, Runtime Techniques.- Probabilistic Bisimulation for Parameterized Systems.- Semi-Quantitative Abstraction and Analysis of Chemical Reaction Networks.- PAC Statistical Model Checking for Markov Decision Processes and Stochastic Games.- Symbolic Monitoring against Specifications Parametric in Time and Data.- STAMINA: STochastic Approximate Model-checker for INfinite-state Analysis.- Dynamical, Hybrid, and Reactive Systems.- Local and Compositional Reasoning For Optimized Reactive Systems.- Robust Controller Synthesis in Timed Büchi Automata: A Symbolic Approach.- Flexible Computational Pipelines for Robust Abstraction-based Control Synthesis.- Temporal Stream Logic: Synthesis beyond the Bools.- Run-Time Optimization for Learned Controllers through Quantitative Games.- Taming Delays in Dynamical Systems: Unbounded Verification of Delay Differential Equations.