
Numerical Software Verification
12th International Workshop, NSV 2019, New York City, NY, USA, July 13-14, 2019, Proceedings
Springer (Publisher)
Published on 3. August 2019
Book
Paperback/Softback
XV, 145 pages
978-3-030-28422-0 (ISBN)
Description
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.
More details
Series
Edition
2019 ed.
Language
English
Place of publication
Cham
Switzerland
Publishing group
Springer International Publishing
Target group
Professional and scholarly
Illustrations
42 farbige Abbildungen, 26 s/w Abbildungen
XV, 145 p. 68 illus., 42 illus. in color.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 10 mm
Weight
260 gr
ISBN-13
978-3-030-28422-0 (9783030284220)
DOI
10.1007/978-3-030-28423-7
Schweitzer Classification
Other editions
Additional editions

Majid Zamani | Damien Zufferey
Numerical Software Verification
12th International Workshop, NSV 2019, New York City, NY, USA, July 13-14, 2019, Proceedings
E-Book
08/2019
Springer
€53.49
Available for download
Content
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.