Image de couverture de livre

Don't Call Us, We'll Call You: Towards Mixed-Initiative Interactive Proof Assistants for Programming Language Theory

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Verter, Jan Liam, Petricek, Tomas
Format:	Preprint
Publié:	2024
Sujets:	Programming Languages F.3.1
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

On Modular Termination Proofs of General Logic Programs
par: Bossi, Annalisa, et autres
Publié: (2000)

"What Is It That You Don't Understand?" Language Games and Black Box Algorithms
par: Demichelis, Remy
Publié: (2026)

The Autonomous Data Language -- Concepts, Design and Formal Verification
par: Franken, Tom T. P., et autres
Publié: (2025)

Towards Bug-Free Distributed Go Programs
par: Koo, Zhengqun
Publié: (2025)

Modelling Recursion and Probabilistic Choice in Guarded Type Theory
par: Stassen, Philipp Jan Andries, et autres
Publié: (2024)

A New Interaction Concept for Interactive and Autoactive Program Verification
par: Pfeifer, Wolfram, et autres
Publié: (2026)

Synthesizing Invariants for Polynomial Programs by Semidefinite Programming
par: Wu, Hao, et autres
Publié: (2023)

Local Reasoning about Probabilistic Behaviour for Classical-Quantum Programs
par: Wu, Huiling, et autres
Publié: (2023)

Stratified Type Theory
par: Chan, Jonathan, et autres
Publié: (2023)

Verifying Tree-Manipulating Programs via CHCs
par: Faella, Marco, et autres
Publié: (2025)

Simple Modal Types for Functional Reactive Programming
par: Bahr, Patrick
Publié: (2025)

Automating the Analysis of Parsing Algorithms (and other Dynamic Programs)
par: Vieira, Tim, et autres
Publié: (2025)

Comprehensive Verification of Packet Processing
par: Wang, Shengyi, et autres
Publié: (2024)

Simplifying Safety Proofs with Forward-Backward Reasoning and Prophecy
par: Frenkel, Eden, et autres
Publié: (2026)

Proof-Carrying Neuro-Symbolic Code
par: Komendantskaya, Ekaterina
Publié: (2025)

Foundational Verification of Smart Contracts through Verified Compilation
par: Sjöberg, Vilhelm, et autres
Publié: (2024)

Qurts: Automatic Quantum Uncomputation by Affine Types with Lifetime
par: Hirata, Kengo, et autres
Publié: (2024)

Modelling Distributed Applications with Mixed-Choice Stateful Typestates
par: Parrinha, Francisco, et autres
Publié: (2026)

Closure Conversion, Flat Environments, and the Complexity of Abstract Machines
par: Accattoli, Beniamino, et autres
Publié: (2025)

Unified Fairness for Weak Memory Verification
par: Abdulla, Parosh Aziz, et autres
Publié: (2023)

Generically Automating Separation Logic by Functors, Homomorphisms and Modules
par: Xu, Qiyuan, et autres
Publié: (2024)

Gradual Guarantee via Step-Indexed Logical Relations in Agda
par: Siek, Jeremy G.
Publié: (2024)

Seamless, Correct, and Generic Programming over Serialised Data
par: Allais, Guillaume
Publié: (2023)

Quantitative Verification of Omega-regular Properties in Probabilistic Programming
par: Wang, Peixin, et autres
Publié: (2025)

Bisimilarity and Simulatability of Processes Parameterized by Join Interactions
par: Grabmayer, Clemens, et autres
Publié: (2025)

Weak Memory Model Formalisms: Introduction and Survey
par: Su, Roger C., et autres
Publié: (2025)

Software Verification with CPAchecker 3.0: Tutorial and User Guide (Extended Version)
par: Baier, Daniel, et autres
Publié: (2024)

MoXIchecker: An Extensible Model Checker for MoXI
par: Ates, Salih, et autres
Publié: (2024)

Totality for Mixed Inductive and Coinductive Types
par: Hyvernat, Pierre
Publié: (2019)

Explicit Weakening
par: Wadler, Philip
Publié: (2024)

Ranking Functions for Linear-Constraint Loops
par: Ben-Amram, Amir M., et autres
Publié: (2012)

TensorRight: Automated Verification of Tensor Graph Rewrites
par: Arora, Jai, et autres
Publié: (2025)

Forall-Exists Relational Verification by Filtering to Forall-Forall
par: Nagasamudram, Ramana, et autres
Publié: (2025)

Ohana trees, linear approximation and multi-types for the $λ$I-calculus: No variable gets left behind or forgotten!
par: Cerda, Rémy, et autres
Publié: (2025)

Bayesian Separation Logic
par: Ho, Shing Hin, et autres
Publié: (2025)

Bottom-up computation using trees of sublists (Functional Pearl)
par: Mu, Shin-Cheng
Publié: (2023)

A HAT Trick: Automatically Verifying Representation Invariants Using Symbolic Finite Automata
par: Zhou, Zhe, et autres
Publié: (2024)

Derivative-Guided Symbolic Execution
par: Yuan, Yongwei, et autres
Publié: (2024)

Globality and Regions
par: Gramaglia, Hector
Publié: (2025)

Homomorphism Calculus for User-Defined Aggregations
par: Wang, Ziteng, et autres
Publié: (2025)