Cantitate/Preț
Produs

Numerical Software Verification: 12th International Workshop, NSV 2019, New York City, NY, USA, July 13–14, 2019, Proceedings: Lecture Notes in Computer Science, cartea 11652

Editat de Majid Zamani, Damien Zufferey
en Limba Engleză Paperback – 3 aug 2019
This book constitutes the proceedings of the 12th International Workshop on Numerical Software Verification, NSV 2019, held in New York City, NY, USA, in July 2019 - colocated with the International Conference on Computer Aided Verification, CAV 2019.
The 5 full papers presented together with 2 short papers, 3 abstracts of invited talks, and 2 tutorial papers were carefully reviewed and selected from numerous submissions.
The NSV 2017 workshop is dedicated to the development of logical and mathematical techniques for the reasoning about programmability and reliability.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 31940 lei

Preț vechi: 39925 lei
-20% Nou

Puncte Express: 479

Preț estimativ în valută:
6113 6349$ 5077£

Carte tipărită la comandă

Livrare economică 03-17 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783030284220
ISBN-10: 3030284220
Pagini: 135
Ilustrații: XV, 145 p. 68 illus., 42 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.24 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

Tutorials.- Correctness and Optimality for Control Systems.- Modeling, Control, and Verification of an Automated Transport System.- Formal Methods for Highly Automated Driving Applications.- Trust, Resilience and Interpretability of AI Models.- Reinforcement Learning and Formal Requirements.- Contributed Papers.- An Evaluation of Monte-Carlo Tree Search for Property Falsification on Hybrid Flight Control Laws.- Rigorous Continuous Evolution of Uncertain Systems.- Stochastic Local Search for Solving Floating-Point Constraints.- Evaluating Branching Heuristics in Interval Constraint Propagation for Satisfiability.- Approximate Probabilistic Relations for Compositional Abstractions of Stochastic Systems.- Polytopic Trees for Verification of Learning-Based Controllers.- Mutant Accuracy Testing for Assessing the Implementation of Numerical Algorithms.