國立虎尾科技大學 |

Computer Aided Verification = 31st International Conference, CAV 2019, New York City, NY, USA, July 15-18, 2019, Proceedings, Part I /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Computer Aided Verification/ edited by Isil Dillig, Serdar Tasiran.
其他題名:	31st International Conference, CAV 2019, New York City, NY, USA, July 15-18, 2019, Proceedings, Part I /
其他作者:	Dillig, Isil.
面頁冊數:	XIX, 673 p. 1003 illus., 106 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Software engineering. -
電子資源:	https://doi.org/10.1007/978-3-030-25540-4
ISBN:	9783030255404

Computer Aided Verification = 31st International Conference, CAV 2019, New York City, NY, USA, July 15-18, 2019, Proceedings, Part I /
Computer Aided Verification31st International Conference, CAV 2019, New York City, NY, USA, July 15-18, 2019, Proceedings, Part I /[electronic resource] :edited by Isil Dillig, Serdar Tasiran. - 1st ed. 2019. - XIX, 673 p. 1003 illus., 106 illus. in color.online resource. - Theoretical Computer Science and General Issues ;11561. - Theoretical Computer Science and General Issues ;9163.

Automata and Timed Systems -- Symbolic Register Automata -- Abstraction Refinement Algorithms for Timed Automata -- Fast Algorithms for Handling Diagonal Constraints in Timed Automata -- Safety and co-safety comparator automata for discounted-sum inclusion -- Clock Bound Repair for Timed Systems -- Verifying Asynchronous Interactions via Communicating Session Automata -- Security and Hyperproperties -- Verifying Hyperliveness -- Quantitative Mitigation of Timing Side Channels -- Property Directed Self Composition -- Security-Aware Synthesis Using Delayed-Action Games -- Automated Hypersafety Verification -- Automated Synthesis of Secure Platform Mappings -- Synthesis -- Synthesizing Approximate Implementations for Unrealizable Specifications -- Quantified Invariants via Syntax-Guided Synthesis -- Efficient Synthesis with Probabilistic Constraints -- Membership-based Synthesis of Linear Hybrid Automata -- Overfitting in Synthesis: Theory and Practice -- Proving Unrealizability for Syntax-Guided Synthesis -- Model Checking -- BMC for Weak Memory Models: Relation Analysis for Compact SMT Encodings -- When Human Intuition Fails: Using Formal Methods to Find an Error in the "Proof" of a Multi-Agent Protocol -- Extending NUXMV with Timed Transition Systems and Timed Temporal Properties -- Cerberus-BMC: a Principled Reference Semantics and Exploration Tool for Concurrent and Sequential C -- Cyber-physical Systems and Machine Learning -- Multi-Armed Bandits for Boolean Connectives in Hybrid System Falsification -- StreamLAB: Stream-based Monitoring of Cyber-Physical Systems -- VerifAI: A Toolkit for the Formal Design and Analysis of Artificial Intelligence-Based Systems -- The Marabou Framework for Verification and Analysis of Deep Neural Networks -- Probabilistic Systems, Runtime Techniques -- Probabilistic Bisimulation for Parameterized Systems -- Semi-Quantitative Abstraction and Analysis of Chemical Reaction Networks -- PAC Statistical Model Checking for Markov Decision Processes and Stochastic Games -- Symbolic Monitoring against Specifications Parametric in Time and Data -- STAMINA: STochastic Approximate Model-checker for INfinite-state Analysis -- Dynamical, Hybrid, and Reactive Systems -- Local and Compositional Reasoning For Optimized Reactive Systems -- Robust Controller Synthesis in Timed Büchi Automata: A Symbolic Approach -- Flexible Computational Pipelines for Robust Abstraction-based Control Synthesis -- Temporal Stream Logic: Synthesis beyond the Bools -- Run-Time Optimization for Learned Controllers through Quantitative Games -- Taming Delays in Dynamical Systems: Unbounded Verification of Delay Differential Equations.

Open Access

This open access two-volume set LNCS 11561 and 11562 constitutes the refereed proceedings of the 31st International Conference on Computer Aided Verification, CAV 2019, held in New York City, USA, in July 2019. The 52 full papers presented together with 13 tool papers and 2 case studies, were carefully reviewed and selected from 258 submissions. The papers were organized in the following topical sections: Part I: automata and timed systems; security and hyperproperties; synthesis; model checking; cyber-physical systems and machine learning; probabilistic systems, runtime techniques; dynamical, hybrid, and reactive systems; Part II: logics, decision procedures; and solvers; numerical programs; verification; distributed systems and networks; verification and invariants; and concurrency. .

ISBN: 9783030255404

Standard No.: 10.1007/978-3-030-25540-4doiSubjects--Topical Terms:

562952
Software engineering.

LC Class. No.: QA76.758

Dewey Class. No.: 005.1

