1 citations · 2 across the 3 of their papers we have counts for
9 papers
Concentration-Bound Analysis for Probabilistic Programs and Probabilistic Recurrence Relations
Jinyi Wang, Yican Sun, Hongfei Fu +3
Analyzing probabilistic programs and randomized algorithms are classical problems in computer science. The first basic problem in the analysis of stochastic processes is to conside…
Inductive Reachability Witnesses
Ali Asadi, Krishnendu Chatterjee, Hongfei Fu +2
In this work, we consider the fundamental problem of reachability analysis over imperative programs with real variables. The reachability property requires that a program can reach…
Faster Algorithms for Quantitative Analysis of Markov Chains and Markov Decision Processes with Small Treewidth
Ali Asadi, Krishnendu Chatterjee, Amir Kafshdar Goharshady +2
Discrete-time Markov Chains (MCs) and Markov Decision Processes (MDPs) are two standard formalisms in system analysis. Their main associated quantitative objectives are hitting pro…
Optimal and Perfectly Parallel Algorithms for On-demand Data-flow Analysis
Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen +1
Interprocedural data-flow analyses form an expressive and useful paradigm of numerous static analysis applications, such as live variables analysis, alias analysis and null pointer…
Cost Analysis of Nondeterministic Probabilistic Programs
Peixin Wang, Hongfei Fu, Amir Kafshdar Goharshady +3
We consider the problem of expected cost analysis over nondeterministic probabilistic programs, which aims at automated methods for analyzing the resource-usage of such programs. P…
Probabilistic Smart Contracts: Secure Randomness on the Blockchain
Krishnendu Chatterjee, Amir Kafshdar Goharshady, Arash Pourdamghani
In today's programmable blockchains, smart contracts are limited to being deterministic and non-probabilistic. This lack of randomness is a consequential limitation, given that a w…