東華大學圖書館 |

Automated technology for verification and analysis = 20th International Symposium, ATVA 2022, Beijing, China, October 25-28, 2022 : proceedings /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Automated technology for verification and analysis/ edited by Ahmed Bouajjani, Lukas Holík, Zhilin Wu.
Reminder of title:	20th International Symposium, ATVA 2022, Beijing, China, October 25-28, 2022 : proceedings /
remainder title:	ATVA 2022
other author:	Bouajjani, Ahmed.
corporate name:	ATVA (Symposium)
Published:	Cham :Springer International Publishing : : 2022.,
Description:	xxiii, 432 p. :ill. (some col.), digital ;24 cm.
[NT 15003449]:	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.
Contained By:	Springer Nature eBook
Subject:	Automatic theorem proving - Congresses. -
Online resource:	https://doi.org/10.1007/978-3-031-19992-9
ISBN:	9783031199929

Automated technology for verification and analysis = 20th International Symposium, ATVA 2022, Beijing, China, October 25-28, 2022 : proceedings /
Automated technology for verification and analysis20th International Symposium, ATVA 2022, Beijing, China, October 25-28, 2022 : proceedings /[electronic resource] :ATVA 2022edited by Ahmed Bouajjani, Lukas Holík, Zhilin Wu. - Cham :Springer International Publishing :2022. - xxiii, 432 p. :ill. (some col.), digital ;24 cm. - Lecture notes in computer science,135050302-9743 ;. - Lecture notes in computer science ;13505..

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.

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.

ISBN: 9783031199929

Standard No.: 10.1007/978-3-031-19992-9doiSubjects--Topical Terms:

622584
Automatic theorem proving
--Congresses.

LC Class. No.: QA76.9.A96 / A78 2022

Dewey Class. No.: 004.015113

Automated technology for verification and analysis = 20th International Symposium, ATVA 2022, Beijing, China, October 25-28, 2022 : proceedings /
LDR:04119nmm a2200349 a 4500 001 2304779
003 DE-He213
005 20221022103409.0
006 m d
007 cr nn 008maaau
008 230409s2022 sz s 0 eng d
020 $a 9783031199929 $q (electronic bk.)
020 $a 9783031199912 $q (paper)
024 7 $a 10.1007/978-3-031-19992-9 $2 doi
035 $a 978-3-031-19992-9
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.A96 $b A78 2022
072 7 $a UMZ $2 bicssc
072 7 $a COM051230 $2 bisacsh
072 7 $a UMZ $2 thema
082 0 4 $a 004.015113 $2 23
090 $a QA76.9.A96 $b A886 2022
111 2 $a ATVA (Symposium) $n (20th : $d 2022 : $c Beijing, China) $3 3607280
245 1 0 $a Automated technology for verification and analysis $h [electronic resource] : $b 20th International Symposium, ATVA 2022, Beijing, China, October 25-28, 2022 : proceedings / $c edited by Ahmed Bouajjani, Lukas Holík, Zhilin Wu.
246 3 $a ATVA 2022
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2022.
300 $a xxiii, 432 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 13505
505 0 $a 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.
520 $a 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.
650 0 $a Automatic theorem proving $v Congresses. $3 622584
650 1 4 $a Software Engineering. $3 890874
650 2 4 $a Computer Engineering and Networks. $3 3538504
650 2 4 $a Computer Hardware. $3 892776
650 2 4 $a Theory of Computation. $3 892514
650 2 4 $a Artificial Intelligence. $3 769149
700 1 $a Bouajjani, Ahmed. $3 1244197
700 1 $a Holík, Lukas. $3 3607281
700 1 $a Wu, Zhilin. $3 1275193
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 13505. $3 3607282
856 4 0 $u https://doi.org/10.1007/978-3-031-19992-9
950 $a Computer Science (SpringerNature-11645)