Automated Technology for Verification and Analysis: 17th International Symposium, ATVA 2019, Taipei, Taiwan, October 28–31, 2019, Proceedings: Lecture Notes in Computer Science, cartea 11781
Editat de Yu-Fang Chen, Chih-Hong Cheng, Javier Esparzaen Limba Engleză Paperback – 6 oct 2019
The 24 regular papers presented together with 3 tool papers were carefully reviewed and selected from 65 submissions.
The symposium is dedicated to the promotion of research on theoretical and practical aspects of automated analysis, verification and synthesis by providing a forum for interaction between the regional and the international research communities and industry in the field. The papers focus on cyber-physical systems; runtime techniques; testing; automata; synthesis; stochastic systems and model checking.
Din seria Lecture Notes in Computer Science
- 20% Preț: 571.63 lei
- 20% Preț: 336.71 lei
- 20% Preț: 333.46 lei
- 20% Preț: 662.76 lei
- 20% Preț: 330.23 lei
- 20% Preț: 747.79 lei
- 20% Preț: 438.67 lei
- 20% Preț: 369.12 lei
- 20% Preț: 315.76 lei
- 20% Preț: 584.40 lei
- 20% Preț: 148.66 lei
- 20% Preț: 122.89 lei
- 20% Preț: 315.18 lei
- 20% Preț: 256.26 lei
- 20% Preț: 1040.03 lei
- 20% Preț: 504.56 lei
- Preț: 402.62 lei
- 20% Preț: 346.40 lei
- 20% Preț: 301.94 lei
- 20% Preț: 237.99 lei
- 5% Preț: 365.59 lei
- 20% Preț: 309.89 lei
- 20% Preț: 321.95 lei
- 20% Preț: 310.25 lei
- 20% Preț: 334.68 lei
- Preț: 373.56 lei
- 20% Preț: 172.68 lei
- 20% Preț: 1386.07 lei
- 20% Preț: 315.76 lei
- 20% Preț: 1003.66 lei
- 20% Preț: 444.17 lei
- 20% Preț: 567.60 lei
- 20% Preț: 632.22 lei
- 17% Preț: 360.18 lei
- 20% Preț: 538.28 lei
- 20% Preț: 335.08 lei
- 20% Preț: 307.68 lei
- 20% Preț: 343.16 lei
- 20% Preț: 641.78 lei
- 20% Preț: 579.56 lei
- 20% Preț: 1053.45 lei
- 15% Preț: 568.74 lei
- Preț: 389.47 lei
- 20% Preț: 333.46 lei
- 20% Preț: 607.38 lei
- 20% Preț: 326.97 lei
Preț: 338.63 lei
Preț vechi: 423.29 lei
-20% Nou
Puncte Express: 508
Preț estimativ în valută:
64.80€ • 68.43$ • 53.92£
64.80€ • 68.43$ • 53.92£
Carte tipărită la comandă
Livrare economică 13-27 ianuarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783030317836
ISBN-10: 3030317838
Pagini: 552
Ilustrații: XI, 552 p. 754 illus., 60 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.78 kg
Ediția:1st ed. 2019
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Programming and Software Engineering
Locul publicării:Cham, Switzerland
ISBN-10: 3030317838
Pagini: 552
Ilustrații: XI, 552 p. 754 illus., 60 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.78 kg
Ediția:1st ed. 2019
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Programming and Software Engineering
Locul publicării:Cham, Switzerland
Cuprins
A Note on Game Theory and Verification.- Lazy Abstraction-Based Controller Synthesis.- Truth Assignments as Conditional Autarkies.- Can We Trust Autonomous Systems? Boundaries and Risks.- Teaching Stratego to Play Ball : Optimal Synthesis for Continuous Space MDPs.- Using Symmetry Transformations in Equivariant Dynamical Systems for their Safety Verification.- Parametric Timed Model Checking for Guaranteeing Timed Opacity.- Adaptive Online First-Order Monitoring.- Multi-Head Monitoring of Metric Temporal Logic.- An Efficient Algorithm for Computing Causal Trace Sets in Causality Checking.- Conditional Testing: O -the-Shelf Combination of Test-Case Generators.- Enhancing Symbolic Execution of Heap-based Programs with Separation Logic for Test Input Generation.- BUBEN: Automated Library Abstractions Enabling Scalable Bug Detection for Large Programs with I/O and Complex Environment.- KLUZZER: Whitebox Fuzzing on top of LLVM.- Automatic Generation of Moment-Based Invariants for Prob-Solvable Loops.- Chain Free String Constraints.- Synthesizing Efficient Low-Precision Kernels.- New Optimizations and Heuristics for Determinization of Büchi Automata.- Approximate Automata for Omega-regular Languages.- DEQ : Equivalence Checker for Deterministic Register Automata.- LTL3TELA: Small Deterministic or Nondeterministic Automata from LTL.- Efficient Trace Encodings of Bounded Synthesis for Asynchronous Distributed Systems.- Reactive Synthesis of Graphical User Interface Glue Code.- Semantic Labelling and Learning for Parity Game Solving in LTL Synthesis.- Program Repair for Hyperproperties.- Generic Emptiness Check for Fun and Profit.- Deciding Fast Termination for Probabilistic VASS with Nondeterminism.- Are Parametric Markov Chains Monotonic.- Efficient Information-Flow Verification under Speculative Execution.- Model Checking Data Flows in Concurrent Network Updates.-Performance Evaluation of NDN Data Plane Using Statistical Model Checking.