_id,doi,title
1338,10.1007/s10703-016-0256-5,From non-preemptive to preemptive scheduling using synchronization synthesis
1729,10.1007/978-3-319-21668-3_11,From non-preemptive to preemptive scheduling using synchronization synthesis
1836,10.1007/978-3-662-46669-8_5,Segment abstraction for worst-case execution time analysis
1992,10.1145/2676726.2677008,Succinct representation of concurrent trace sets
1733,10.1016/j.tcs.2014.08.019,Interface simulation distances
2218,10.1007/978-3-319-08867-9_38,Regression-free synthesis for concurrency
2239,10.1145/2535838.2535875,Battery transition systems
2445,10.1007/978-3-642-39799-8_68,Efficient synthesis for concurrency by semantics-preserving transformations
2182,10.1145/2429069.2429085,Quantitative abstraction refinement
2890,10.1145/2380356.2380371,Synthesis from incompatible specifications
2916,10.4204/EPTCS.96.3,Interface Simulation Distances
3249,10.1016/j.tcs.2011.08.002,Simulation distances
3366,10.1007/978-3-642-22110-1_20,Quantitative synthesis for concurrent programs
5388,10.15479/AT:IST-2010-0004,Quantitative synthesis for concurrent programs
5389,10.15479/AT:IST-2010-0003,Simulation distances
5391,10.15479/AT:IST-2010-0001,Model checking of linearizability of concurrent list implementations
4388,10.1007/978-3-642-14295-6_57,GIST: A solver for probabilistic games
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