_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
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
2967,10.1145/2287718.2287727,Algorithmic analysis of array-accessing programs
3249,10.1016/j.tcs.2011.08.002,Simulation distances
3325,10.1145/1926385.1926454,Streaming transducers for algorithmic verification of single pass list processing programs
3359,10.1145/2038642.2038666,From boolean to quantitative synthesis
3361,10.1109/CSF.2011.21,The complexity of quantitative information flow problems
3366,10.1007/978-3-642-22110-1_20,Quantitative synthesis for concurrent programs
488,10.4230/LIPIcs.FSTTCS.2010.1,Expressiveness of streaming string transducers
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
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