_id,doi,title
3861,10.1016/j.ic.2009.07.004,Strategy logic
3863,10.1016/j.ic.2009.09.006,Strategy construction for parity games with imperfect information
3864,10.1007/978-3-642-14295-6_34,Measuring and synthesizing systems in probabilistic environments
3866,10.1007/978-3-642-14295-6_36,Robustness in the presence of liveness
3867,10.2168/LMCS-6(3:10)2010,Expressiveness and closure properties for quantitative languages
4361,10.1007/978-3-642-12032-9_8,Forward analysis of depth-bounded processes
4362,10.1007/978-3-642-16612-9_32,Runtime verification for software transactional memories
4369,10.1007/978-3-642-15297-9_13,From MTL to deterministic timed automata
4378,10.1007/978-3-642-11319-2_6,Building a calculus of data structures
4380,10.1145/1879021.1879022,A marketplace for cloud resources
4381,10.1109/CLOUD.2010.71,FlexPRICE: Flexible provisioning of resources in a cloud environment
4382,10.1145/1810479.1810529,Transactions in the jungle
4388,10.1007/978-3-642-14295-6_57,GIST: A solver for probabilistic games
4389,10.1109/ACSD.2010.26,Robustness of sequential circuits
4390,10.1007/978-3-642-14295-6_41,Model checking of linearizability of concurrent list implementations
4392,10.1007/978-3-642-13754-9_3,Quantitative Simulation Games
4393,10.1007/978-3-642-15375-4_18,Simulation distances
4396,10.1007/978-3-642-12029-9_19,Shape refinement through explicit heap analysis
5393,10.15479/AT:IST-2009-0003,Gist: A solver for probabilistic games
5394,10.15479/AT:IST-2009-0002,Improved lower bounds for request-response and finitary Streett games