_id,doi,title
9644,10.1145/3453483.3454093,Proving non-termination by program reversal
9645,10.1145/3453483.3454076,Polynomial reachability witnesses via Stellensätze
9646,10.1145/3453483.3454102,Quantitative analysis of assertion violations in probabilistic programs
10002,10.1109/LICS52264.2021.9470739,Symbolic time and space tradeoffs for probabilistic verification
10004,10.1109/LICS52264.2021.9470595,Stochastic processes with expected stopping time
10052,10.4230/LIPIcs.CONCUR.2021.18,Decomposing permutation automata
10054,10.4230/LIPIcs.ICALP.2021.124,Faster algorithms for bounded liveness in graphs and game graphs
10055,10.4230/LIPIcs.STACS.2021.44,A Ramsey theorem for finite monoids
10075,10.4230/LIPIcs.MFCS.2021.53,A bit of nondeterminism makes pushdown automata expressive and succinct
10191,10.1145/3485541,The reads-from equivalence for the TSO and PSO memory models
10199,10.15479/at:ista:10199,Improved verification techniques for concurrent systems
10293,10.15479/at:ista:10293,Evolution of cooperation via (in)direct reciprocity under imperfect information
10414,10.1007/978-3-030-90870-6_33,On lexicographic proof rules for probabilistic termination
10629,10.4230/LIPIcs.FSTTCS.2021.42,Quantitative verification on product graphs of small treewidth
10630,10.4230/LIPIcs.FSTTCS.2021.34,On the complexity of intersection non-emptiness for star-free language classes
12767,10.1007/978-3-030-72016-2,On satisficing in quantitative games
9987,10.1007/978-3-030-81685-8_16,Stateless model checking under a reads-value-from equivalence
9997,10.1038/s41598-021-96932-1,The evolution of indirect reciprocity under action and assessment generosity
7810,10.1007/978-3-030-44914-8_5,Optimal and perfectly parallel algorithms for on-demand data-flow analysis
7955,10.1145/3373718.3394761,Approximating values of generalized-reachability stochastic games