_id,doi,title
8934,10.15479/AT:ISTA:8934,Parameterized and algebro-geometric advances in static program analysis
9645,10.1145/3453483.3454076,Polynomial reachability witnesses via Stellensätze
9646,10.1145/3453483.3454102,Quantitative analysis of assertion violations in probabilistic programs
7810,10.1007/978-3-030-44914-8_5,Optimal and perfectly parallel algorithms for on-demand data-flow analysis
8671,10.29252/ijmsi.15.2.117,A note on belief structures and s-approximation spaces
8728,10.1007/978-3-030-59152-6_14,Faster algorithms for quantitative analysis of MCs and MDPs with small treewidth
6780,10.1145/3360555,Modular verification for almost-sure termination of probabilistic programs
7014,10.1145/3339984,Non-polynomial worst-case analysis of recursive programs
6056,10.1109/BLOC.2019.8751326,Probabilistic smart contracts: Secure randomness on the blockchain