Foundations of Software Science and Computation Structures
27th 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
Published on 5. April 2024
Book
Paperback/Softback
XVI, 280 pages
978-3-031-57227-2 (ISBN)
Description
The 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.
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.
More details
Series
Edition
2024 ed.
Language
English
Place of publication
Cham
Switzerland
Publishing group
Springer International Publishing
Target group
Professional and scholarly
Illustrations
24 farbige Abbildungen, 20 s/w Abbildungen
XVI, 280 p. 44 illus., 24 illus. in color.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 17 mm
Weight
452 gr
ISBN-13
978-3-031-57227-2 (9783031572272)
DOI
10.1007/978-3-031-57228-9
Schweitzer Classification
Content
Invited 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.