My Account Log in

3 options

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 / edited by Naoki Kobayashi, James Worrell.

DOAB Directory of Open Access Books Available online

View online

Springer Nature - Springer Nature Link Journals and eBooks - Fully Open Access Available online

View online

SpringerLink Open Access eBooks Available online

View online
Format:
Book
Conference/Event
Contributor:
Kobayashi, Naoki, editor.
Worrell, James, editor.
Conference Name:
ETAPS (Conference) (27th : 2024 : Luxembourg, Switzerland)
FOSSACS (Conference) (27th : 2024 : Luxembourg, Switzerland)
Series:
Lecture Notes in Computer Science, 1611-3349 ; 14574
Language:
English
Subjects (All):
Computer science.
Logic, Symbolic and mathematical.
Data structures (Computer science).
Information theory.
Computer systems.
Computer science--Mathematics.
Theory of Computation.
Mathematical Logic and Foundations.
Data Structures and Information Theory.
Computer System Implementation.
Mathematics of Computing.
Local Subjects:
Theory of Computation.
Mathematical Logic and Foundations.
Data Structures and Information Theory.
Computer System Implementation.
Mathematics of Computing.
Physical Description:
1 online resource (290 pages)
Edition:
1st ed. 2024.
Place of Publication:
Cham : Springer Nature Switzerland : Imprint: Springer, 2024.
Summary:
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.
Contents:
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.
ISBN:
3-031-57228-9
OCLC:
1429286645
Publisher Number:
xxx

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account