_id,doi,title
14318,10.1007/978-3-031-37709-9_2,"Automated tail bound analysis for probabilistic recurrence relations"
12000,10.1007/978-3-031-13185-1_4,"Sound and complete certificates for auantitative termination analysis of probabilistic programs"
12102,10.4230/LIPIcs.FSTTCS.2022.29,Algorithms and hardness results for computing cores of Markov chains
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
8089,10.1145/3385412.3385969,Polynomial invariant generation for non-deterministic recursive programs
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
6918,10.1016/j.ress.2019.106665,An efficient algorithm for computing network reliability in 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
7158,10.1145/3363525,Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth
6056,10.1109/BLOC.2019.8751326,Probabilistic smart contracts: Secure randomness on the blockchain
6175,10.1145/3314221.3314581,Cost analysis of nondeterministic probabilistic programs
6378,10.1145/3297280.3297319,"Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving"
6380,10.1145/3290366,Efficient parameterized algorithms for data packing
6490,10.1145/3297280.3297322,The treewidth of smart contracts
311,10.1007/978-3-319-89884-1_26,Quantitative analysis of smart contracts