Imagen de Portada

Higher-Order Weakest Precondition Transformers via a CPS Transformation

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Kura, Satoshi
Formato:	Preprint
Publicado:	2023
Materias:	Logic in Computer Science
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Automated Verification of Higher-Order Probabilistic Programs via a Dependent Refinement Type System
por: Kura, Satoshi, et al.
Publicado: (2024)

On Complete Categorical Semantics for Effect Handlers
por: Kura, Satoshi
Publicado: (2026)

A Denotational Product Construction for Temporal Verification of Effectful Higher-Order Programs
por: Watanabe, Kazuki, et al.
Publicado: (2025)

A Weakest Precondition Calculus for Programs and Linear Temporal Specifications
por: Ernst, Gidon
Publicado: (2026)

A Hierarchy of Supermartingales for $ω$-Regular Verification
por: Kura, Satoshi, et al.
Publicado: (2025)

Formal Verification of Probing Security via Conditional Independence
por: Kura, Satoshi, et al.
Publicado: (2026)

A Neurosymbolic Approach to Loop Invariant Generation via Weakest Precondition Reasoning
por: King, Daragh, et al.
Publicado: (2025)

Supermartingales for Unique Fixed Points: A Unified Approach to Lower Bound Verification
por: Kura, Satoshi, et al.
Publicado: (2025)

LLMs and Fuzzing in Tandem: A New Approach to Automatically Generating Weakest Preconditions
por: King, Daragh, et al.
Publicado: (2025)

A Category-Theoretic Framework for Dependent Effect Systems
por: Kura, Satoshi, et al.
Publicado: (2026)

Logical relations for call-by-push-value models, via internal fibrations in a 2-category
por: de Amorim, Pedro H. Azevedo, et al.
Publicado: (2025)

Quantitative Weakest Hyper Pre: Unifying Correctness and Incorrectness Hyperproperties via Predicate Transformers
por: Zhang, Linpeng, et al.
Publicado: (2024)

Induction and Recursion Principles in a Higher-Order Quantitative Logic for Probability
por: Bacci, Giorgio, et al.
Publicado: (2025)

Dual Forgetting Operators in the Context of Weakest Sufficient and Strongest Necessary Conditions
por: Doherty, Patrick, et al.
Publicado: (2023)

RTAMT -- Runtime Robustness Monitors with Application to CPS and Robotics
por: Yamaguchi, Tomoya, et al.
Publicado: (2025)

Unifying Sequent Systems for Gödel-Löb Provability Logic via Syntactic Transformations
por: Lyon, Tim S.
Publicado: (2024)

SAT-Inspired Higher-Order Eliminations
por: Blanchette, Jasmin, et al.
Publicado: (2022)

Hammering Higher Order Set Theory
por: Brown, Chad E., et al.
Publicado: (2025)

Kuroda's Translation for Higher-Order Logic
por: Traversié, Thomas
Publicado: (2024)

Higher Order Automatic Differentiation of Higher Order Functions
por: Huot, Mathieu, et al.
Publicado: (2021)

Syntactic Effectful Realizability in Higher-Order Logic
por: Cohen, Liron, et al.
Publicado: (2025)

The Computability Path Order for Beta-Eta-Normal Higher-Order Rewriting (Full Version)
por: Niederhauser, Johannes, et al.
Publicado: (2025)

Higher-Order Constrained Dependency Pairs for (Universal) Computability
por: Guo, Liye, et al.
Publicado: (2024)

Free Monads, Intrinsic Scoping, and Higher-Order Preunification
por: Kudasov, Nikolai
Publicado: (2022)

Unification of Deterministic Higher-Order Patterns (Full Version)
por: Niederhauser, Johannes, et al.
Publicado: (2026)

Expectation-based Analysis of Higher-Order Quantum Programs
por: Avanzini, Martin, et al.
Publicado: (2025)

Big Steps in Higher-Order Mathematical Operational Semantics
por: Goncharov, Sergey, et al.
Publicado: (2025)

Equilibrium Semantics and Strong Equivalence for Higher-Order Logic Programs
por: Charalambidis, Angelos, et al.
Publicado: (2026)

Computing Supported Models via Transformation to Stable Models
por: Li, Fang, et al.
Publicado: (2025)

Higher Order Model Checking in Isabelle for Human Centric Infrastructure Security
por: Kammüller, Florian
Publicado: (2023)

A Category-Theoretic Perspective on Higher-Order Approximation Fixpoint Theory
por: Pollaci, Samuele, et al.
Publicado: (2024)

Higher-Order Asynchronous Effects
por: Ahman, Danel, et al.
Publicado: (2023)

Tableaux for Automated Reasoning in Dependently-Typed Higher-Order Logic (Extended Version)
por: Niederhauser, Johannes, et al.
Publicado: (2024)

Termination of Graph Transformation Systems via Generalized Weighted Type Graphs
por: Endrullis, Jörg, et al.
Publicado: (2023)

Taking Bi-Intuitionistic Logic First-Order: A Proof-Theoretic Investigation via Polytree Sequents
por: Lyon, Tim S., et al.
Publicado: (2024)

Towards a Higher-Order Bialgebraic Denotational Semantics
por: Goncharov, Sergey, et al.
Publicado: (2026)

Unravelling Cyclic First-Order Arithmetic
por: Leigh, Graham E., et al.
Publicado: (2025)

Bialgebraic Reasoning on Higher-Order Program Equivalence
por: Goncharov, Sergey, et al.
Publicado: (2024)

Revisiting the Fast Fourier Transform in Rocq
por: Théry, Laurent
Publicado: (2022)

Approximate Relational Reasoning for Higher-Order Probabilistic Programs
por: Haselwarter, Philipp G., et al.
Publicado: (2024)