000 | 05632nam a22006375i 4500 | ||
---|---|---|---|
001 | 978-3-030-99524-9 | ||
003 | DE-He213 | ||
005 | 20240423125500.0 | ||
007 | cr nn 008mamaa | ||
008 | 220329s2022 sz | s |||| 0|eng d | ||
020 |
_a9783030995249 _9978-3-030-99524-9 |
||
024 | 7 |
_a10.1007/978-3-030-99524-9 _2doi |
|
050 | 4 | _aQA75.5-76.95 | |
072 | 7 |
_aUYA _2bicssc |
|
072 | 7 |
_aCOM014000 _2bisacsh |
|
072 | 7 |
_aUYA _2thema |
|
082 | 0 | 4 |
_a004.0151 _223 |
245 | 1 | 0 |
_aTools and Algorithms for the Construction and Analysis of Systems _h[electronic resource] : _b28th International Conference, TACAS 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Munich, Germany, April 2–7, 2022, Proceedings, Part I / _cedited by Dana Fisman, Grigore Rosu. |
250 | _a1st ed. 2022. | ||
264 | 1 |
_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2022. |
|
300 |
_aXXII, 583 p. 134 illus. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v13243 |
|
505 | 0 | _aSynthesis -- HOLL: Program Synthesis for Higher Order Logic Locking -- The Complexity of LTL Rational Synthesis -- Synthesis of Compact Strategies for Coordination Programs -- ZDD Boolean Synthesis -- Verification -- Comparative Verification of the Digital Library of Mathematical -- Functions and Computer Algebra Systems -- Verifying Fortran Programs with CIVL -- NORMA: a tool for the analysis of Relay-based Railway Interlocking Systems -- Efficient Neural Network Analysis with Sum-of-Infeasibilities -- Blockchain -- Formal Verification of the Ethereum 2.0 Beacon Chain -- Fast and Reliable Formal Verification of Smart Contracts with the Move Prover -- A Max-SMT Superoptimizer for EVM handling Memory and Storage -- Grammatical Inference -- A New Approach for Active Automata Learning Based on Apartness -- Learning Realtime One-Counter Automata -- Scalable Anytime Algorithms for Learning Fragments of Linear Temporal Logic -- and Daniel NeiderLearning Model Checking and the Kernel Trick for Signal Temporal Logic on Stochastic Processes -- Verification Inference -- Inferring Interval-Valued Floating-Point Preconditions -- NeuReach: Learning Reachability Functions from Simulations -- Quantifier Alternations: Taming the Search Space Explosion -- LinSyn: Synthesizing Tight Linear Bounds for Arbitrary Neural Network Activation Functions -- Short papers -- Kmclib: Automated Inference and Verification of Session Types from OCaml Programs -- Automated Translation of Natural Language Requirements to Runtime Monitors -- MaskD: A Tool for Measuring Masking Fault-Tolerance -- Better Counterexamples for Dafny -- Constraint Solving -- cvc5: A Versatile and Industrial-Strength SMT Solver -- Clausal Proofs for Pseudo-Boolean Reasoning -- Moving Definition Variables in Quantified Boolean Formulas -- A Sorted Datalog Hammer for Supervisor Verification Conditions Modulo Simple Linear Arithmetic -- Model checking and verification -- Property Directed Reachability for Generalized Petri Nets -- Transition Power Abstractions for Deep Counterexample Detection -- Searching for Ribbon-Shaped Paths in Fair Transition Systems -- CoVeriTeam: On-Demand Composition of Cooperative Verification Systems. | |
506 | 0 | _aOpen Access | |
520 | _aThis open access book constitutes the proceedings of the 28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2022, which was held during April 2-7, 2022, in Munich, Germany, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022. The 46 full papers and 4 short papers presented in this volume were carefully reviewed and selected from 159 submissions. The proceedings also contain 16 tool papers of the affiliated competition SV-Comp and 1 paper consisting of the competition report. TACAS is a forum for researchers, developers, and users interested in rigorously based tools and algorithms for the construction and analysis of systems. The conference aims to bridge the gaps between different communities with this common interest and to support them in their quest to improve the utility, reliability, exibility, and efficiency of tools and algorithms for building computer-controlled systems. | ||
650 | 0 | _aComputer science. | |
650 | 0 | _aMicroprogramming . | |
650 | 0 | _aComputer engineering. | |
650 | 0 | _aComputer networks . | |
650 | 0 | _aComputer simulation. | |
650 | 0 | _aSoftware engineering. | |
650 | 1 | 4 | _aTheory of Computation. |
650 | 2 | 4 | _aControl Structures and Microprogramming. |
650 | 2 | 4 | _aComputer Engineering and Networks. |
650 | 2 | 4 | _aComputer Modelling. |
650 | 2 | 4 | _aSoftware Engineering. |
700 | 1 |
_aFisman, Dana. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aRosu, Grigore. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783030995232 |
776 | 0 | 8 |
_iPrinted edition: _z9783030995256 |
830 | 0 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v13243 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-030-99524-9 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
912 | _aZDB-2-SOB | ||
942 | _cSPRINGER | ||
999 |
_c178412 _d178412 |