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