Cover Image

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

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Verter, Jan Liam, Petricek, Tomas
Format:	Preprint
Published:	2024
Subjects:	Programming Languages F.3.1
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On Modular Termination Proofs of General Logic Programs
by: Bossi, Annalisa, et al.
Published: (2000)

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

The Autonomous Data Language -- Concepts, Design and Formal Verification
by: Franken, Tom T. P., et al.
Published: (2025)

Towards Bug-Free Distributed Go Programs
by: Koo, Zhengqun
Published: (2025)

Modelling Recursion and Probabilistic Choice in Guarded Type Theory
by: Stassen, Philipp Jan Andries, et al.
Published: (2024)

A New Interaction Concept for Interactive and Autoactive Program Verification
by: Pfeifer, Wolfram, et al.
Published: (2026)

Synthesizing Invariants for Polynomial Programs by Semidefinite Programming
by: Wu, Hao, et al.
Published: (2023)

Local Reasoning about Probabilistic Behaviour for Classical-Quantum Programs
by: Wu, Huiling, et al.
Published: (2023)

Stratified Type Theory
by: Chan, Jonathan, et al.
Published: (2023)

Verifying Tree-Manipulating Programs via CHCs
by: Faella, Marco, et al.
Published: (2025)

Simple Modal Types for Functional Reactive Programming
by: Bahr, Patrick
Published: (2025)

Automating the Analysis of Parsing Algorithms (and other Dynamic Programs)
by: Vieira, Tim, et al.
Published: (2025)

Comprehensive Verification of Packet Processing
by: Wang, Shengyi, et al.
Published: (2024)

Simplifying Safety Proofs with Forward-Backward Reasoning and Prophecy
by: Frenkel, Eden, et al.
Published: (2026)

Proof-Carrying Neuro-Symbolic Code
by: Komendantskaya, Ekaterina
Published: (2025)

Foundational Verification of Smart Contracts through Verified Compilation
by: Sjöberg, Vilhelm, et al.
Published: (2024)

Qurts: Automatic Quantum Uncomputation by Affine Types with Lifetime
by: Hirata, Kengo, et al.
Published: (2024)

Modelling Distributed Applications with Mixed-Choice Stateful Typestates
by: Parrinha, Francisco, et al.
Published: (2026)

Closure Conversion, Flat Environments, and the Complexity of Abstract Machines
by: Accattoli, Beniamino, et al.
Published: (2025)

Unified Fairness for Weak Memory Verification
by: Abdulla, Parosh Aziz, et al.
Published: (2023)

Generically Automating Separation Logic by Functors, Homomorphisms and Modules
by: Xu, Qiyuan, et al.
Published: (2024)

Gradual Guarantee via Step-Indexed Logical Relations in Agda
by: Siek, Jeremy G.
Published: (2024)

Seamless, Correct, and Generic Programming over Serialised Data
by: Allais, Guillaume
Published: (2023)

Quantitative Verification of Omega-regular Properties in Probabilistic Programming
by: Wang, Peixin, et al.
Published: (2025)

Bisimilarity and Simulatability of Processes Parameterized by Join Interactions
by: Grabmayer, Clemens, et al.
Published: (2025)

Weak Memory Model Formalisms: Introduction and Survey
by: Su, Roger C., et al.
Published: (2025)

Software Verification with CPAchecker 3.0: Tutorial and User Guide (Extended Version)
by: Baier, Daniel, et al.
Published: (2024)

MoXIchecker: An Extensible Model Checker for MoXI
by: Ates, Salih, et al.
Published: (2024)

Totality for Mixed Inductive and Coinductive Types
by: Hyvernat, Pierre
Published: (2019)

Explicit Weakening
by: Wadler, Philip
Published: (2024)

Ranking Functions for Linear-Constraint Loops
by: Ben-Amram, Amir M., et al.
Published: (2012)

TensorRight: Automated Verification of Tensor Graph Rewrites
by: Arora, Jai, et al.
Published: (2025)

Forall-Exists Relational Verification by Filtering to Forall-Forall
by: Nagasamudram, Ramana, et al.
Published: (2025)

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

Bayesian Separation Logic
by: Ho, Shing Hin, et al.
Published: (2025)

Bottom-up computation using trees of sublists (Functional Pearl)
by: Mu, Shin-Cheng
Published: (2023)

A HAT Trick: Automatically Verifying Representation Invariants Using Symbolic Finite Automata
by: Zhou, Zhe, et al.
Published: (2024)

Derivative-Guided Symbolic Execution
by: Yuan, Yongwei, et al.
Published: (2024)

Globality and Regions
by: Gramaglia, Hector
Published: (2025)

Homomorphism Calculus for User-Defined Aggregations
by: Wang, Ziteng, et al.
Published: (2025)