_id,doi,title
1407,10.1016/j.nahs.2016.04.006,Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games
941,10.1145/3092703.3098225,JFIX: Semantics-based repair of Java programs via symbolic  PathFinder
942,10.1145/3106237.3106309,S3: Syntax- and semantic-guided repair synthesis via programming by examples
950,10.4230/LIPIcs.CONCUR.2017.21,Infinite-duration bidding games
962,10.1007/978-3-319-63390-9_21,Model counting for recursively-defined strings
963,10.4230/LIPIcs.MFCS.2017.37,Timed network games with clocks
1003,10.24963/ijcai.2017/11,An abstraction-refinement methodology for reasoning about network games
1011,10.1007/978-3-662-54434-1_11,Faster algorithms for weighted recursive state machines
10418,10.1145/3158121,A new proof rule for almost-sure termination
1196,10.1016/j.nahs.2016.09.001,Model measuring for discrete and hybrid systems
1090,10.4230/LIPIcs.MFCS.2016.24,Nested weighted limit-average automata of bounded width
1093,10.4230/LIPIcs.CONCUR.2016.20,Linear distances between Markov chains
1095,10.4230/LIPIcs.CONCUR.2016.6,Local linearizability for concurrent container-type data structures
1103,10.1109/MEMCOD.2016.7797741,Parallel reachability analysis for hybrid systems
1130,10.15479/at:ista:1130,Automatic synthesis of synchronisation primitives for concurrent programs
1134,10.1109/CCA.2016.7587948,Tutorial: Software tools for hybrid systems verification transformation and synthesis C2E2 HyST and TuLiP
1135,10.1145/2968478.2968499,Synthesizing time triggered schedules for switched networks with faulty links
1138,10.1145/2933575.2933588,Quantitative automata under probabilistic semantics
1148,10.1016/j.biosystems.2016.07.005,Adaptive moment closure for parameter inference of biochemical reaction networks
1166,,A symbolic SAT based algorithm for almost sure reachability with small strategies in pomdps