Image de couverture de livre

Equational Reasoning Modulo Commutativity in Languages with Binders (Extended Version)

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Caires-Santos, Ali K., Fernández, Maribel, Nantes-Sobrinho, Daniele
Format:	Preprint
Publié:	2025
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

Nominal Equational Narrowing: Rewriting for Unification in Languages with Binders
par: Fernández, Maribel, et autres
Publié: (2025)

Strong Nominal Semantics for Fixed-Point Constraints
par: Caires-Santos, Ali K., et autres
Publié: (2024)

Generalization Problems with Atom-Variables in Languages with Binders and Equational Theories
par: Nantes-Sobrinho, Daniele, et autres
Publié: (2025)

Nominal Equational Rewriting and Narrowing
par: Ayala-Rincón, Mauricio, et autres
Publié: (2025)

Non-Deterministic Functions as Non-Deterministic Processes (Extended Version)
par: Paulus, Joseph W. N., et autres
Publié: (2021)

Compositional Symbolic Execution for Correctness and Incorrectness Reasoning (Extended Version)
par: Lööw, Andreas, et autres
Publié: (2024)

Proceedings Twentieth International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice
par: Chaudhuri, Kaustuv, et autres
Publié: (2025)

Satisfiability Modulo Extensional Constant Arrays (Extended Version)
par: Preiner, Mathias, et autres
Publié: (2026)

A Unified Automata-Theoretic Approach to LTLf Modulo Theories (Extended Version)
par: Faella, Marco, et autres
Publié: (2024)

An Abstract Domain for Heap Commutativity (Extended Version)
par: Pincus, Jared, et autres
Publié: (2024)

Typed Non-determinism in Concurrent Calculi: The Eager Way
par: Heuvel, Bas van den, et autres
Publié: (2024)

A set-theoretical approach for ABox reasoning services (Extended Version)
par: Cantone, Domenico, et autres
Publié: (2017)

Partially Finite Model Reasoning in Description Logics Extended Version
par: Gogacz, Tomasz, et autres
Publié: (2026)

Integer Reasoning Modulo Different Constants in SMT
par: Pertseva, Elizaveta, et autres
Publié: (2025)

Tableaux for Automated Reasoning in Dependently-Typed Higher-Order Logic (Extended Version)
par: Niederhauser, Johannes, et autres
Publié: (2024)

Recovering Commutation of Logically Constrained Rewriting and Equivalence Transformations (Full Version)
par: Takahata, Kanta, et autres
Publié: (2025)

A C++ reasoner for the description logic $\mathcal{DL}_{\mathbf{D}}^{4,\!\times}$ (Extended Version)
par: Cantone, Domenico, et autres
Publié: (2017)

A set-based reasoner for the description logic $\mathcal{DL}_{\mathbf{D}}^{4,\!\times}$ (Extended Version)
par: Cantone, Domenico, et autres
Publié: (2018)

The Precise Complexity of Reasoning in $\mathcal{ALC}$ with $ω$-Admissible Concrete Domains (Extended Version)
par: Borgwardt, Stefan, et autres
Publié: (2024)

An optimized KE-tableau-based system for reasoning in the description logic $\mathcal{DL}_{\mathbf{D}}^{4,\!\times}$ (Extended Version)
par: Cantone, Domenico, et autres
Publié: (2018)

Thread and Memory-Safe Programming with CLASS
par: Caires, Luís
Publié: (2025)

Rely-Guarantee Reasoning for Causally Consistent Shared Memory (Extended Version)
par: Lahav, Ori, et autres
Publié: (2023)

The Shape of a Benedictine Monastery: The SaintGall Ontology (Extended Version)
par: Cantale, Claudia, et autres
Publié: (2017)

Sharing and Linear Logic with Restricted Access (Extended Version)
par: Barenbaum, Pablo, et autres
Publié: (2025)

First-Order LTLf Synthesis with Lookback (Extended Version)
par: Winkler, Sarah
Publié: (2025)

Formulas as Processes, Deadlock-Freedom as Choreographies (Extended Version)
par: Acclavio, Matteo, et autres
Publié: (2025)

A Hyperlogic for Strategies in Stochastic Games (Extended Version)
par: Gerlach, Lina, et autres
Publié: (2025)

Practical Deductive Verification of OCaml Programs (Extended Version)
par: Pereira, Mário
Publié: (2024)

Towards Proving Liveness on Weak Memory (Extended Version)
par: Bargmann, Lara, et autres
Publié: (2026)

Modular Reasoning about Error Bounds for Concurrent Probabilistic Programs (Extended Version)
par: Li, Kwing Hei, et autres
Publié: (2025)

Paraconsistent Semantics for Extended Fuzzy Logic Programs via Approximation Fixpoint Theory [Extended Version]
par: Kettmann, Pascal, et autres
Publié: (2026)

Efficient Probabilistic Model Checking for Relational Reachability (Extended Version)
par: Gerlach, Lina, et autres
Publié: (2025)

Certified Branch-and-Bound MaxSAT Solving (Extended Version)
par: Vandesande, Dieter, et autres
Publié: (2025)

Model Checking as Program Verification by Abstract Interpretation (Extended Version)
par: Baldan, Paolo, et autres
Publié: (2025)

A Framework for Coalgebraic Reward-Sensitive Bisimulation (Extended Version)
par: de Amorim, Pedro H. Azevedo, et autres
Publié: (2026)

Mechanized Undecidability of Higher-order beta-Matching (Extended Version)
par: Dudenhefner, Andrej
Publié: (2026)

MCSAT Modulo Transcendental Arithmetics
par: Gallego-Hernández, Jorge, et autres
Publié: (2026)

Generalized Optimization Modulo Theories
par: Tsiskaridze, Nestan, et autres
Publié: (2024)

Congruence Closure Modulo Groups
par: Kim, Dohan
Publié: (2023)

Putting Perspective into OWL [sic]: Complexity-Neutral Standpoint Reasoning for Ontology Languages via Monodic S5 over Counting Two-Variable First-Order Logic (Extended Version with Appendix)
par: Álvarez, Lucía Gómez, et autres
Publié: (2025)