Image de couverture de livre

Deciding Separation Logic with Pointer Arithmetic and Inductive Definitions

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Su, Wanyun, Wu, Zhilin, Sighireanu, Mihaela
Format:	Preprint
Publié:	2024
Sujets:	Logic in Computer Science
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Incorrectness Separation Logic with Arrays and Pointer Arithmetic
par: Lee, Yeonseok, et autres
Publié: (2025)

Decidability in First-Order Modal Logic with Non-Rigid Constants and Definite Descriptions
par: Artale, Alessandro, et autres
Publié: (2025)

Deciding the Existence of Interpolants and Definitions in First-Order Modal Logic
par: Kurucz, Agi, et autres
Publié: (2023)

Separating the Wheat from the Chaff: Understanding (In-)Completeness of Proof Mechanisms for Separation Logic with Inductive Definitions
par: Elad, Neta, et autres
Publié: (2025)

Can LLM Aid in Solving Constraints with Inductive Definitions?
par: Feng, Weizhi, et autres
Publié: (2026)

Decidability of Quantum Modal Logic
par: Tokuo, Kenji
Publié: (2026)

Dynamic Probability Logic: Decidability & Computability
par: Chopoghloo, Somayeh, et autres
Publié: (2024)

Decidability of Quasi-Dense Modal Logics
par: Ostropolski-Nalewaja, Piotr, et autres
Publié: (2024)

Deciding Boolean Separation Logic via Small Models (Technical Report)
par: Dacík, Tomáš, et autres
Publié: (2024)

On the Decidability of Monadic Theories of Arithmetic Predicates
par: Berthé, Valérie, et autres
Publié: (2024)

On the Decidability of Presburger Arithmetic Expanded with Powers
par: Karimov, Toghrul, et autres
Publié: (2024)

Encoding Peano Arithmetic in a Minimal Fragment of Separation Logic
par: Ito, Sohei, et autres
Publié: (2025)

Normalisation for Negative Free Logics without and with Definite Descriptions
par: Kürbis, Nils
Publié: (2024)

Truth Predicate of Inductive Definitions and Logical Complexity of Infinite-Descent Proofs
par: Ito, Sohei, et autres
Publié: (2026)

Decidability of Graph Neural Networks via Logical Characterizations
par: Benedikt, Michael, et autres
Publié: (2024)

Possibilistic Computation Tree Logic: Decidability and Complete Axiomatization
par: Li, Yongming
Publié: (2025)

Deciding Predicate Logical Theories of Real-Valued Functions
par: Ratschan, Stefan
Publié: (2023)

Skolemization and Decidability of the Bernays-Schoenfinkel Class in Goedel Logics
par: Gamsakhurdia, Mariami, et autres
Publié: (2025)

The Treewidth Boundedness Problem for an Inductive Separation Logic of Relations
par: Bozga, Marius, et autres
Publié: (2023)

The Alternation Hierarchy of First-Order Logic on Words is Decidable
par: Barloy, Corentin, et autres
Publié: (2025)

Decidability for Sturmian words
par: Hieronymi, Philipp, et autres
Publié: (2021)

Generalized Decidability via Brouwer Trees
par: de Jong, Tom, et autres
Publié: (2026)

Deciding Equations in the Time Warp Algebra
par: van Gool, Sam, et autres
Publié: (2023)

Dynamic Separation Logic
par: de Boer, Frank S., et autres
Publié: (2023)

Decidability Results for Fragments of First-Order Logic via a Symbolic Model Property
par: Elad, Neta, et autres
Publié: (2026)

Bisequent Calculi for Neutral Free Logic with Definite Descriptions
par: Indrzejczak, Andrzej, et autres
Publié: (2024)

The Finite Satisfiability Problem for Two-Variable, First-Order Logic with one Transitive Relation is Decidable
par: Pratt-Hartmann, Ian
Publié: (2017)

A Decidable Bundled Fragment of First-Order Modal Logic Without Finite Model Property
par: Joshi, Varad, et autres
Publié: (2025)

Systematic Design of Separation Logics
par: Bruni, Roberto, et autres
Publié: (2026)

Formalising Inductive and Coinductive Containers
par: Damato, Stefania, et autres
Publié: (2024)

A Binary Quantifier for Definite Descriptions in Nelsonian Free Logic
par: Petrukhin, Yaroslav
Publié: (2024)

Definite Descriptions and Hybrid Tense Logic
par: Indrzejczak, Andrzej, et autres
Publié: (2024)

Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic
par: Gokaj, Geri, et autres
Publié: (2025)

Effective MSO-Definability for Tree-width Bounded Models of an Inductive Separation Logic of Relations
par: Bueri, Lucas, et autres
Publié: (2024)

Bifurcation Logic: Separation Through Ordering
par: Galmiche, Didier, et autres
Publié: (2025)

Relative Completeness of Incorrectness Separation Logic
par: Lee, Yeonseok, et autres
Publié: (2025)

Differentiable Inductive Logic Programming in High-Dimensional Space
par: Purgał, Stanisław J., et autres
Publié: (2022)

Unravelling Cyclic First-Order Arithmetic
par: Leigh, Graham E., et autres
Publié: (2025)

Adding Circumscription to Decidable Fragments of First-Order Logic: A Complexity Rollercoaster
par: Lutz, Carsten, et autres
Publié: (2024)

The Complexity of Defining and Separating Fixpoint Formulae in Modal Logic
par: Jung, Jean Christoph, et autres
Publié: (2025)