國立虎尾科技大學 |

Tools and Algorithms for the Construction and Analysis of Systems = 27th International Conference, TACAS 2021, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021, Luxembourg City, Luxembourg, March 27 – April 1, 2021, Proceedings, Part I /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Tools and Algorithms for the Construction and Analysis of Systems/ edited by Jan Friso Groote, Kim Guldstrand Larsen.
其他題名:	27th International Conference, TACAS 2021, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021, Luxembourg City, Luxembourg, March 27 – April 1, 2021, Proceedings, Part I /
其他作者:	Larsen, Kim Guldstrand.
面頁冊數:	XXI, 471 p. 106 illus.online resource. :
Contained By:	Springer Nature eBook
標題:	Logic in AI. -
電子資源:	https://doi.org/10.1007/978-3-030-72016-2
ISBN:	9783030720162

Tools and Algorithms for the Construction and Analysis of Systems = 27th International Conference, TACAS 2021, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021, Luxembourg City, Luxembourg, March 27 – April 1, 2021, Proceedings, Part I /
Tools and Algorithms for the Construction and Analysis of Systems27th International Conference, TACAS 2021, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021, Luxembourg City, Luxembourg, March 27 – April 1, 2021, Proceedings, Part I /[electronic resource] :edited by Jan Friso Groote, Kim Guldstrand Larsen. - 1st ed. 2021. - XXI, 471 p. 106 illus.online resource. - Theoretical Computer Science and General Issues,126512512-2029 ;. - Theoretical Computer Science and General Issues,12865.

Game Theory -- A Game for Linear-time - Branching-time Spectroscopy -- On Satisficing in Quantitative Games -- Quasipolynomial Computation of Nested Fixpoints -- SMT Verification -- A Flexible Proof Format for SAT Solver-Elaborator Communication -- Generating Extended Resolution Proofs with a BDD-Based SAT Solver -- Bounded Model Checking for Hyperproperties -- Counterexample-Guided Prophecy for Model Checking Modulo the Theory of Arrays -- SAT Solving with GPU Accelerated Inprocessing -- FOREST: An Interactive Multi-tree Synthesizer for Regular Expressions -- Probabilities -- Finding Provably Optimal Markov Chains -- Inductive Synthesis for Probabilistic Programs Reaches New Horizons -- Analysis of Markov Jump Processes under Terminal Constraints -- Multi-objective Optimization of Long-run Average and Total Rewards -- Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes -- Probabilistic and Systematic Coverage of Consecutive Test-Method Pairs for Detecting Order-Dependent Flaky Tests -- Timed Systems -- Timed Automata Relaxation for Reachability -- Iterative Bounded Synthesis for Efficient Cycle Detection in Parametric Timed Automata -- Algebraic Quantitative Semantics for Efficient Online Temporal Monitoring -- Neural Networks -- Synthesizing Context-free Grammars from Recurrent Neural Networks -- Automated and Formal Synthesis of Neural Barrier Certificates for Dynamical Models -- Improving Neural Network Verification through Spurious Region Guided Refinement -- Analysis of Network Communication Resilient Capacity-Aware Routing -- Network Traffic Classification by Program Synthesis. .

Open Access

This open access two-volume set constitutes the proceedings of the 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2021, which was held during March 27 – April 1, 2021, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021. The conference was planned to take place in Luxembourg and changed to an online format due to the COVID-19 pandemic. The total of 41 full papers presented in the proceedings was carefully reviewed and selected from 141 submissions. The volume also contains 7 tool papers; 6 Tool Demo papers, 9 SV-Comp Competition Papers. The papers are organized in topical sections as follows: Part I: Game Theory; SMT Verification; Probabilities; Timed Systems; Neural Networks; Analysis of Network Communication. Part II: Verification Techniques (not SMT); Case Studies; Proof Generation/Validation; Tool Papers; Tool Demo Papers; SV-Comp Tool Competition Papers.

ISBN: 9783030720162

Standard No.: 10.1007/978-3-030-72016-2doiSubjects--Topical Terms:

1228083
Logic in AI.

LC Class. No.: QA75.5-76.95

Dewey Class. No.: 004.0151

