Cover Image

Equivalence and Similarity Refutation for Probabilistic Programs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Chatterjee, Krishnendu, Goharshady, Ehsan Kafshdar, Novotný, Petr, Žikelić, Đorđe
Format:	Preprint
Published:	2024
Subjects:	Programming Languages Formal Languages and Automata Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Refuting Equivalence in Probabilistic Programs with Conditioning
by: Chatterjee, Krishnendu, et al.
Published: (2025)

SuperDP: Differential Privacy Refutation via Supermartingales
by: Chatterjee, Krishnendu, et al.
Published: (2026)

Weighted Automata for Exact Inference in Discrete Probabilistic Programs
by: Geißler, Dominik, et al.
Published: (2025)

Probabilistic Programming Meets Automata Theory: Exact Inference using Weighted Automata
by: Geißler, Dominik, et al.
Published: (2025)

Structural Abstraction and Refinement for Probabilistic Programs
by: Li, Guanyan, et al.
Published: (2025)

V-Star: Learning Visibly Pushdown Grammars from Program Inputs
by: Jia, Xiaodong, et al.
Published: (2024)

Type-Driven Prompt Programming: From Typed Interfaces to a Calculus of Constraints
by: Paul, Abhijit
Published: (2025)

CIR+CVN: Bridging LLM Semantic Understanding and Petri-Net Verification for Concurrent Programs
by: Zhang, Kaiwen, et al.
Published: (2026)

Systems of Graph Formulas and their Equivalence to Alternating Graph Automata
by: Drewes, Frank, et al.
Published: (2025)

Automated Formalization of Probabilistic Requirements from Structured Natural Language
by: Mavridou, Anastasia, et al.
Published: (2025)

Characterizing Implementability of Global Protocols with Infinite States and Data
by: Li, Elaine, et al.
Published: (2024)

Reactive graphs in action (extended version)
by: Tinoco, David, et al.
Published: (2024)

Synchronisability in Mailbox Communication
by: Di Giusto, Cinzia, et al.
Published: (2024)

Verification under TSO with an infinite Data Domain
by: Abdulla, Parosh Aziz, et al.
Published: (2024)

Automating the Analysis and Improvement of Dynamic Programming Algorithms with Applications to Natural Language Processing
by: Vieira, Tim
Published: (2026)

Abstract String Domain Defined with Word Equations as a Reduced Product (Extended Version)
by: Nepeivoda, Antonina, et al.
Published: (2025)

Saturating automata for game semantics
by: Dixon, Alex, et al.
Published: (2023)

Decision Procedure for A Theory of String Sequences
by: Hu, Denghang, et al.
Published: (2025)

An Automata-theoretic Basis for Specification and Type Checking of Multiparty Protocols
by: Stutz, Felix, et al.
Published: (2025)

Maximal and minimal dynamic Petri net slicing
by: Llorens, Marisa, et al.
Published: (2021)

Synthesizing DSLs for Few-Shot Learning
by: Krogmeier, Paul, et al.
Published: (2025)

Syntax Repair as Language Intersection
by: Considine, Breandan
Published: (2025)

Global Protocols under Rendezvous Synchrony: From Realizability to Type Checking
by: Li, Elaine, et al.
Published: (2026)

Polyregular equivalence is undecidable in higher-order types
by: Bojańczyk, Mikołaj, et al.
Published: (2026)

Linear Matching of JavaScript Regular Expressions
by: Barrière, Aurèle, et al.
Published: (2023)

Formally Verified Linear-Time Invertible Lexing
by: Chassot, Samuel, et al.
Published: (2025)

The Similarity Control Problem with Required Events
by: Wang, Yu, et al.
Published: (2026)

Sound and Complete Witnesses for Template-based Verification of LTL Properties on Polynomial Programs
by: Chatterjee, Krishnendu, et al.
Published: (2024)

On the Complexity of Language Membership for Probabilistic Words
by: Amarilli, Antoine, et al.
Published: (2025)

Conservative Perception Models for Probabilistic Verification
by: Cleaveland, Matthew, et al.
Published: (2025)

Parametrizing Reads-From Equivalence for Predictive Monitoring
by: Farzan, Azadeh, et al.
Published: (2026)

More on Maximally Permissive Similarity Control of Discrete Event Systems
by: Wang, Yu, et al.
Published: (2024)

A Probabilistic Model-Checking Framework for Cognitive Assessment and Training
by: De Maria, Elisabetta, et al.
Published: (2026)

Productive Quantum Programming Needs Better Abstract Machines
by: Núñez-Corrales, Santiago, et al.
Published: (2025)

Well-Formed Free-Choice Petri Nets Revisited
by: Jancar, Petr, et al.
Published: (2026)

Petri Nets-based Methods on Automatically Detecting for Concurrency Bugs in Rust Programs
by: Zhang, Kaiwen, et al.
Published: (2022)

A Bionic Natural Language Parser Equivalent to a Pushdown Automaton
by: Wei, Zhenghao, et al.
Published: (2024)

Duality-based Mode Operations and Pyramid Multilayer Mapping for Rhetorical Modes
by: Wu, Zi-Niu
Published: (2025)

Synchronous Signal Temporal Logic for Decidable Verification of Cyber-Physical Systems
by: Roop, Partha, et al.
Published: (2026)

Finding Regular Herbrand Models for CHCs using Answer Set Programming
by: Maire, Gregoire, et al.
Published: (2025)