_id,doi,title
4377,1557,It's Doomed; We Can Prove It
4383,10.1007/978-3-642-02658-4_26,Software transactional memory on relaxed memory models
4385,1533,Preventing versus curing: avoiding conflicts in transactional memories
4391,1548,Automated Analysis of Java Methods for Confidentiality
4403,10.1007/978-3-642-04027-6_9,Algorithmic analysis of array-accessing programs
4453,10.1007/978-3-642-02658-4_27,Sliding-window abstraction for infinite Markov chains
4535,10.1007/978-3-642-03845-7_12,Approximation of event probabilities in noisy cellular processes
4540,10.1109/LICS.2009.16,Expressiveness and closure properties for quantitative languages
4542,10.1007/978-3-642-03409-1_2,Alternating weighted automata
4543,10.1007/978-3-642-03816-7_4,Stochastic games with finitary objectives
4544,10.1137/1.9781611973068.23,Termination criteria for solving concurrent safety and reachability games
4545,10.1007/978-3-642-02930-1_1,A survey of stochastic games with limsup and liminf objectives