DOI,IST REx ID,Research Group,Title of publication
10.1007/978-3-642-18275-4_26,3324,ToHe,Decision procedures for automating termination proofs
10.1145/1926385.1926454,3325,ToHe,Streaming transducers for algorithmic verification of single pass list processing programs
10.1007/978-3-642-24372-1_37,3326,ToHe,"What’s decidable about weighted automata"
10.1145/2001269.2001289,3352,ToHe,Biology as reactivity
10.1109/QEST.2011.40,3355,ToHe,Quantitative evaluation of BFT protocols
10.1007/978-3-642-21254-3_17,3357,"KrCh,ToHe",The complexity of request-response games
10.1145/1966445.1966476,3358,ToHe,Scheduling large jobs by abstraction refinement
10.1145/2038642.2038666,3359,ToHe,From boolean to quantitative synthesis
10.4230/LIPIcs.CSL.2011.82,3360,ToHe,Determinizing discounted-sum automata
10.1109/CSF.2011.21,3361,"ToHe,KrCh",The complexity of quantitative information flow problems
10.1007/978-3-642-23217-6_27,3362,ToHe,Dynamic reactive modules
10.48550/arXiv.1104.0127,3363,"KrCh,ToHe",The decidability frontier for probabilistic automata on infinite words
10.1016/j.tcs.2010.10.022,3364,ToHe,Approximation of event probabilities in noisy cellular processes
10.1007/978-3-642-19835-9_24,3365,"KrCh,ToHe",QUASY: quantitative synthesis tool
10.1007/978-3-642-22110-1_20,3366,"ToHe,KrCh",Quantitative synthesis for concurrent programs
10.1142/S0129054111008441,3381,ToHe,Formalisms for specifying Markovian population models
10.2168/LMCS-7(4:8)2011,3315,"KrCh,ToHe",Timed parity games: Complexity and robustness
null,3302,ToHe,Static scheduling in clouds
10.1109/LICS.2011.33,3356,"ToHe,KrCh",Temporal specifications with accumulative values
10.15479/AT:IST-2011-0003,5385,"ToHe,KrCh",Temporal specifications with accumulative values