LEADER 03939nam  22007335  450 
001 996594169803316
005 20240426020334.0
010   $a3-031-57228-9
024 7 $axxx
035   $a(CKB)31435414800041
035   $a(MiAaPQ)EBC31281875
035   $a(Au-PeEL)EBL31281875
035   $a(DE-He213)978-3-031-57228-9
035   $a(OCoLC)1429286645
035   $a(EXLCZ)9931435414800041
100   $a20240404d2024      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 I /$fedited by Naoki Kobayashi, James Worrell
205   $a1st ed. 2024.
210  1$aCham :$cSpringer Nature Switzerland :$cImprint: Springer,$d2024.
215   $a1 online resource (290 pages)
225 1 $aLecture Notes in Computer Science,$x1611-3349 ;$v14574
311   $a3-031-57227-0 
327   $aInvited Talk -- Ackermannian Completion of Separators -- Infinite Games -- Fair Omega-regular Games -- Stochastic Window Mean-Payoff Games -- Symbolic Solution of Emerson-Lei Games for Reactive Synthesis -- Parity Games on Temporal Graphs -- Categorical Semantics -- Drawing from an Urn is Isometric -- Enriching Diagrams with Algebraic Operations -- Monoidal Extended Stone Duality -- Towards a Compositional Framework for Convex Analysis (with Applications to Probability Theory) -- Automata and Synthesis -- Determinization of Integral Discounted-Sum Automata is Decidable -- Checking History-Determinism is NP-hard for Parity Automata -- Tighter Construction of Tight Büchi Automata -- Synthesis with Privacy Against an Observer.
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 ;$v14574
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
702   $aKobayashi$b Naoki
702   $aWorrell$b James
712 12$aETAPS (Conference)$d(27th :$f2024 :$eLuxembourg, Switzerland)
712 12$aFOSSACS (Conference)$d(27th :$f2024 :$eLuxembourg, Switzerland)
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aPROCEEDING
912   $a996594169803316
996   $aFoundations of Software Science and Computation Structures$9772187
997   $aUNISA