_id,title
5457,"Cost analysis of nondeterministic probabilistic programs"
6426,"Synchronizing the asynchronous"
5455,"Optimal Dyck reachability for data-dependence and alias analysis"
5456,"Data-centric dynamic partial order reduction"
5447,"Average-case analysis of programs: Automated recurrence analysis for almost-linear bounds"
5448,"Data-centric dynamic partial order reduction"
5451,"Strong amplifiers of natural selection"
5449,"Amplification on undirected population structures: Comets beat stars"
5445,"Quantitative interprocedural analysis"
5452,"Arbitrarily strong amplifiers of natural selection"
5446,"Termination and worst-case analysis of recursive programs"
5453,"Arbitrarily strong amplifiers of natural selection"
5430,"Faster algorithms for quantitative verification in constant treewidth graphs"
5435,"Unifying two views on multiple mean-payoff objectives in Markov decision processes"
5442,"Algorithms for algebraic path properties in concurrent systems of constant treewidth components"
5431,"The patience of concurrent stochastic games with safety and reachability objectives"
5443,"A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs"
5429,"Unifying two views on multiple mean-payoff objectives in Markov decision processes"
5436,"Nested weighted automata"
5444,"Reconstructing robust phylogenies of metastatic cancers"
5432,"The complexity of evolutionary games on graphs"
5437,"Faster algorithms for quantitative verification in constant treewidth graphs"
5440,"The complexity of evolutionary games on graphs"
5438,"Edit distance for pushdown automata"
5434,"Optimal cost indefinite-horizon reachability in goal DEC-POMDPs"
5439,"The target discounted-sum problem"
5441,"Algorithms for algebraic path properties in concurrent systems of constant treewidth components"
5423,"A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks"
5428,"Quantitative fair simulation games"
5411,"Compositional specifications for IOCO testing"
5416,"Model measuring for hybrid systems"
5417,"From model checking to model measuring"
5424,"Qualitative analysis of POMDPs with temporal logic specifications for robotics applications"
5412,"CEGAR for qualitative analysis of probabilistic systems"
5420,"The value 1 problem for concurrent mean-payoff games"
5413,"CEGAR for qualitative analysis of probabilistic systems"
5418,"Games with a weak adversary"
5425,"Optimal cost almost-sure reachability in POMDPs"
5419,"Improved algorithms for reachability and shortest path on low tree-width graphs"
5421,"The complexity of evolution on graphs"
5426,"Qualitative analysis of POMDPs with temporal logic specifications for robotics applications"
5414,"CEGAR for qualitative analysis of probabilistic systems"
5427,"Optimal tree-decomposition balancing and reachability on low treewidth graphs"
5415,"Nested weighted automata"
5409,"Edit distance for timed automata"
6440,"Replacing competition with cooperation to achieve scalable lock-free FIFO queues "
5404,"The complexity of ergodic games"
5405,"Perfect-information stochastic mean-payoff parity games"
5400,"What is decidable about partially observable Markov decision processes with ω-regular objectives"
5406,"Distributed synthesis for LTL Fragments"
5402,"How free is your linearizable concurrent data structure?"
5399,"TTP: Tool for Tumor Progression"
5403,"Qualitative analysis of concurrent mean-payoff games"
5408,"The complexity of partial-observation stochastic parity games with finite-memory strategies"
5410,"Automatic generation of alternative starting positions for traditional board games"
5396,"Approximating marginals using discrete energy minimization"
5377,"Mean-payoff pushdown games"
5378,"Faster algorithms for alternating refinement relations"
5384,"Decidable problems for probabilistic automata on infinite words"
5380,"Bounded rationality in concurrent parity games"
5385,"Temporal specifications with accumulative values"
5386,"Enforcing topological constraints in random field image segmentation"
5381,"Partial-observation stochastic games: How to win when belief fails"
5379,"An O(n2) time algorithm for alternating Büchi games"
5382,"Robustness of structurally equivalent concurrent parity games"
5387,"Energy and mean-payoff parity Markov decision processes"
5383,"On an efficient decision procedure for imperative tree data structures"
5391,"Model checking of linearizability of concurrent list implementations"
5389,"Simulation distances"
5390,"Topological, automata-theoretic and logical characterization of finitary languages"
5388,"Quantitative synthesis for concurrent programs"
5392,"Probabilistic automata on infinite words: Decidability and undecidability results"
5393,"Gist: A solver for probabilistic games"
5394,"Improved lower bounds for request-response and finitary Streett games"
5395,"Qualitative analysis of partially-observable Markov decision processes"