DOI,IST REx ID,Research Group,Title of publication
10.1145/2491956.2462184,2301,ToHe,P: Safe asynchronous event-driven programming
10.1007/978-3-642-40184-8_20,2327,ToHe,From model checking to model measuring
10.1007/978-3-642-39799-8_68,2445,ToHe,Efficient synthesis for concurrency by semantics-preserving transformations
10.1007/978-3-642-39799-8_54,2447,ToHe,Automating separation logic using SMT
10.1007/978-3-642-39212-2_3,2517,ToHe,Formalizing and reasoning about quality
10.1007/978-3-642-36742-7_5,2847,ToHe,Structural Counter Abstraction
10.1016/j.jcss.2012.12.001,2854,"KrCh,ToHe",Strategy improvement for concurrent reachability and turn based stochastic safety games
10.1007/978-3-642-36046-6,2885,ToHe,Mathematical and Engineering Methods in Computer Science
10.1145/2429069.2429109,2181,ToHe,Quantitative relaxation of concurrent data structures
10.1145/2429069.2429085,2182,ToHe,Quantitative abstraction refinement
10.1109/FMCAD.2013.6679386,1376,"KrCh,ToHe",Distributed synthesis for LTL fragments
10.1109/FMCAD.2013.6679394,1385,ToHe,Synthesizing multiple boolean functions using interpolation on a single proof
10.1007/978-3-642-39212-2_11,1387,ToHe,Nondeterminism in the presence of a diverse or unknown future
10.15479/at:ista:1405,1405,"ToHe,GradSch",Analysis of dynamic message passing programs
10.15479/AT:IST-2013-123-v1-1,5402,ToHe,How free is your linearizable concurrent data structure?
10.15479/AT:IST-2013-130-v1-1,5406,"KrCh,ToHe",Distributed synthesis for LTL Fragments
10.1007/978-3-642-39799-8_11,5747,ToHe,Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates
10.15479/AT:IST-2013-124-v1-1,6440,ToHe,Replacing competition with cooperation to achieve scalable lock-free FIFO queues 
10.1007/978-3-642-40184-8_18,2328,ToHe,Aspect-oriented linearizability proofs
10.1007/978-3-642-33386-6_14,10903,ToHe,Accurate invariant checking for programs manipulating lists and arrays with infinite data