Image de couverture de livre

Le chameau et le serpent rentrent dans un bar : vérification quasi-automatique de code OCaml en logique de séparation

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Gros, Charlène, Pereira, Mário
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

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

Static and Dynamic Verification of OCaml Programs: The Gospel Ecosystem (Extended Version)
par: Soares, Tiago Lopes, et autres
Publié: (2024)

Unfolding Iterators: Specification and Verification of Higher-Order Iterators, in OCaml
par: Chirica, Ion, et autres
Publié: (2025)

Towards benchmarking of Solidity verification tools
par: Bartoletti, Massimo, et autres
Publié: (2024)

On verification and constraint generation for families of similar hybrid automata
par: Sofronie-Stokkermans, Viorica, et autres
Publié: (2025)

Operational semantics and program verification using many-sorted hybrid modal logic
par: Leustean, Ioana, et autres
Publié: (2019)

Towards the verification of a generic interlocking logic: Dafny meets parameterized model checking
par: Cimatti, Alessandro, et autres
Publié: (2024)

OSVAuto: automatic proofs about functional specifications in OS verification
par: Wu, Yulun, et autres
Publié: (2024)

On the logical structure of choice and bar induction principles
par: Brede, Nuria, et autres
Publié: (2021)

Vers une modélisation de la confiance dans le renseignement sur les menaces cyber
par: Bobelin, Laurent, et autres
Publié: (2025)

A logic for default deontic reasoning
par: Piazza, Mario, et autres
Publié: (2025)

Contractions of quasi relation algebras and applications to representability
par: Craig, Andrew, et autres
Publié: (2026)

On describing trees and quasi-trees from their leaves
par: Courcelle, Bruno
Publié: (2025)

A SAT-based approach to rigorous verification of Bayesian networks
par: Stępka, Ignacy, et autres
Publié: (2024)

Why does it fail? Explanation of verification failures
par: Eriksson, Lars-Henrik
Publié: (2026)

StepProof: Step-by-step verification of natural language mathematical proofs
par: Hu, Xiaolin, et autres
Publié: (2025)

KindHML: formal verification of smart contracts based on Hennessy-Milner logic
par: Bartoletti, Massimo, et autres
Publié: (2026)

Duality theory and representations for distributive quasi relation algebras and DInFL-algebras
par: Craig, Andrew, et autres
Publié: (2025)

Refutation calculi for lattice-based logics: from display to tableaux
par: De Domenico, Andrea, et autres
Publié: (2026)

A beginner guide to Iris, Coq and separation logic
par: Dietrich, Elizabeth
Publié: (2021)

Sequent Calculi for Data-Aware Modal Logics
par: Areces, Carlos, et autres
Publié: (2025)

An ecumenical view of proof-theoretic semantics
par: Nascimento, Victor, et autres
Publié: (2023)

Regular Typed Unification
par: Barbosa, João, et autres
Publié: (2024)

Comparing and Contrasting Arrow's Impossibility Theorem and Gödel's Incompleteness Theorem
par: Livson, Ori, et autres
Publié: (2025)

A study of cut-elimination for a non-labelled cyclic proof system for propositional dynamic logics
par: Oda, Yukihiro
Publié: (2025)

Abstract computation over first-order structures. Part IIa: Moschovakis' operator and other non-determinisms
par: Gaßner, Christine
Publié: (2025)

Demystifying $μ$
par: Afshari, Bahareh, et autres
Publié: (2024)

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

Proof-theoretic Semantics for Second-order Logic
par: Gheorghiu, Alexander V., et autres
Publié: (2025)

List types for resource aware languages: an implicit name approach
par: Ghilezan, Silvia, et autres
Publié: (2021)

Cut elimination for Cyclic Proofs: A Case Study in Temporal Logic
par: Afshari, Bahareh, et autres
Publié: (2024)

Many-valued coalgebraic dynamic logics: Safety and strong completeness via reducibility
par: Hansen, Helle Hvid, et autres
Publié: (2025)

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

Constructive higher sheaf models with applications to synthetic mathematics
par: Coquand, Thierry, et autres
Publié: (2026)

Bijective proofs for Eulerian numbers of types B and D
par: Santocanale, Luigi
Publié: (2021)

On the logical structure of some maximality and well-foundedness principles equivalent to choice principles
par: Herbelin, Hugo
Publié: (2024)

Proofs as stateful programs: A first-order logic with abstract Hoare triples, and an interpretation into an imperative language
par: Powell, Thomas
Publié: (2023)

The strength of the dominance rule
par: Kołodziejczyk, Leszek Aleksander, et autres
Publié: (2024)

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

A Coalgebraic Semantics for Intuitionistic Modal Logic
par: Almeida, Rodrigo Nicolau, et autres
Publié: (2024)