_id,doi,title
1393,10.1145/2593882.2593900,Probabilistic programming
2445,10.1007/978-3-642-39799-8_68,Efficient synthesis for concurrency by semantics-preserving transformations
2447,10.1007/978-3-642-39799-8_54,Automating separation logic using SMT
2517,10.1007/978-3-642-39212-2_3,Formalizing and reasoning about quality
2847,10.1007/978-3-642-36742-7_5,Structural Counter Abstraction
2854,10.1016/j.jcss.2012.12.001,Strategy improvement for concurrent reachability and turn based stochastic safety games
2885,10.1007/978-3-642-36046-6,Mathematical and Engineering Methods in Computer Science
10898,10.1145/2482767.2482789,Distributed queues in shared memory: Multicore performance and scalability through quantitative relaxation
2181,10.1145/2429069.2429109,Quantitative relaxation of concurrent data structures
2182,10.1145/2429069.2429085,Quantitative abstraction refinement
2237,10.1007/978-3-642-45221-5_13,Tree interpolation in Vampire
2243,10.4230/LIPIcs.CSL.2013.563,Elementary modal logics over transitive structures
2288,10.1007/978-3-642-40708-6,Computational Methods in Systems Biology
2289,10.1007/s00450-013-0251-7,Quantitative reactive modeling and verification
2298,10.1007/978-3-642-38856-9_10,Local shape analysis for overlaid data structures
2299,10.1007/s10009-011-0207-9,Synthesis of AMBA AHB from formal specification: A case study
2301,10.1145/2491956.2462184,P: Safe asynchronous event-driven programming
2327,10.1007/978-3-642-40184-8_20,From model checking to model measuring
2328,10.1007/978-3-642-40184-8_18,Aspect-oriented linearizability proofs
5402,10.15479/AT:IST-2013-123-v1-1,How free is your linearizable concurrent data structure?