:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Stoltenow, Lara, König, Barbara, Schneider, Sven, Corradini, Andrea, Lambers, Leen, Orejas, Fernando
Formato:	Preprint
Publicado:	2024
Materias:	Logic in Computer Science
Acceso en línea:	https://arxiv.org/abs/2407.06864
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

On Categories of Nested Conditions
por: Rensink, Arend, et al.
Publicado: (2024)

Taint Analysis for Graph APIs Focusing on Broken Access Control
por: Lambers, Leen, et al.
Publicado: (2025)

Formalising Inductive and Coinductive Containers
por: Damato, Stefania, et al.
Publicado: (2024)

Proceedings 16th International Workshop on Graph Computation Models
por: Lambers, Leen, et al.
Publicado: (2026)

Checking Satisfiability of Hyperproperties using First-Order Logic
por: Beutner, Raven, et al.
Publicado: (2025)

Coinductive Proofs for Temporal Hyperliveness
por: Correnson, Arthur, et al.
Publicado: (2025)

Coinductive Streams in Monoidal Categories
por: Di Lavore, Elena, et al.
Publicado: (2022)

The Size-Change Principle for Mixed Inductive and Coinductive types
por: Hyvernat, Pierre
Publicado: (2024)

Master Thesis Impredicative Encodings of Inductive and Coinductive Types
por: Bronsveld, Steven, et al.
Publicado: (2025)

Compression for Coinductive Infinitary Rewriting: A Generic Approach, with Applications to Cut-Elimination for Non-Wellfounded Proofs
por: Cerda, Rémy, et al.
Publicado: (2025)

Coinductive Proofs of Regular Expression Equivalence in Zero Knowledge
por: Kolesar, John, et al.
Publicado: (2025)

A Tree-Shaped Tableau for Checking the Satisfiability of Signal Temporal Logic with Bounded Temporal Operators
por: Melani, Beatrice, et al.
Publicado: (2025)

A Coinductive Reformulation of Milner's Proof System for Regular Expressions Modulo Bisimilarity
por: Grabmayer, Clemens
Publicado: (2022)

Constrained and Robust Policy Synthesis with Satisfiability-Modulo-Probabilistic-Model-Checking
por: Heck, Linus, et al.
Publicado: (2025)

A Monoidal View on Fixpoint Checks
por: Baldan, Paolo, et al.
Publicado: (2023)

Coinductive proof search for polarized logic with applications to full intuitionistic propositional logic
por: Santo, José Espírito, et al.
Publicado: (2020)

Drag Rewriting
por: Dershowitz, Nachum, et al.
Publicado: (2024)

Loop-Checking and Counter-Model Extraction for Intuitionistic Tense Logics via Nested Sequents
por: Lyon, Tim S.
Publicado: (2026)

Left-Linear Rewriting in Adhesive Categories
por: Baldan, Paolo, et al.
Publicado: (2024)

Satisfiability of Quantified Boolean Announcements
por: van Ditmarsch, Hans, et al.
Publicado: (2022)

Hyperproperty Verification as CHC Satisfiability
por: Itzhaky, Shachar, et al.
Publicado: (2023)

Satisfiability in Łukasiewicz logic and its unbounded relative
por: Haniková, Zuzana, et al.
Publicado: (2025)

Coalgebraic Satisfiability Checking for Arithmetic $μ$-Calculi
por: Hausmann, Daniel, et al.
Publicado: (2022)

Satisfiability Modulo Exponential Integer Arithmetic
por: Frohn, Florian, et al.
Publicado: (2024)

Spanning Matrices via Satisfiability Solving
por: Eisenhofer, Clemens, et al.
Publicado: (2024)

Finding Connections via Satisfiability Solving
por: Eisenhofer, Clemens, et al.
Publicado: (2026)

Nested Sequents for Quasi-transitive Modal Logics
por: Marin, Sonia, et al.
Publicado: (2024)

Satisfiability Modulo Theories for Verifying MILP Certificates
por: Wood, Kenan, et al.
Publicado: (2023)

On the Satisfiability of Local First-Order Logics with Data
por: Bollig, Benedikt, et al.
Publicado: (2023)

Localized RETE for Incremental Graph Queries with Nested Graph Conditions
por: Barkowsky, Matthias, et al.
Publicado: (2024)

Properties for Paths in Graph Databases
por: Orejas, Fernando, et al.
Publicado: (2025)

Satisfiability Modulo Extensional Constant Arrays (Extended Version)
por: Preiner, Mathias, et al.
Publicado: (2026)

parSAT: Parallel Solving of Floating-Point Satisfiability
por: Krahl, Markus, et al.
Publicado: (2025)

An Effective Orchestral Approach to Satisfiability Modulo Prime Fields
por: Isabel, Miguel, et al.
Publicado: (2026)

Nested Sequents for Intermediate Logics: The Case of Gödel-Dummett Logics
por: Lyon, Tim S.
Publicado: (2023)

Inductive Satisfiability Certification for Universal Quantifiers and Uninterpreted Function Symbols
por: Ratschan, Stefan, et al.
Publicado: (2026)

Complexity of the Model Checking problem for inquisitive propositional and modal logic
por: Grilletti, Gianluca, et al.
Publicado: (2024)

Satisfiability.jl: Satisfiability Modulo Theories in Julia
por: Soroka, Emiko, et al.
Publicado: (2023)

The Satisfiability and Validity Problems for Probabilistic Computational Tree Logic are Highly Undecidable
por: Chodil, Miroslav, et al.
Publicado: (2025)