Guardado en:
| Autores principales: | König, Barbara, Rensink, Arend, Stoltenow, Lara, Urrigshardt, Fabian |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | https://arxiv.org/abs/2504.08617 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
Visualising CTL Witnesses and Counterexamples -- Extended Version
por: Rensink, Arend
Publicado: (2026)
por: Rensink, Arend
Publicado: (2026)
On Categories of Nested Conditions
por: Rensink, Arend, et al.
Publicado: (2024)
por: Rensink, Arend, et al.
Publicado: (2024)
Coinductive Techniques for Checking Satisfiability of Generalized Nested Conditions
por: Stoltenow, Lara, et al.
Publicado: (2024)
por: Stoltenow, Lara, et al.
Publicado: (2024)
Counterexample-Guided Interval Weakening
por: Andrew, Ben M., et al.
Publicado: (2026)
por: Andrew, Ben M., et al.
Publicado: (2026)
Certifying Lyapunov Stability of Black-Box Nonlinear Systems via Counterexample Guided Synthesis (Extended Version)
por: Hsieh, Chiao, et al.
Publicado: (2025)
por: Hsieh, Chiao, et al.
Publicado: (2025)
The Modal Logic of Abstraction Refinement
por: Piribauer, Jakob, et al.
Publicado: (2026)
por: Piribauer, Jakob, et al.
Publicado: (2026)
Counterexample-Guided Repair of Reinforcement Learning Systems Using Safety Critics
por: Boetius, David, et al.
Publicado: (2024)
por: Boetius, David, et al.
Publicado: (2024)
Recovering Commutation of Logically Constrained Rewriting and Equivalence Transformations (Full Version)
por: Takahata, Kanta, et al.
Publicado: (2025)
por: Takahata, Kanta, et al.
Publicado: (2025)
Confluence Criteria for Logically Constrained Rewrite Systems (Full Version)
por: Schöpf, Jonas, et al.
Publicado: (2023)
por: Schöpf, Jonas, et al.
Publicado: (2023)
Efficient Discovery of Actual Causality using Abstraction-Refinement
por: Rafieioskouei, Arshia, et al.
Publicado: (2024)
por: Rafieioskouei, Arshia, et al.
Publicado: (2024)
Input-based Three-valued Abstraction Refinement
por: Onderka, Jan, et al.
Publicado: (2024)
por: Onderka, Jan, et al.
Publicado: (2024)
Difference of Constrained Patterns in Logically Constrained Term Rewrite Systems (Full Version)
por: Nishida, Naoki, et al.
Publicado: (2025)
por: Nishida, Naoki, et al.
Publicado: (2025)
Proof Nets for PiL (Full Version)
por: Acclavio, Matteo, et al.
Publicado: (2026)
por: Acclavio, Matteo, et al.
Publicado: (2026)
Unification of Deterministic Higher-Order Patterns (Full Version)
por: Niederhauser, Johannes, et al.
Publicado: (2026)
por: Niederhauser, Johannes, et al.
Publicado: (2026)
A Hoare Logic for Domain Specification (Full Version)
por: Kamburjan, Eduard, et al.
Publicado: (2024)
por: Kamburjan, Eduard, et al.
Publicado: (2024)
Termination of Graph Transformation Systems via Generalized Weighted Type Graphs
por: Endrullis, Jörg, et al.
Publicado: (2023)
por: Endrullis, Jörg, et al.
Publicado: (2023)
Towards Proving Liveness on Weak Memory (Extended Version)
por: Bargmann, Lara, et al.
Publicado: (2026)
por: Bargmann, Lara, et al.
Publicado: (2026)
Localized Attractor Computations for Infinite-State Games (Full Version)
por: Schmuck, Anne-Kathrin, et al.
Publicado: (2024)
por: Schmuck, Anne-Kathrin, et al.
Publicado: (2024)
Modular Attractor Acceleration in Infinite-State Games (Full Version)
por: Heim, Philippe, et al.
Publicado: (2026)
por: Heim, Philippe, et al.
Publicado: (2026)
Explaining, Fast and Slow: Abstraction and Refinement of Provable Explanations
por: Bassan, Shahaf, et al.
Publicado: (2025)
por: Bassan, Shahaf, et al.
Publicado: (2025)
Handling the Selection Monad (Full Version)
por: Plotkin, Gordon, et al.
Publicado: (2025)
por: Plotkin, Gordon, et al.
Publicado: (2025)
Regular Abstractions for Array Systems
por: Hong, Chih-Duo, et al.
Publicado: (2024)
por: Hong, Chih-Duo, et al.
Publicado: (2024)
Equational Theories and Validity for Logically Constrained Term Rewriting (Full Version)
por: Aoto, Takahito, et al.
Publicado: (2024)
por: Aoto, Takahito, et al.
Publicado: (2024)
Partial Rewriting and Value Interpretation of Logically Constrained Terms (Full Version)
por: Aoto, Takahito, et al.
Publicado: (2026)
por: Aoto, Takahito, et al.
Publicado: (2026)
Translation of Temporal Logic for Efficient Infinite-State Reactive Synthesis (Full Version)
por: Heim, Philippe, et al.
Publicado: (2024)
por: Heim, Philippe, et al.
Publicado: (2024)
The Computability Path Order for Beta-Eta-Normal Higher-Order Rewriting (Full Version)
por: Niederhauser, Johannes, et al.
Publicado: (2025)
por: Niederhauser, Johannes, et al.
Publicado: (2025)
Characterizing Equivalence of Logically Constrained Terms via Existentially Constrained Terms (Full Version)
por: Takahata, Kanta, et al.
Publicado: (2025)
por: Takahata, Kanta, et al.
Publicado: (2025)
Trade-offs between classical and quantum space using spooky pebbling
por: Quist, Arend-Jan, et al.
Publicado: (2024)
por: Quist, Arend-Jan, et al.
Publicado: (2024)
Multi-Threaded Software Model Checking via Parallel Trace Abstraction Refinement
por: Barth, Max, et al.
Publicado: (2025)
por: Barth, Max, et al.
Publicado: (2025)
On-The-Fly Symbolic Algorithm for Timed ATL with Abstractions
por: Jensen, Nicolaj Ø., et al.
Publicado: (2025)
por: Jensen, Nicolaj Ø., et al.
Publicado: (2025)
Generalized Security-Preserving Refinement for Concurrent Systems
por: Sun, Huan, et al.
Publicado: (2025)
por: Sun, Huan, et al.
Publicado: (2025)
Contextual Refinement of Higher-Order Concurrent Probabilistic Programs (Extended Version)
por: Li, Kwing Hei, et al.
Publicado: (2025)
por: Li, Kwing Hei, et al.
Publicado: (2025)
Effective Versions of Strong Measure Zero
por: Rayman, Matthew
Publicado: (2025)
por: Rayman, Matthew
Publicado: (2025)
Paraconsistent Existential Graphs Gamma Peirce System
por: Sierra-Aristizabal, Manuel
Publicado: (2023)
por: Sierra-Aristizabal, Manuel
Publicado: (2023)
Termination of Graph Transformation Systems Using Weighted Subgraph Counting
por: Overbeek, Roy, et al.
Publicado: (2023)
por: Overbeek, Roy, et al.
Publicado: (2023)
Beyond Ability: The Four-Fold Spectrum of Power and the Logic of Full Inability
por: Wang, Shanxia
Publicado: (2026)
por: Wang, Shanxia
Publicado: (2026)
Isabelle as Systems Platform: Managing Automated and Quasi-interactive Builds
por: Huch, Fabian
Publicado: (2024)
por: Huch, Fabian
Publicado: (2024)
Unifying Sequent Systems for Gödel-Löb Provability Logic via Syntactic Transformations
por: Lyon, Tim S.
Publicado: (2024)
por: Lyon, Tim S.
Publicado: (2024)
Abstractions of Sequences, Functions and Operators
por: Rustenholz, Louis, et al.
Publicado: (2025)
por: Rustenholz, Louis, et al.
Publicado: (2025)
A Syntactic Approach to Computing Complete and Sound Abstraction in the Situation Calculus
por: Fang, Liangda, et al.
Publicado: (2024)
por: Fang, Liangda, et al.
Publicado: (2024)
Ejemplares similares
-
Visualising CTL Witnesses and Counterexamples -- Extended Version
por: Rensink, Arend
Publicado: (2026) -
On Categories of Nested Conditions
por: Rensink, Arend, et al.
Publicado: (2024) -
Coinductive Techniques for Checking Satisfiability of Generalized Nested Conditions
por: Stoltenow, Lara, et al.
Publicado: (2024) -
Counterexample-Guided Interval Weakening
por: Andrew, Ben M., et al.
Publicado: (2026) -
Certifying Lyapunov Stability of Black-Box Nonlinear Systems via Counterexample Guided Synthesis (Extended Version)
por: Hsieh, Chiao, et al.
Publicado: (2025)