LEADER 04568nam 22006855 450 001 9910847589703321 005 20240404085715.0 010 $a3-031-57246-7 024 7 $a10.1007/978-3-031-57246-3 035 $a(CKB)31435477700041 035 $a(MiAaPQ)EBC31281876 035 $a(Au-PeEL)EBL31281876 035 $a(DE-He213)978-3-031-57246-3 035 $a(OCoLC)1429288808 035 $a(EXLCZ)9931435477700041 100 $a20240403d2024 u| 0 101 0 $aeng 135 $aur||||||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aTools and Algorithms for the Construction and Analysis of Systems $e30th International Conference, TACAS 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, April 6?11, 2024, Proceedings, Part I /$fedited by Bernd Finkbeiner, Laura Kovács 205 $a1st ed. 2024. 210 1$aCham :$cSpringer Nature Switzerland :$cImprint: Springer,$d2024. 215 $a1 online resource (413 pages) 225 1 $aLecture Notes in Computer Science,$x1611-3349 ;$v14570 311 $a3-031-57245-9 327 $aSAT and SMT Solving -- DRAT Proofs of Unsatisfiability for SAT Modulo Monotonic Theories -- Z3-Noodler: An Automata-based String Solver -- TaSSAT: Transfer and Share SAT -- Speculative SAT modulo SAT -- Happy Ending: An Empty Hexagon in Every Set of 30 Points -- Synthesis -- Fully Generalized Reactivity(1) Synthesis -- Knor: reactive synthesis using Oink -- On Dependent Variables in Reactive Synthesis -- CESAR: Control Envelope Synthesis via Angelic Refinements -- Logic and Decidability -- Answering Temporal Conjunctive Queries over Description Logic Ontologies for Situation Recognition in Complex Operational Domains -- Deciding Boolean Separation Logic via Small Models -- Asynchronous Subtyping by Trace Relaxation -- Program Analysis and Proofs -- SootUp: A Redesign of the Soot Static Analysis Framework -- Formally verified asymptotic consensus in robust networks -- Formally Verifying an Efficient Sorter -- Explainable Online Monitoring of Metric First-Order Temporal Logic -- Proof Checking -- IsaRare: Automatic Veri cation of SMT Rewrites in Isabelle/HOL -- Automate where Automation Fails: Proof Strategies for Frama-C/WP -- VeSCMul: Verified Implementation of S-C-Rewriting for Multiplier Verification -- A Logical Treatment of Finite Automata -- A State-of-the-Art Karp-Miller Algorithm Certified in Coq. 330 $aThe open access book 3-volume set LNCS 14570-14573 constitutes the proceedings of the 30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2024, which was held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, during April 6-11, 2024, in Luxembourg. The 53 full papers and 16 short SVComp contributions included in these proceedings were carefully reviewed and selected from 159 submissions. They were organized in topical sections as follows: Part I: STA and SMT solving; synthesis; logic and decidability; program analysis and proofs; proof checking; Part II: Model Checking; automata and learning; software verification; probabilistic systems; simulations; Part III: Neural networks; testing and verification; games; concurrency; SV-Comp 2024. . 410 0$aLecture Notes in Computer Science,$x1611-3349 ;$v14570 606 $aComputer science 606 $aMicroprogramming 606 $aComputer networks 606 $aComputer simulation 606 $aSoftware engineering 606 $aTheory of Computation 606 $aControl Structures and Microprogramming 606 $aComputer Communication Networks 606 $aComputer Modelling 606 $aSoftware Engineering 615 0$aComputer science. 615 0$aMicroprogramming. 615 0$aComputer networks. 615 0$aComputer simulation. 615 0$aSoftware engineering. 615 14$aTheory of Computation. 615 24$aControl Structures and Microprogramming. 615 24$aComputer Communication Networks. 615 24$aComputer Modelling. 615 24$aSoftware Engineering. 676 $a004.0151 700 $aFinkbeiner$b Bernd$01736354 701 $aKovács$b Laura$01250003 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910847589703321 996 $aTools and Algorithms for the Construction and Analysis of Systems$94156203 997 $aUNINA