Computer Aided Verification: 31st International Conference, CAV 2019, New York City, NY, USA, July 15-18, 2019, Proceedings, Part I: Lecture Notes in Computer Science, cartea 11561
Editat de Isil Dillig, Serdar Tasiranen Limba Engleză Paperback – 13 iul 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.
| Toate formatele și edițiile | Preț | Express |
|---|---|---|
| Paperback (4) | 345.28 lei 6-8 săpt. | |
| Saint Philip Street Press – 7 oct 2020 | 345.28 lei 6-8 săpt. | |
| Springer International Publishing – 13 iul 2019 | 360.08 lei 6-8 săpt. | |
| Springer International Publishing – 13 iul 2019 | 365.94 lei 6-8 săpt. | |
| Saint Philip Street Press – 7 oct 2020 | 379.22 lei 6-8 săpt. | |
| Hardback (2) | 413.74 lei 6-8 săpt. | |
| Saint Philip Street Press – 7 oct 2020 | 413.74 lei 6-8 săpt. | |
| Saint Philip Street Press – 7 oct 2020 | 442.87 lei 6-8 săpt. |
Din seria Lecture Notes in Computer Science
- 20%
Preț: 323.14 lei - 20%
Preț: 461.32 lei - 20%
Preț: 460.98 lei - 20%
Preț: 390.41 lei - 20%
Preț: 526.98 lei - 15%
Preț: 388.21 lei - 20%
Preț: 461.21 lei - 20%
Preț: 390.08 lei - 20%
Preț: 496.30 lei - 20%
Preț: 461.21 lei - 20%
Preț: 389.45 lei - 15%
Preț: 461.53 lei - 20%
Preț: 389.63 lei - 20%
Preț: 496.68 lei - 20%
Preț: 461.70 lei - 20%
Preț: 251.97 lei - 20%
Preț: 390.86 lei - 20%
Preț: 532.16 lei - 20%
Preț: 461.52 lei - 20%
Preț: 255.72 lei - 20%
Preț: 498.10 lei - 20%
Preț: 497.19 lei - 20%
Preț: 499.02 lei - 20%
Preț: 389.82 lei - 20%
Preț: 390.92 lei - 20%
Preț: 390.86 lei - 20%
Preț: 390.92 lei - 20%
Preț: 390.08 lei - 20%
Preț: 461.45 lei - 20%
Preț: 392.36 lei - 20%
Preț: 460.75 lei - 20%
Preț: 461.32 lei - 20%
Preț: 389.90 lei - 20%
Preț: 639.26 lei - 20%
Preț: 390.66 lei - 20%
Preț: 391.57 lei - 20%
Preț: 389.57 lei - 20%
Preț: 497.97 lei - 20%
Preț: 462.36 lei - 20%
Preț: 460.67 lei - 20%
Preț: 423.95 lei - 5%
Preț: 515.91 lei - 15%
Preț: 535.55 lei - 20%
Preț: 531.90 lei - 20%
Preț: 403.00 lei - 20%
Preț: 535.41 lei - 20%
Preț: 461.25 lei - 20%
Preț: 498.17 lei - 20%
Preț: 461.52 lei - 20%
Preț: 249.77 lei
Preț: 365.94 lei
Preț vechi: 457.43 lei
-20%
Puncte Express: 549
Preț estimativ în valută:
64.77€ • 75.68$ • 56.22£
64.77€ • 75.68$ • 56.22£
Carte tipărită la comandă
Livrare economică 25 februarie-11 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783030255398
ISBN-10: 3030255395
Pagini: 673
Ilustrații: XIX, 673 p. 1003 illus., 106 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.96 kg
Ediția:1st ed. 2019
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Cham, Switzerland
ISBN-10: 3030255395
Pagini: 673
Ilustrații: XIX, 673 p. 1003 illus., 106 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.96 kg
Ediția:1st ed. 2019
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
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.