000 03755nam a22006255i 4500
001 978-3-031-57228-9
003 DE-He213
005 20240507155720.0
007 cr nn 008mamaa
008 240404s2024 sz | s |||| 0|eng d
020 _a9783031572289
_9978-3-031-57228-9
024 7 _a10.1007/978-3-031-57228-9
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a40,151
_223
245 1 0 _aFoundations of Software Science and Computation Structures
_h[electronic resource] :
_b27th 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 /
_cedited by Naoki Kobayashi, James Worrell.
250 _a1st ed. 2024.
264 1 _aCham :
_bSpringer Nature Switzerland :
_bImprint: Springer,
_c2024.
300 _aXVI, 280 p. 44 illus., 24 illus. in color.
_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 ;
_v14574
505 0 _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.
506 0 _aOpen Access
520 _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.
650 0 _aComputer science.
650 0 _aMathematical logic.
650 0 _aData structures (Computer science).
650 0 _aInformation theory.
650 0 _aComputer systems.
650 0 _aComputer science
_xMathematics.
650 1 4 _aTheory of Computation.
650 2 4 _aMathematical Logic and Foundations.
650 2 4 _aData Structures and Information Theory.
650 2 4 _aComputer System Implementation.
650 2 4 _aMathematics of Computing.
700 1 _aKobayashi, Naoki.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aWorrell, James.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783031572272
776 0 8 _iPrinted edition:
_z9783031572296
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v14574
856 4 0 _uhttps://doi.org/10.1007/978-3-031-57228-9
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-SOB
999 _c37541
_d37541