4 papers
A Fast Algorithm for Finding Minimum Weight Cycles in Mining Cyclic Graph Topologies
Heman Shakeri, Torben Amtoft, Behnaz Moradi-Jamei +2
Cyclic structures are fundamental topological features in graphs, playing critical roles in network robustness, information flow, community structure, and various dynamic processes…
A Fixed Point Iteration Technique for Proving Correctness of Slicing for Probabilistic Programs
Torben Amtoft, Anindya Banerjee
When proving the correctness of a method for slicing probabilistic programs, it was previously discovered by the authors that for a fixed point iteration to work one needs a non-st…
A Semantics for Probabilistic Control-Flow Graphs
Torben Amtoft, Anindya Banerjee
This article develops a novel operational semantics for probabilistic control-flow graphs (pCFGs) of probabilistic imperative programs with random assignment and "observe" (or cond…
A Theory of Slicing for Probabilistic Control-Flow Graphs
Torben Amtoft, Anindya Banerjee
We present a theory for slicing probabilistic imperative programs -- containing random assignments, and ``observe'' statements (for conditioning) -- represented as probabilistic co…