Copertina

Probabilistic unifying relations for modelling epistemic and aleatoric uncertainty: semantics and automated reasoning with theorem proving

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Ye, Kangfeng, Woodcock, Jim, Foster, Simon
Natura:	Preprint
Pubblicazione:	2023
Soggetti:	Logic in Computer Science Machine Learning Programming Languages
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Formally Verified Animation for RoboChart using Interaction Trees
di: Ye, Kangfeng, et al.
Pubblicazione: (2023)

RoboCertProb: Property Specification for Probabilistic RoboChart Models
di: Ye, Kangfeng, et al.
Pubblicazione: (2024)

Formal Verification of Physical Layer Security Protocols for Next-Generation Communication Networks (extended version)
di: Ye, Kangfeng, et al.
Pubblicazione: (2025)

ScenicProver: A Framework for Compositional Probabilistic Verification of Learning-Enabled Systems
di: Vin, Eric, et al.
Pubblicazione: (2025)

Unifying Model Execution and Deductive Verification with Interaction Trees in Isabelle/HOL
di: Foster, Simon, et al.
Pubblicazione: (2024)

Formal Analysis of the Sigmoid Function and Formal Proof of the Universal Approximation Theorem
di: Bryant, Dustin, et al.
Pubblicazione: (2025)

Higher-order bialgebraic semantics
di: Goncharov, Sergey, et al.
Pubblicazione: (2024)

Multi types and reasonable space
di: Accattoli, Beniamino, et al.
Pubblicazione: (2022)

Towards a Certified Proof Checker for Deep Neural Network Verification
di: Desmartin, Remi, et al.
Pubblicazione: (2023)

Loop Invariant Generation: A Hybrid Framework of Reasoning optimised LLMs and SMT Solvers
di: Bharti, Varun, et al.
Pubblicazione: (2025)

Boosting Few-Pixel Robustness Verification via Covering Verification Designs
di: Shapira, Yuval, et al.
Pubblicazione: (2024)

Smart Choices and the Selection Monad
di: Abadi, Martin, et al.
Pubblicazione: (2020)

Mini-Batch Robustness Verification of Deep Neural Networks
di: Tzour-Shaday, Saar, et al.
Pubblicazione: (2025)

Programmatic Reinforcement Learning: Navigating Gridworlds
di: Shabadi, Guruprerana, et al.
Pubblicazione: (2024)

Floating-Point Neural Networks Are Provably Robust Universal Approximators
di: Hwang, Geonho, et al.
Pubblicazione: (2025)

Neural Network Verification is a Programming Language Challenge
di: Cordeiro, Lucas C., et al.
Pubblicazione: (2025)

TensorRocq: Enabling diagrammatic reasoning in Rocq
di: Caldwell, Benjamin, et al.
Pubblicazione: (2026)

Complete first-order reasoning for functional programs
di: Murali, Adithya, et al.
Pubblicazione: (2026)

MiniF2F in Rocq: Automatic Translation Between Proof Assistants -- A Case Study
di: Viennot, Jules, et al.
Pubblicazione: (2025)

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

Redex -> Coq: towards a theory of decidability of Redex's reduction semantics
di: Soldevila, Mallku, et al.
Pubblicazione: (2024)

Syntactically and semantically regular languages of lambda-terms coincide through logical relations
di: Moreau, Vincent, et al.
Pubblicazione: (2023)

Modular Reasoning about Error Bounds for Concurrent Probabilistic Programs (Extended Version)
di: Li, Kwing Hei, et al.
Pubblicazione: (2025)

Modular Verification of Differential Privacy in Probabilistic Higher-Order Separation Logic (Extended Version)
di: Haselwarter, Philipp G., et al.
Pubblicazione: (2026)

Error Credits: Resourceful Reasoning about Error Bounds for Higher-Order Probabilistic Programs
di: Aguirre, Alejandro, et al.
Pubblicazione: (2024)

A bargain for mergesorts -- How to prove your mergesort correct and stable, almost for free
di: Cohen, Cyril, et al.
Pubblicazione: (2024)

A Probabilistic Choreography Language for PRISM
di: Carbone, Marco, et al.
Pubblicazione: (2025)

Denotational Semantics for Probabilistic and Concurrent Programs
di: Zilberstein, Noam, et al.
Pubblicazione: (2025)

A Nominal Approach to Probabilistic Separation Logic
di: Li, John M., et al.
Pubblicazione: (2024)

An In-Context Learning Agent for Formal Theorem-Proving
di: Thakur, Amitayush, et al.
Pubblicazione: (2023)

Lattice Annotated Temporal (LAT) Logic for Non-Markovian Reasoning
di: Mukherji, Kaustuv, et al.
Pubblicazione: (2025)

ProofWala: A Framework for Multilingual Proof Data Synthesis and Theorem-Proving
di: Thakur, Amitayush, et al.
Pubblicazione: (2025)

Decidable By Construction: Design-Time Verification for Trustworthy AI
di: Haynes, Houston
Pubblicazione: (2026)

Compile to Compress: Boosting Formal Theorem Provers by Compiler Outputs
di: Li, Guchan, et al.
Pubblicazione: (2026)

Verification Modulo Tested Library Contracts
di: Uppar, Abhishek, et al.
Pubblicazione: (2026)

Types, equations, dimensions and the Pi theorem
di: Botta, Nicola, et al.
Pubblicazione: (2023)

Bluebell: An Alliance of Relational Lifting and Independence For Probabilistic Reasoning
di: Bao, Jialu, et al.
Pubblicazione: (2024)

Probabilistic Concurrent Reasoning in Outcome Logic: Independence, Conditioning, and Invariants
di: Zilberstein, Noam, et al.
Pubblicazione: (2024)

Exact Bayesian Inference for Loopy Probabilistic Programs using Generating Functions
di: Klinkenberg, Lutz, et al.
Pubblicazione: (2023)

Contextual Refinement of Higher-Order Concurrent Probabilistic Programs (Extended Version)
di: Li, Kwing Hei, et al.
Pubblicazione: (2025)