國立虎尾科技大學 |

Automated Technology for Verification and Analysis = 20th International Symposium, ATVA 2022, Virtual Event, October 25–28, 2022, Proceedings /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Automated Technology for Verification and Analysis/ edited by Ahmed Bouajjani, Lukáš Holík, Zhilin Wu.
Reminder of title:	20th International Symposium, ATVA 2022, Virtual Event, October 25–28, 2022, Proceedings /
other author:	Bouajjani, Ahmed.
Description:	XXIII, 432 p. 94 illus., 64 illus. in color.online resource. :
Contained By:	Springer Nature eBook
Subject:	Software engineering. -
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, Virtual Event, October 25–28, 2022, Proceedings /
Automated Technology for Verification and Analysis20th International Symposium, ATVA 2022, Virtual Event, October 25–28, 2022, Proceedings /[electronic resource] :edited by Ahmed Bouajjani, Lukáš Holík, Zhilin Wu. - 1st ed. 2022. - XXIII, 432 p. 94 illus., 64 illus. in color.online resource. - Lecture Notes in Computer Science,135051611-3349 ;. - Lecture Notes in Computer Science,9324.

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:

562952
Software engineering.

LC Class. No.: QA76.758

Dewey Class. No.: 005.1

Automated Technology for Verification and Analysis = 20th International Symposium, ATVA 2022, Virtual Event, October 25–28, 2022, Proceedings /
LDR:04420nam a22004095i 4500 001 1084644
003 DE-He213
005 20221022103409.0
007 cr nn 008mamaa
008 221228s2022 sz | s |||| 0|eng d
020 $a 9783031199929 $9 978-3-031-19992-9
024 7 $a 10.1007/978-3-031-19992-9 $2 doi
035 $a 978-3-031-19992-9
050 4 $a QA76.758
072 7 $a UMZ $2 bicssc
072 7 $a COM051230 $2 bisacsh
072 7 $a UMZ $2 thema
082 0 4 $a 005.1 $2 23
245 1 0 $a Automated Technology for Verification and Analysis $h [electronic resource] : $b 20th International Symposium, ATVA 2022, Virtual Event, October 25–28, 2022, Proceedings / $c edited by Ahmed Bouajjani, Lukáš Holík, Zhilin Wu.
250 $a 1st ed. 2022.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2022.
300 $a XXIII, 432 p. 94 illus., 64 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Lecture Notes in Computer Science, $x 1611-3349 ; $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 Software engineering. $3 562952
650 0 $a Computer engineering. $3 569006
650 0 $a Computer networks . $3 1365720
650 0 $a Computers. $3 565115
650 0 $a Computer science. $3 573171
650 0 $a Artificial intelligence. $3 559380
650 1 4 $a Software Engineering. $3 669632
650 2 4 $a Computer Engineering and Networks. $3 1365733
650 2 4 $a Computer Hardware. $3 669779
650 2 4 $a Theory of Computation. $3 669322
650 2 4 $a Artificial Intelligence. $3 646849
700 1 $a Bouajjani, Ahmed. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1070678
700 1 $a Holík, Lukáš. $e editor. $1 https://orcid.org/0000-0001-6957-1651 $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1390991
700 1 $a Wu, Zhilin. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1390992
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783031199912
776 0 8 $i Printed edition: $z 9783031199936
830 0 $a Lecture Notes in Computer Science, $x 0302-9743 ; $v 9324 $3 1258960
856 4 0 $u https://doi.org/10.1007/978-3-031-19992-9
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)