LEADER 05872nam 22006975 450 001 9910484283703321 005 20230329143411.0 010 $a3-662-54580-2 024 7 $a10.1007/978-3-662-54580-5 035 $a(CKB)3710000001127408 035 $a(DE-He213)978-3-662-54580-5 035 $a(MiAaPQ)EBC5594386 035 $a(PPN)199766886 035 $a(EXLCZ)993710000001127408 100 $a20170330d2017 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aTools and Algorithms for the Construction and Analysis of Systems $e23rd International Conference, TACAS 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22-29, 2017, Proceedings, Part II /$fedited by Axel Legay, Tiziana Margaria 205 $a1st ed. 2017. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2017. 215 $a1 online resource (XXIV, 411 p. 88 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v10206 311 $a3-662-54579-9 327 $aSecurity -- Static Detection of DoS Vulnerabilities in Programs that use Regular Expressions -- Discriminating Traces with Time -- Directed Automated Memory Performance Testing -- Context-bounded Analysis for POWER -- Run-Time Verification and Logic. -Rewriting-Based Runtime Verification of Alternation-Free HyperLTL Formulas -- Almost Event-Rate Independent Monitoring of Metric Temporal Logic -- Optimal Translation of LTL to Limit Deterministic Automata -- Quantitative Systems -- Sequential Convex Programming for the Efficient Verification of Parametric MDPs -- JANI: Quantitative Model and Tool Interaction -- Computing Scores of Forwarding Schemes in Switched Networks with Probabilistic Faults -- Long-run Rewards for Markov Automata -- SAT and SMT -- HiFrog: SMT-based Function Summarization for Software Verification -- Congruence Closure with Free Variables -- On Optimization Modulo Theories, MaxSMT and Sorting Networks. - The automatic detection of token structures and invariants using SAT checking -- Maximizing the Conditional Expected Reward for Reaching the Goal. -ARES: Adaptive Receding-Horizon Synthesis of Optimal Plans. - FlyFast: A Mean Field Model Checker. -ERODE: A Tool for the Evaluation and Reduction of Ordinary Differential Equations -- SV COMP -- Software Verification with Validation of Results (Report on SV-COMP 2017) -- AProVE: Proving and Disproving Termination of Memory-Manipulating C Programs (Competition Contribution) -- CPA-BAM-BnB: Block-Abstraction Memoization and Region-based Memory Models for Predicate Abstractions (Competition Contribution) -- DepthK: A k-Induction Verifier Based on Invariant Inference for C Programs (Competition Contribution) -- Forester: From Heap Shapes to Automata Predicates (Competition Contribution) -- HipTNT+: A Termination and Non-termination Analyzer by Second-order Abduction (Competition Contribution) -- Lazy-CSeq 2.0: Combining Lazy Sequentialization with Abstract Interpretation (Competition Contribution) -- Skink: Static Analysis of LLVM Intermediate Representation (Competition contribution) -- Symbiotic 4: Beyond Reachability (Competition Contribution) -- Optimizing and Caching SMT Queries in SymDIVINE (Competition Contribution) -- Ultimate Automizer with an On-demand Construction of Floyd-Hoare Automata (Competition Contribution) -- Ultimate Taipan: Trace Abstraction and Abstract Interpretation (Competition Contribution) -- VeriAbs : Verification by Abstraction (Competition Contribution). . 330 $aThe two-book set LNCS 10205 + 10206 constitutes the proceedings of the 23rd International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2017, which took place in Uppsala, Sweden in April 2017, held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017. The 48 full papers, 4 tool demonstration papers, and 12 software competition papers presented in these volumes were carefully reviewed and selected from 181 submissions to TACAS and 32 submissions to the software competition. They were organized in topical sections named: verification techniques; learning; synthesis; automata; concurrency and bisimulation; hybrid systems; security; run-time verification and logic; quantitative systems; SAT and SMT; and SV COMP. . 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v10206 606 $aComputer science 606 $aAlgorithms 606 $aSoftware engineering 606 $aCompilers (Computer programs) 606 $aMachine theory 606 $aComputer Science Logic and Foundations of Programming 606 $aAlgorithms 606 $aSoftware Engineering 606 $aTheory of Computation 606 $aCompilers and Interpreters 606 $aFormal Languages and Automata Theory 615 0$aComputer science. 615 0$aAlgorithms. 615 0$aSoftware engineering. 615 0$aCompilers (Computer programs). 615 0$aMachine theory. 615 14$aComputer Science Logic and Foundations of Programming. 615 24$aAlgorithms. 615 24$aSoftware Engineering. 615 24$aTheory of Computation. 615 24$aCompilers and Interpreters. 615 24$aFormal Languages and Automata Theory. 676 $a005.1 702 $aLegay$b Axel$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aMargaria$b Tiziana$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484283703321 996 $aTools and Algorithms for the Construction and Analysis of Systems$9772021 997 $aUNINA