DOI,IST REx ID,Research Group,Title of publication
10.3390/g9030039,6006,ToHe,An abstraction-refinement methodology for reasoning about network games
10.1016/j.tcs.2017.11.001,608,ToHe,Synthesis from component libraries with costs
10.1109/TITS.2017.2778077,434,ToHe,Safety-assured model-driven design of the multifunction vehicle bus controller
10.4230/LIPIcs.CONCUR.2018.21,133,ToHe,Synchronizing the asynchronous
10.1007/978-3-319-96145-3_5,160,ToHe,Layered Concurrent Programs
10.1007/978-3-319-96145-3_25,140,ToHe,Space-time interpolants
10.1007/978-3-030-04612-5_2,5788,ToHe,Infinite-duration poorman-bidding games
10.1016/j.nahs.2016.09.001,1196,ToHe,Model measuring for discrete and hybrid systems
10.1007/s10703-016-0256-5,1338,ToHe,From non-preemptive to preemptive scheduling using synchronization synthesis
10.1007/s00236-016-0278-x,1351,"ToHe,CaGu,NiBa",Model checking the evolution of gene regulatory networks
10.1016/j.nahs.2016.04.006,1407,"ToHe,KrCh",Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games
10.1016/j.ic.2016.10.006,1066,"KrCh,ToHe",Quantitative fair simulation games
10.24963/ijcai.2017/11,1003,ToHe,An abstraction-refinement methodology for reasoning about network games
10.1007/978-3-662-54434-1_11,1011,"KrCh,ToHe",Faster algorithms for weighted recursive state machines
10.1145/3158121,10418,"KrCh,ToHe",A new proof rule for almost-sure termination
10.1145/3092703.3098225,941,ToHe,JFIX: Semantics-based repair of Java programs via symbolic  PathFinder
10.1145/3106237.3106309,942,ToHe,S3: Syntax- and semantic-guided repair synthesis via programming by examples
10.4230/LIPIcs.CONCUR.2017.21,950,"ToHe,KrCh",Infinite-duration bidding games
10.4230/LIPIcs.MFCS.2017.37,963,ToHe,Timed network games with clocks
10.23638/LMCS-13(3:23)2017,465,"KrCh,ToHe",Edit distance for pushdown automata