Computer Aided Verification = 31st International Conference, CAV 2019, New York City, NY, USA, July 15-18, 2019, Proceedings, Part I /
LDR:05022nam a22004335i 4500 001 1008056
003 DE-He213
005 20200629193128.0
007 cr nn 008mamaa
008 210106s2019 gw | s |||| 0|eng d
020 $a 9783030255404 $9 978-3-030-25540-4
024 7 $a 10.1007/978-3-030-25540-4 $2 doi
035 $a 978-3-030-25540-4
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 Computer Aided Verification $h [electronic resource] : $b 31st International Conference, CAV 2019, New York City, NY, USA, July 15-18, 2019, Proceedings, Part I / $c edited by Isil Dillig, Serdar Tasiran.
250 $a 1st ed. 2019.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2019.
300 $a XIX, 673 p. 1003 illus., 106 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 Theoretical Computer Science and General Issues ; $v 11561
505 0 $a Automata and Timed Systems -- Symbolic Register Automata -- Abstraction Refinement Algorithms for Timed Automata -- Fast Algorithms for Handling Diagonal Constraints in Timed Automata -- Safety and co-safety comparator automata for discounted-sum inclusion -- Clock Bound Repair for Timed Systems -- Verifying Asynchronous Interactions via Communicating Session Automata -- Security and Hyperproperties -- Verifying Hyperliveness -- Quantitative Mitigation of Timing Side Channels -- Property Directed Self Composition -- Security-Aware Synthesis Using Delayed-Action Games -- Automated Hypersafety Verification -- Automated Synthesis of Secure Platform Mappings -- Synthesis -- Synthesizing Approximate Implementations for Unrealizable Specifications -- Quantified Invariants via Syntax-Guided Synthesis -- Efficient Synthesis with Probabilistic Constraints -- Membership-based Synthesis of Linear Hybrid Automata -- Overfitting in Synthesis: Theory and Practice -- Proving Unrealizability for Syntax-Guided Synthesis -- Model Checking -- BMC for Weak Memory Models: Relation Analysis for Compact SMT Encodings -- When Human Intuition Fails: Using Formal Methods to Find an Error in the "Proof" of a Multi-Agent Protocol -- Extending NUXMV with Timed Transition Systems and Timed Temporal Properties -- Cerberus-BMC: a Principled Reference Semantics and Exploration Tool for Concurrent and Sequential C -- Cyber-physical Systems and Machine Learning -- Multi-Armed Bandits for Boolean Connectives in Hybrid System Falsification -- StreamLAB: Stream-based Monitoring of Cyber-Physical Systems -- VerifAI: A Toolkit for the Formal Design and Analysis of Artificial Intelligence-Based Systems -- The Marabou Framework for Verification and Analysis of Deep Neural Networks -- Probabilistic Systems, Runtime Techniques -- Probabilistic Bisimulation for Parameterized Systems -- Semi-Quantitative Abstraction and Analysis of Chemical Reaction Networks -- PAC Statistical Model Checking for Markov Decision Processes and Stochastic Games -- Symbolic Monitoring against Specifications Parametric in Time and Data -- STAMINA: STochastic Approximate Model-checker for INfinite-state Analysis -- Dynamical, Hybrid, and Reactive Systems -- Local and Compositional Reasoning For Optimized Reactive Systems -- Robust Controller Synthesis in Timed Büchi Automata: A Symbolic Approach -- Flexible Computational Pipelines for Robust Abstraction-based Control Synthesis -- Temporal Stream Logic: Synthesis beyond the Bools -- Run-Time Optimization for Learned Controllers through Quantitative Games -- Taming Delays in Dynamical Systems: Unbounded Verification of Delay Differential Equations.
506 0 $a Open Access
520 $a This open access two-volume set LNCS 11561 and 11562 constitutes the refereed proceedings of the 31st International Conference on Computer Aided Verification, CAV 2019, held in New York City, USA, in July 2019. The 52 full papers presented together with 13 tool papers and 2 case studies, were carefully reviewed and selected from 258 submissions. The papers were organized in the following topical sections: Part I: automata and timed systems; security and hyperproperties; synthesis; model checking; cyber-physical systems and machine learning; probabilistic systems, runtime techniques; dynamical, hybrid, and reactive systems; Part II: logics, decision procedures; and solvers; numerical programs; verification; distributed systems and networks; verification and invariants; and concurrency. .
650 0 $a Software engineering. $3 562952
650 0 $a Programming languages (Electronic computers). $3 1127615
650 0 $a Computers. $3 565115
650 0 $a Artificial intelligence. $3 559380
650 0 $a Computer simulation. $3 560190
650 0 $a Computer organization. $3 596298
650 1 4 $a Software Engineering. $3 669632
650 2 4 $a Programming Languages, Compilers, Interpreters. $3 669782
650 2 4 $a Theory of Computation. $3 669322
650 2 4 $a Artificial Intelligence. $3 646849
650 2 4 $a Simulation and Modeling. $3 669249
650 2 4 $a Computer Systems Organization and Communication Networks. $3 669309
700 1 $a Dillig, Isil. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1229173
700 1 $a Tasiran, Serdar. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1074167
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030255398
776 0 8 $i Printed edition: $z 9783030255411
830 0 $a Theoretical Computer Science and General Issues ; $v 9163 $3 1253524
856 4 0 $u https://doi.org/10.1007/978-3-030-25540-4
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
912 $a ZDB-2-SOB
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)