LEADER 05752nam 22006975 450 001 9910484283903321 005 20230329143415.0 010 $a3-662-54577-2 024 7 $a10.1007/978-3-662-54577-5 035 $a(CKB)3710000001127407 035 $a(DE-He213)978-3-662-54577-5 035 $a(MiAaPQ)EBC5579791 035 $a(PPN)199766878 035 $a(EXLCZ)993710000001127407 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 I /$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, 609 p. 152 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v10205 311 $a3-662-54576-4 327 $aInvited Talk -- Validation, Synthesis and Optimization for Cyber-Physical Systems -- Verification Techniques -- An Abstraction Technique For Parameterized Model Checking of Leader Election Protocols: Application to FTSP -- Combining String Abstract Domains for JavaScript Analysis: An Evaluation.-Invariant Checking of NRA Transition Systems via Incremental Reduction to LRA with EUF -- Bounded Quantifier Instantiation for Checking Inductive Invariants -- Proving Termination through Conditional Termination.-Efficient Certified Resolution Proof Checking -- Precise Widening Operators for Proving Termination by Abstract Interpretation -- Automatic Verification of Finite Precision Implementations of Linear Controllers -- Learning -- Learning Symbolic Automata -- ML for ML: Learning Cost Semantics by Experiment -- A Novel Learning Algorithm for Buchi Automata based on Family of DFAs and Classification Trees -- Synthesis -- Hierarchical Network Formation Games -- Synthesis of Recursive ADT Transformers from Reusable Templates -- Counterexample-Guided Model Synthesis -- Interpolation-Based GR(1) Assumptions Refinement -- Connecting Program Synthesis and Reachability: Automatic Program Repair using Test-Input Generation -- Scaling Enumerative Program Synthesis via Divide and Conquer -- Towards Parallel Boolean Functional Synthesis -- Encodings of Bounded Synthesis -- Tools -- HQSpre - An Effective Preprocessor for QBF and DQBF -- RPP: Automatic Proof of Relational Properties by Self-Composition -- autoCode4: Structural Controller Synthesis -- Automata -- Lazy Automata Techniques for WS1S -- From LTL and limit-deterministic Büchi automata to deterministic parity automata -- Index appearance record for transforming Rabin automata into parity automata -- Minimization of Visibly Pushdown Automata Using Partial Max-SAT -- Concurrency and Bisimulation -- CSimpl: a Framework for the Verification of Concurrent Programs using Rely-Guarante -- Fair Termination for Parameterized Probabilistic Concurrent Systems -- Forward Bisimulations for Nondeterministic Symbolic Finite Automata -- Up-To Techniques for Weighted Systems -- Hybrid Systems -- Rigorous Simulation-Based Analysis of Linear Hybrid Systems -- HARE: A Hybrid Abstraction Refinement Engine for Verifying Non-Linear Hybrid Automata -- Counterexample-guided Refinement of Template Polyhedra. . 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 ;$v10205 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.14 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 $a9910484283903321 996 $aTools and Algorithms for the Construction and Analysis of Systems$9772021 997 $aUNINA