| Gated Graph Sequence Neural Networks Y Li, D Tarlow, M Brockschmidt, R Zemel International Conference on Learning Representations (ICLR), 2016 | 1139 | 2016 |
| DeepCoder: Learning to Write Programs M Balog, AL Gaunt, M Brockschmidt, S Nowozin, D Tarlow International Conference on Learning Representations (ICLR), 2017 | 291 | 2017 |
| Learning to Represent Programs with Graphs M Allamanis, M Brockschmidt, M Khademi International Conference on Learning Representations (ICLR), 2018 | 221 | 2018 |
| Constrained Graph Variational Autoencoders for Molecule Design Q Liu, M Allamanis, M Brockschmidt, AL Gaunt Conference on Neural Information Processing Systems (NeurIPS), 2018 | 122 | 2018 |
| TerpreT: A Probabilistic Programming Language for Program Induction AL Gaunt, M Brockschmidt, R Singh, N Kushman, P Kohli, J Taylor, ... arXiv preprint arXiv:1608.04428, 2016 | 96 | 2016 |
| Proving termination of programs automatically with AProVE J Giesl, M Brockschmidt, F Emmes, F Frohn, C Fuhs, C Otto, M Plücker, ... International Joint Conference on Automated Reasoning (IJCAR), 184 - 191, 2014 | 90 | 2014 |
| Automated termination analysis of Java Bytecode by term rewriting C Otto, M Brockschmidt, C Von Essen, J Giesl Rewriting Techniques and Applications (RTA), 259-276, 2010 | 88 | 2010 |
| Better termination proving through cooperation M Brockschmidt, B Cook, C Fuhs International Conference on Computer Aided Verification (CAV), 413-429, 2013 | 85 | 2013 |
| Analyzing program termination and complexity automatically with AProVE J Giesl, C Aschermann, M Brockschmidt, F Emmes, F Frohn, C Fuhs, ... Journal of Automated Reasoning 58 (1), 3-31, 2017 | 81 | 2017 |
| Alternating runtime and size complexity analysis of integer programs M Brockschmidt, F Emmes, S Falke, C Fuhs, J Giesl Tools and Algorithms for the Construction and Analysis of Systems (TACAS …, 2014 | 70 | 2014 |
| Analyzing runtime and size complexity of integer programs M Brockschmidt, F Emmes, S Falke, C Fuhs, J Giesl ACM Transactions on Programming Languages and Systems (TOPLAS) 38 (4), 1-50, 2016 | 60 | 2016 |
| Automated detection of nontermination and NullPointerExceptions for Java Bytecode M Brockschmidt, T Ströder, C Otto, J Giesl Formal Verification of Object-Oriented Software (FoVeOOS), 123-141, 2012 | 54 | 2012 |
| Generative Code Modeling with Graphs M Brockschmidt, M Allamanis, AL Gaunt, O Polozov International Conference on Learning Representations (ICLR), 2019 | 48 | 2019 |
| T2: Temporal Property Verification M Brockschmidt, B Cook, S Ishtiaq, H Khlaaf, N Piterman Tools and Algorithms for the Construction and Analysis of Systems (TACAS …, 2016 | 45 | 2016 |
| Automated Termination Proofs for Java Programs with Cyclic Data. M Brockschmidt, R Musiol, C Otto, J Giesl International Conference on Computer Aided Verification (CAV), 105-122, 2012 | 42 | 2012 |
| Structured Neural Summarization P Fernandes, M Allamanis, M Brockschmidt International Conference on Learning Representations (ICLR), 2019 | 38 | 2019 |
| The COST IC0701 Verification Competition 2011 T Bormer, M Brockschmidt, D Distefano, G Ernst, JC Filliâtre, R Grigore, ... Formal Verification of Object-Oriented Software (FoVeOOS), 3-21, 2012 | 38 | 2012 |
| Graph Partition Neural Networks for Semi-Supervised Classification R Liao, M Brockschmidt, D Tarlow, A Gaunt, R Urtasun, R Zemel International Conference on Learning Representations [Workshop Track] (ICLR), 2018 | 32 | 2018 |
| Lower Runtime Bounds for Integer Programs F Frohn, M Naaf, J Hensel, M Brockschmidt, J Giesl International Joint Conference on Automated Reasoning, 2016 | 32 | 2016 |
| Modular termination proofs of recursive Java Bytecode programs by term rewriting M Brockschmidt, C Otto, J Giesl Rewriting Techniques and Applications (RTA), 155-170, 2011 | 31 | 2011 |
Jürgen GieslProfessor of Computer Science, RWTH Aachen UniversityVerified email at informatik.rwth-aachen.de