Tools and Algorithms for the Construction and Analysis of Systems = 27th International Conference, TACAS 2021, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021, Luxembourg City, Luxembourg, March 27 – April 1, 2021, Proceedings, Part I /
LDR:04320nam a22004335i 4500 001 1059082
003 DE-He213
005 20220223153759.0
007 cr nn 008mamaa
008 220414s2021 sz | s |||| 0|eng d
020 $a 9783030720162 $9 978-3-030-72016-2
024 7 $a 10.1007/978-3-030-72016-2 $2 doi
035 $a 978-3-030-72016-2
050 4 $a QA75.5-76.95
072 7 $a UYA $2 bicssc
072 7 $a COM014000 $2 bisacsh
072 7 $a UYA $2 thema
082 0 4 $a 004.0151 $2 23
245 1 0 $a Tools and Algorithms for the Construction and Analysis of Systems $h [electronic resource] : $b 27th International Conference, TACAS 2021, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021, Luxembourg City, Luxembourg, March 27 – April 1, 2021, Proceedings, Part I / $c edited by Jan Friso Groote, Kim Guldstrand Larsen.
250 $a 1st ed. 2021.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a XXI, 471 p. 106 illus. $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, $x 2512-2029 ; $v 12651
505 0 $a Game Theory -- A Game for Linear-time - Branching-time Spectroscopy -- On Satisficing in Quantitative Games -- Quasipolynomial Computation of Nested Fixpoints -- SMT Verification -- A Flexible Proof Format for SAT Solver-Elaborator Communication -- Generating Extended Resolution Proofs with a BDD-Based SAT Solver -- Bounded Model Checking for Hyperproperties -- Counterexample-Guided Prophecy for Model Checking Modulo the Theory of Arrays -- SAT Solving with GPU Accelerated Inprocessing -- FOREST: An Interactive Multi-tree Synthesizer for Regular Expressions -- Probabilities -- Finding Provably Optimal Markov Chains -- Inductive Synthesis for Probabilistic Programs Reaches New Horizons -- Analysis of Markov Jump Processes under Terminal Constraints -- Multi-objective Optimization of Long-run Average and Total Rewards -- Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes -- Probabilistic and Systematic Coverage of Consecutive Test-Method Pairs for Detecting Order-Dependent Flaky Tests -- Timed Systems -- Timed Automata Relaxation for Reachability -- Iterative Bounded Synthesis for Efficient Cycle Detection in Parametric Timed Automata -- Algebraic Quantitative Semantics for Efficient Online Temporal Monitoring -- Neural Networks -- Synthesizing Context-free Grammars from Recurrent Neural Networks -- Automated and Formal Synthesis of Neural Barrier Certificates for Dynamical Models -- Improving Neural Network Verification through Spurious Region Guided Refinement -- Analysis of Network Communication Resilient Capacity-Aware Routing -- Network Traffic Classification by Program Synthesis. .
506 0 $a Open Access
520 $a This open access two-volume set constitutes the proceedings of the 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2021, which was held during March 27 – April 1, 2021, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021. The conference was planned to take place in Luxembourg and changed to an online format due to the COVID-19 pandemic. The total of 41 full papers presented in the proceedings was carefully reviewed and selected from 141 submissions. The volume also contains 7 tool papers; 6 Tool Demo papers, 9 SV-Comp Competition Papers. The papers are organized in topical sections as follows: Part I: Game Theory; SMT Verification; Probabilities; Timed Systems; Neural Networks; Analysis of Network Communication. Part II: Verification Techniques (not SMT); Case Studies; Proof Generation/Validation; Tool Papers; Tool Demo Papers; SV-Comp Tool Competition Papers.
650 2 4 $a Logic in AI. $3 1228083
650 2 4 $a Control Structures and Microprogramming. $3 669788
650 2 4 $a Computer Engineering and Networks. $3 1365733
650 1 4 $a Theory of Computation. $3 669322
650 0 $a Logic programming. $3 670217
650 0 $a Microprogramming . $3 1257366
650 0 $a Computer networks . $3 1365720
650 0 $a Computer engineering. $3 569006
650 0 $a Computer science. $3 573171
700 1 $a Larsen, Kim Guldstrand. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1065020
700 1 $a Groote, Jan Friso. $e author. $0 (orcid)0000-0003-2196-6587 $1 https://orcid.org/0000-0003-2196-6587 $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1349846
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030720155
776 0 8 $i Printed edition: $z 9783030720179
830 0 $a Theoretical Computer Science and General Issues, $x 2512-2029 ; $v 12865 $3 1365719
856 4 0 $u https://doi.org/10.1007/978-3-030-72016-2
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)