Foundations of Software Science and Computation Structures
portes grátis
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
Worrell, James; Kobayashi, Naoki
Springer International Publishing AG
04/2024
280
Mole
9783031572272
15 a 20 dias
Descrição não disponível.
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 Buechi Automata.- Synthesis with Privacy Against an Observer.
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
program analysis;categorical models and logics;language theory, automata, and games;concurrency theory;modal, spatial, and temporal logics;Open Access;logics of programming;software specification and refinement;emerging models of computation;models of software security;logical aspects of computational complexity
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 Buechi Automata.- Synthesis with Privacy Against an Observer.
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
program analysis;categorical models and logics;language theory, automata, and games;concurrency theory;modal, spatial, and temporal logics;Open Access;logics of programming;software specification and refinement;emerging models of computation;models of software security;logical aspects of computational complexity
