DOI,IST REx ID,Research Group,Title of publication
10.1007/978-3-642-34059-8_20,2942,ToHe,Independent implementability of viewpoints
10.1145/2287718.2287727,2967,ToHe,Algorithmic analysis of array-accessing programs
10.1145/2362355.2362357,494,ToHe,"Translating to Co-Büchi made tight, unified, and useful"
10.1007/s10703-011-0131-3,531,ToHe,Verification of STM on relaxed memory models
10.15479/AT:IST-2011-0005,5383,ToHe,On an efficient decision procedure for imperative tree data structures
10.1007/978-3-642-25318-8_16,3264,ToHe,Solving recursion-free Horn clauses over LI+UIF
10.1145/2037509.2037510,3299,ToHe,Propagation models for computing biochemical reaction networks
null,3301,ToHe,Tail approximation for the chemical master equation
10.1109/SIES.2011.5953660,3316,"KrCh,ToHe",Specification-centered robustness
10.1007/978-3-642-22438-6_36,3323,ToHe,An efficient decision procedure for imperative tree data structures
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