Copertina

Modular Attractor Acceleration in Infinite-State Games (Full Version)

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Heim, Philippe, Dimitrova, Rayna
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Logic in Computer Science
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Localized Attractor Computations for Infinite-State Games (Full Version)
di: Schmuck, Anne-Kathrin, et al.
Pubblicazione: (2024)

Translation of Temporal Logic for Efficient Infinite-State Reactive Synthesis (Full Version)
di: Heim, Philippe, et al.
Pubblicazione: (2024)

Issy: A Comprehensive Tool for Specification and Synthesis of Infinite-State Reactive Systems
di: Heim, Philippe, et al.
Pubblicazione: (2025)

Contract-based Design and Verification of Multi-Agent Systems with Quantitative Temporal Requirements
di: Dewes, Rafael, et al.
Pubblicazione: (2024)

Proof Nets for PiL (Full Version)
di: Acclavio, Matteo, et al.
Pubblicazione: (2026)

Infinite trees
di: Goy, Alexandre
Pubblicazione: (2025)

Unification of Deterministic Higher-Order Patterns (Full Version)
di: Niederhauser, Johannes, et al.
Pubblicazione: (2026)

A Hoare Logic for Domain Specification (Full Version)
di: Kamburjan, Eduard, et al.
Pubblicazione: (2024)

Synthesis of Infinite State Systems
di: Drucker, Ohad, et al.
Pubblicazione: (2025)

Confluence Criteria for Logically Constrained Rewrite Systems (Full Version)
di: Schöpf, Jonas, et al.
Pubblicazione: (2023)

Parameterized Infinite-State Reactive Synthesis
di: Maderbacher, Benedikt, et al.
Pubblicazione: (2025)

A Hyperlogic for Strategies in Stochastic Games (Extended Version)
di: Gerlach, Lina, et al.
Pubblicazione: (2025)

Partial Rewriting and Value Interpretation of Logically Constrained Terms (Full Version)
di: Aoto, Takahito, et al.
Pubblicazione: (2026)

Equational Theories and Validity for Logically Constrained Term Rewriting (Full Version)
di: Aoto, Takahito, et al.
Pubblicazione: (2024)

Recovering Commutation of Logically Constrained Rewriting and Equivalence Transformations (Full Version)
di: Takahata, Kanta, et al.
Pubblicazione: (2025)

Explanations for Unrealizability of Infinite-State Safety Shields
di: Rodriguez, Andoni, et al.
Pubblicazione: (2025)

Handling the Selection Monad (Full Version)
di: Plotkin, Gordon, et al.
Pubblicazione: (2025)

Counterexample-Guided Abstraction Refinement for Generalized Graph Transformation Systems (Full Version)
di: König, Barbara, et al.
Pubblicazione: (2025)

Difference of Constrained Patterns in Logically Constrained Term Rewrite Systems (Full Version)
di: Nishida, Naoki, et al.
Pubblicazione: (2025)

Computing with Infinite Objects: the Gray Code Case
di: Spreen, Dieter, et al.
Pubblicazione: (2021)

Infinite State Model Checking by Learning Transitive Relations
di: Frohn, Florian, et al.
Pubblicazione: (2025)

From Innermost to Full Probabilistic Term Rewriting: Almost-Sure Termination, Complexity, and Modularity
di: Kassing, Jan-Christoph, et al.
Pubblicazione: (2024)

From Thin Concurrent Games to Generalized Species of Structures (Extended Version)
di: Clairambault, Pierre, et al.
Pubblicazione: (2023)

The Computability Path Order for Beta-Eta-Normal Higher-Order Rewriting (Full Version)
di: Niederhauser, Johannes, et al.
Pubblicazione: (2025)

Characterizing Equivalence of Logically Constrained Terms via Existentially Constrained Terms (Full Version)
di: Takahata, Kanta, et al.
Pubblicazione: (2025)

Three Fundamental Questions in Modern Infinite-Domain Constraint Satisfaction
di: Pinsker, Michael, et al.
Pubblicazione: (2025)

Faster Game Solving by Fixpoint Acceleration
di: Hausmann, Daniel
Pubblicazione: (2024)

Effective Versions of Strong Measure Zero
di: Rayman, Matthew
Pubblicazione: (2025)

CTL* Model Checking on Infinite Families of Finite-State Labeled Transition Systems (Technical Report)
di: Pettinau, Roberto, et al.
Pubblicazione: (2026)

Modular Reasoning about Error Bounds for Concurrent Probabilistic Programs (Extended Version)
di: Li, Kwing Hei, et al.
Pubblicazione: (2025)

Beyond Ability: The Four-Fold Spectrum of Power and the Logic of Full Inability
di: Wang, Shanxia
Pubblicazione: (2026)

Growing a Modular Framework for Modal Systems- HOLMS: a HOL Light Library
di: Bilotta, Antonella
Pubblicazione: (2025)

Modular Verification of Differential Privacy in Probabilistic Higher-Order Separation Logic (Extended Version)
di: Haselwarter, Philipp G., et al.
Pubblicazione: (2026)

Modal definability in Euclidean modal logics
di: Balbiani, Philippe, et al.
Pubblicazione: (2025)

Intuitionistic modal logics: a minimal setting
di: Balbiani, Philippe, et al.
Pubblicazione: (2025)

The Constructive $μ$-calculus: Game Semantics and Non-Wellfounded Proof Systems
di: Pacheco, Leonardo
Pubblicazione: (2026)

On the Computability of Measures of Regular Sets of Infinite Trees
di: Niwiński, Damian, et al.
Pubblicazione: (2023)

Towards Learning Infinite SMT Models (Work in Progress)
di: Janota, Mikoláš, et al.
Pubblicazione: (2025)

Infinite Traces by Finality: a Sheaf-Theoretic Approach
di: Peressotti, Marco
Pubblicazione: (2025)

Provable Preimage Under-Approximation for Neural Networks (Full Version)
di: Zhang, Xiyue, et al.
Pubblicazione: (2023)