LEADER 05222nam 22007095 450 001 996464385403316 005 20230329192850.0 010 $a3-030-72016-0 024 7 $a10.1007/978-3-030-72016-2 035 $a(CKB)4100000011801790 035 $a(MiAaPQ)EBC6523259 035 $a(Au-PeEL)EBL6523259 035 $a(OCoLC)1244539366 035 $a(oapen)https://directory.doabooks.org/handle/20.500.12854/67926 035 $a(DE-He213)978-3-030-72016-2 035 $a(PPN)254719201 035 $a(EXLCZ)994100000011801790 100 $a20210319d2021 u| 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aTools and Algorithms for the Construction and Analysis of Systems$b[electronic resource] $e27th 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 /$fedited by Jan Friso Groote, Kim Guldstrand Larsen 205 $a1st ed. 2021. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2021. 215 $a1 online resource (483 pages) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v12651 311 $a3-030-72015-2 327 $aGame 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. . 330 $aThis 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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v12651 606 $aComputer science 606 $aComputer engineering 606 $aComputer networks 606 $aMicroprogramming 606 $aLogic programming 606 $aTheory of Computation 606 $aComputer Engineering and Networks 606 $aControl Structures and Microprogramming 606 $aLogic in AI 606 $aComputer Engineering and Networks 615 0$aComputer science. 615 0$aComputer engineering. 615 0$aComputer networks. 615 0$aMicroprogramming. 615 0$aLogic programming. 615 14$aTheory of Computation. 615 24$aComputer Engineering and Networks. 615 24$aControl Structures and Microprogramming. 615 24$aLogic in AI. 615 24$aComputer Engineering and Networks. 676 $a004.0151 700 $aGroote$b Jan Friso$0846119 701 $aLarsen$b Kim Guldstrand$0846120 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996464385403316 996 $aTools and Algorithms for the Construction and Analysis of Systems$91890034 997 $aUNISA LEADER 00778nam0-2200265 --450 001 9910986986103321 005 20250401173645.0 100 $a20250401d1916----kmuy0itay5050 ba 101 0 $aeng 102 $aJP 105 $a 001yy 200 1 $a<> list of the number of chromosomes$fby Mitsuharu Ishikawa 210 $aTokyo$c[s. n.]$d1916 215 $a[404]-448 p.$d26 cm 300 $aEstratto da: The botanical magazine. Tokyo v. 30. n. 360 610 0 $aCromosomi 676 $a574.8$v17$zita 700 1$aIshikawa,$bMitsuharu$01800230 801 0$aIT$bUNINA$gREICAT$2UNIMARC 901 $aBK 912 $a9910986986103321 952 $aA BOT 918$b03/2598/25$fFAGBC 959 $aFAGBC 996 $aList of the number of chromosomes$94344888 997 $aUNINA