_id,doi,title
1875,10.1007/978-3-319-10936-7_17,Cost-aware automatic program repair
2026,10.1007/978-3-319-11936-6_17,Rabinizer 3: Safraless translation of ltl to small deterministic automata
2027,10.1007/978-3-319-11936-6_8,Verification of markov decision processes using learning algorithms
2038,10.1145/2629686,Temporal specifications with accumulative values
2053,10.1007/978-3-662-44584-6_18,Probabilistic bisimulation: Naturally on distributions
2056,10.1007/s00285-013-0738-7,Markov chain aggregation and its applications to combinatorial reaction networks
2063,10.1007/978-3-319-08867-9_31,CEGAR for qualitative analysis of probabilistic systems
2167,10.1109/ICST.2014.50,Compositional specifications for IOCO testing
2187,10.1007/s00236-013-0191-5,Synthesizing robust systems
2190,10.1007/978-3-319-08867-9_13,From LTL to deterministic automata: A safraless compositional approach
2217,10.1145/2562059.2562130,Model measuring for hybrid systems
2218,10.1007/978-3-319-08867-9_38,Regression-free synthesis for concurrency
2233,10.2168/LMCS-10(1:10)2014,Exact and approximate determinization of discounted-sum automata
2239,10.1145/2535838.2535875,Battery transition systems
5411,10.15479/AT:IST-2014-148-v2-1,Compositional specifications for IOCO testing
5415,10.15479/AT:IST-2014-170-v1-1,Nested weighted automata
5416,10.15479/AT:IST-2014-171-v1-1,Model measuring for hybrid systems
5417,10.15479/AT:IST-2014-172-v1-1,From model checking to model measuring
5428,10.15479/AT:IST-2014-315-v1-1,Quantitative fair simulation games
1392,10.1007/978-3-642-54013-4_10,A logic-based framework for verifying consensus algorithms