decidability

Exact Bayesian Inference for Loopy Probabilistic Programs using Generating Functions
We present an exact Bayesian inference method for inferring posterior distributions encoded by probabilistic programs featuring …
PDF Cite Artifact Evaluated
Exact Bayesian Inference for Loopy Probabilistic Programs using Generating Functions
Does a Program Yield the Right Distribution?
We study discrete probabilistic programs with potentially unbounded looping behaviors over an infinite state space. We present, to the …
PDF Cite DOI Artifact Evaluated
Does a Program Yield the Right Distribution?
On Termination of Polynomial Programs with Equality Conditions
We investigate the termination problem of a family of multi-path polynomial programs (MPPs), in which all assignments to program …
PDF Cite Code DOI
On Termination of Polynomial Programs with Equality Conditions
In Memory of Oded Maler: Automatic Reachability Analysis of Hybrid-State Automata
Hybrid automata are an elegant formal model seamlessly integrating differential equations representing continuous dynamics with …
PDF Cite DOI
In Memory of Oded Maler: Automatic Reachability Analysis of Hybrid-State Automata
Reachability Analysis for Solvable Dynamical Systems
The reachability problem is one of the most important issues in the verification of hybrid systems. But unfortunately the reachable …
PDF Cite Code DOI
Reachability Analysis for Solvable Dynamical Systems
Computing Reachable Sets of Linear Vector Fields Revisited
The reachability problem is one of the most important issues in the verification of hybrid systems. But unfortunately the reachable …
PDF Cite Code Slides DOI
Computing Reachable Sets of Linear Vector Fields Revisited
Decidability of the Reachability for a Family of Linear Vector Fields
The reachability problem is one of the most important issues in the verification of hybrid systems. Computing the reachable sets of …
PDF Cite Code Slides DOI
Decidability of the Reachability for a Family of Linear Vector Fields