Cantitate/Preț
Produs
Total produse
Vezi coșul
Automated Technology for Verification and Analysis de Ahmed Bouajjani

Automated Technology for Verification and Analysis: Lecture Notes in Computer Science

Editat de Ahmed Bouajjani, Luká¿ Holík, Zhilin Wu
en Limba Engleză Paperback – 23 oct 2022
This book constitutes the refereed proceedings of the 20th International Symposium on Automated Technology for Verification and Analysis, ATVA 2022, held in Beiging, China in October 2022. The symposium is dedicated to promoting research in theoretical and practical aspects of automated analysis, verification and synthesis by providing an international venue for the researchers to present new results. The 21 regular papers presented together with 5 tool papers and 1 invited paper were carefully reviewed and selected from 81 submissions. The papers are divided into the following topical sub-headings: reinforcement learning; program analysis and verification; smt and verification; automata and applications; active learning; probabilistic and stochastic systems; synthesis and repair; and verification of neural networks.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 46236 lei

Preț vechi: 57794 lei
-20%

Puncte Express: 694
Preț estimativ în valută:
8184€ • 9548$ • 7087£

Carte disponibilă

Livrare economică 05-19 februarie
Livrare express 21-27 ianuarie pentru 4213 lei

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783031199912
ISBN-10: 303119991X
Pagini: 456
Ilustrații: XXIII, 432 p. 94 illus., 64 illus. in color.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.69 kg
Ediția:1st edition 2022
Editura: Springer
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

Invited Paper.- Learning Monitorable Operational Design Domains for Assured Autonomy.- Reinforcement Learning.- Dynamic Shielding for Reinforcement Learning in Black-Box Environments.- An Impossibility Result in Automata-Theoretic Reinforcement Learning.- Reusable Contracts for Safe Integration of Reinforcement Learning in Hybrid Systems.- Program Analysis and Verification.- SISL: Concolic Testing of Structured Binary Input Formats via Partial Specification.- Fence Synthesis under the C11 Memory Model.- Checking Scheduling-induced Violations of Control Safety Properties.- Symbolic Runtime Verification for Monitoring under Uncertainties and Assumptions.- SMT and Verification.- Handling Polynomial and Transcendental Functions in SMT via Unconstrained Optimisation and Topological Degree Test.- Verification of SMT Systems with Quantifiers.- Projected Model Counting: Beyond Independent Support.- Automata and Applications.- Minimization of Automata for Liveness Languages.- Temporal Causality in Reactive Systems.- PDAAAL: A Library for Reachability Analysis of Weighted Pushdown Systems.- Active Learning.- Learning Deterministic One-Clock Timed Automata via Mutation Testing.- Active Learning of One-Clock Timed Automata using Constraint Solving.- Learning and Characterizing Fully-Ordered Lattice Automata.- Probabilistic and Stochastic Systems.- Optimistic and Topological Value Iteration for Simple Stochastic Games.- Alternating Good-for-MDPs Automata.- PET - A Partial Exploration Tool for Probabilistic Verification.- STOMPC: Stochastic Model-Predictive Control with Uppaal Stratego.- Synthesis and Repair.- Synthesis of Parametric Hybrid Automata from Time Series.- Optimal Repair For Omega-regular Properties.- Repairing Real-Time Requirements.- Verification of Neural Networks.- An Abstraction-Refinement Approach to Verifying Convolutional Neural Networks.- Prioritizing Corners in OoD Detectors via Symbolic String Manipulation.- POLAR: A Polynomial Arithmetic Framework for Verifying Neural-Network Controlled Systems.