LEADER 03925nam 22007095 450 001 996594169203316 005 20240427020335.0 010 $a3-031-57231-9 024 7 $a10.1007/978-3-031-57231-9 035 $a(CKB)31435579200041 035 $a(MiAaPQ)EBC31281874 035 $a(Au-PeEL)EBL31281874 035 $a(DE-He213)978-3-031-57231-9 035 $a(OCoLC)1429286527 035 $a(EXLCZ)9931435579200041 100 $a20240406d2024 u| 0 101 0 $aeng 135 $aur||||||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aFoundations of Software Science and Computation Structures $e27th International Conference, FoSSaCS 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 II /$fedited by Naoki Kobayashi, James Worrell 205 $a1st ed. 2024. 210 1$aCham :$cSpringer Nature Switzerland :$cImprint: Springer,$d2024. 215 $a1 online resource (283 pages) 225 1 $aLecture Notes in Computer Science,$x1611-3349 ;$v14575 311 $a3-031-57230-0 327 $aTypes and Programming Languages -- From Rewrite Rules to Axioms in the lambdaPi-Calculus Modulo Theory -- Light Genericity -- Logical Predicates in Higher-Order Mathematical Operational Semantics -- On Basic Feasible Functionals and the Interpretation Method -- Logic and Proofs -- Succinctness of Cosafety Fragments of LTL via Combinatorial Proof Systems -- A Resolution-Based Interactive Proof System for UNSAT -- Craig Interpolation for Decidable First-Order Fragments -- Clones, closed categories, and combinatory logic -- Infinite-State Systems -- Reachability in Fixed VASS: Expressiveness and Lower Bounds -- From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting -- Dimension-Minimality and Primality of Counter Nets -- Parameterized Broadcast Networks with Registers: from NP to the Frontiers of Decidability. 330 $aThe two open access volumes LNCS 14574 and 14575 constitute the proceedings of the 27th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2024, which took place in Luxembourg in April 2024. The 24 full papers included in this book were carefully reviewed and selected from 79 submissions. They were organized in topical sections as follows: Part I: Infinite games; categorical semantics; automata and synthesis; Part II: Types and programming languages; logic and proofs; infinite-state systems. 410 0$aLecture Notes in Computer Science,$x1611-3349 ;$v14575 606 $aComputer science 606 $aMathematical logic 606 $aData structures (Computer science) 606 $aInformation theory 606 $aComputer systems 606 $aComputer science$xMathematics 606 $aTheory of Computation 606 $aMathematical Logic and Foundations 606 $aData Structures and Information Theory 606 $aComputer System Implementation 606 $aMathematics of Computing 615 0$aComputer science. 615 0$aMathematical logic. 615 0$aData structures (Computer science). 615 0$aInformation theory. 615 0$aComputer systems. 615 0$aComputer science$xMathematics. 615 14$aTheory of Computation. 615 24$aMathematical Logic and Foundations. 615 24$aData Structures and Information Theory. 615 24$aComputer System Implementation. 615 24$aMathematics of Computing. 676 $a40,151 700 $aKobayashi$b Naoki$01736494 701 $aWorrell$b James$01736495 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996594169203316 996 $aFoundations of Software Science and Computation Structures$94156353 997 $aUNISA