default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarc Brockschmidt
Person information
- affiliation: Google DeepMind, UK
- affiliation (former): RWTH Aachen University, Germany
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2026
[i30]Aditya Kini, Satish Chandra, Milad Hashemi, Saksham Thakur, Aditya Pandey, Vincent Nguyen, Marc Brockschmidt, Franjo Ivancic, Danny Tarlow, Parthasarathy Ranganathan, Petros Maniatis, Ahmed Omran, Zaheer Abbas, Anita Gergely, Martin Sevenich, Gufeng Zhang, Amy Hua, Alexander Frömmgen:
Customizing an LLM for Enterprise Software Engineering. CoRR abs/2605.16517 (2026)- 2023
- [c42]Leon Klein, Andrew Y. K. Foong, Tor Erlend Fjelde, Bruno Mlodozeniec, Marc Brockschmidt, Sebastian Nowozin, Frank Noé, Ryota Tomioka:
Timewarp: Transferable Acceleration of Molecular Dynamics by Learning Time-Coarsened Dynamics. NeurIPS 2023 - [i29]Leon Klein, Andrew Y. K. Foong
, Tor Erlend Fjelde, Bruno Mlodozeniec, Marc Brockschmidt, Sebastian Nowozin, Frank Noé, Ryota Tomioka:
Timewarp: Transferable Acceleration of Molecular Dynamics by Learning Time-Coarsened Dynamics. CoRR abs/2302.01170 (2023) - 2022
- [j5]Dobrik Georgiev, Marc Brockschmidt, Miltiadis Allamanis:
HEAT: Hyperedge Attention Networks. Trans. Mach. Learn. Res. 2022 (2022) - [c41]Daya Guo, Alexey Svyatkovskiy, Jian Yin, Nan Duan, Marc Brockschmidt, Miltiadis Allamanis:
Learning to Complete Code with Sketches. ICLR 2022 - [c40]Krzysztof Maziarz, Henry Richard Jackson-Flux, Pashmina Cameron, Finton Sirockin, Nadine Schneider, Nikolaus Stiefl, Marwin H. S. Segler, Marc Brockschmidt:
Learning to Extend Molecular Scaffolds with Structural Motifs. ICLR 2022 - [c39]Chencheng Liang, Philipp Rümmer, Marc Brockschmidt:
Exploring Representation of Horn clauses using GNNs. PAAR@IJCAR 2022 - [i28]Dobrik Georgiev, Marc Brockschmidt, Miltiadis Allamanis:
HEAT: Hyperedge Attention Networks. CoRR abs/2201.12113 (2022) - [i27]Chencheng Liang, Philipp Rümmer, Marc Brockschmidt:
Exploring Representation of Horn Clauses using GNNs (Extended Technique Report). CoRR abs/2206.06986 (2022) - 2021
- [c38]Sheena Panthaplackel, Miltiadis Allamanis, Marc Brockschmidt:
Copy That! Editing Sequences by Copying Spans. AAAI 2021: 13622-13630 - [c37]Miltiadis Allamanis, Henry Jackson-Flux, Marc Brockschmidt:
Self-Supervised Bug Detection and Repair. NeurIPS 2021: 27865-27876 - [c36]Megan Stanley, John Bronskill, Krzysztof Maziarz, Hubert Misztela, Jessica Lanini, Marwin H. S. Segler, Nadine Schneider, Marc Brockschmidt:
FS-Mol: A Few-Shot Learning Dataset of Molecules. NeurIPS Datasets and Benchmarks 2021 - [i26]Krzysztof Maziarz, Henry Jackson-Flux, Pashmina Cameron, Finton Sirockin, Nadine Schneider, Nikolaus Stiefl, Marc Brockschmidt:
Learning to Extend Molecular Scaffolds with Structural Motifs. CoRR abs/2103.03864 (2021) - [i25]Miltiadis Allamanis, Henry Jackson-Flux, Marc Brockschmidt:
Self-Supervised Bug Detection and Repair. CoRR abs/2105.12787 (2021) - [i24]Daya Guo, Alexey Svyatkovskiy, Jian Yin, Nan Duan, Marc Brockschmidt, Miltiadis Allamanis:
Learning to Generate Code Sketches. CoRR abs/2106.10158 (2021) - 2020
- [j4]Florian Frohn, Matthias Naaf, Marc Brockschmidt, Jürgen Giesl:
Inferring Lower Runtime Bounds for Integer Programs. ACM Trans. Program. Lang. Syst. 42(3): 13:1-13:50 (2020) - [c35]Santiago Zanella-Béguelin, Lukas Wutschitz, Shruti Tople, Victor Rühle, Andrew Paverd, Olga Ohrimenko, Boris Köpf, Marc Brockschmidt:
Analyzing Information Leakage of Updates to Natural Language Models. CCS 2020: 363-375 - [c34]Marc Brockschmidt:
GNN-FiLM: Graph Neural Networks with Feature-wise Linear Modulation. ICML 2020: 1144-1152 - [i23]Sheena Panthaplackel, Miltiadis Allamanis, Marc Brockschmidt:
Copy that! Editing Sequences by Copying Spans. CoRR abs/2006.04771 (2020)
2010 – 2019
- 2019
- [c33]Marc Brockschmidt, Miltiadis Allamanis, Alexander L. Gaunt, Oleksandr Polozov:
Generative Code Modeling with Graphs. ICLR (Poster) 2019 - [c32]Patrick Fernandes, Miltiadis Allamanis, Marc Brockschmidt:
Structured Neural Summarization. ICLR (Poster) 2019 - [c31]Pengcheng Yin, Graham Neubig, Miltiadis Allamanis, Marc Brockschmidt, Alexander L. Gaunt:
Learning to Represent Edits. ICLR (Poster) 2019 - [c30]Matthew Danish, Miltiadis Allamanis, Marc Brockschmidt, Andrew C. Rice, Dominic Orchard:
Learning units-of-measure from scientific code. SE4Science@ICSE 2019: 43-46 - [c29]Eui Chul Richard Shin, Miltiadis Allamanis, Marc Brockschmidt, Alex Polozov:
Program Synthesis and Semantic Parsing with Learned Code Idioms. NeurIPS 2019: 10824-10834 - [i22]Richard Shin, Miltiadis Allamanis, Marc Brockschmidt, Oleksandr Polozov:
Program Synthesis and Semantic Parsing with Learned Code Idioms. CoRR abs/1906.10816 (2019) - [i21]Marc Brockschmidt:
GNN-FiLM: Graph Neural Networks with Feature-wise Linear Modulation. CoRR abs/1906.12192 (2019) - [i20]Hamel Husain, Ho-Hsiang Wu, Tiferet Gazit, Miltiadis Allamanis, Marc Brockschmidt:
CodeSearchNet Challenge: Evaluating the State of Semantic Code Search. CoRR abs/1909.09436 (2019) - [i19]Niklas Stoehr, Marc Brockschmidt, Jan Stuehmer, Emine Yilmaz:
Disentangling Interpretable Generative Parameters of Random and Real-World Graphs. CoRR abs/1910.05639 (2019) - [i18]Florian Frohn, Matthias Naaf, Marc Brockschmidt, Jürgen Giesl:
Inferring Lower Runtime Bounds for Integer Programs. CoRR abs/1911.01077 (2019) - [i17]Shruti Tople, Marc Brockschmidt, Boris Köpf, Olga Ohrimenko, Santiago Zanella-Béguelin:
Analyzing Privacy Loss in Updates of Natural Language Models. CoRR abs/1912.07942 (2019) - 2018
- [c28]Miltiadis Allamanis, Marc Brockschmidt, Mahmoud Khademi:
Learning to Represent Programs with Graphs. ICLR 2018 - [c27]Renjie Liao, Marc Brockschmidt, Daniel Tarlow, Alexander L. Gaunt, Raquel Urtasun, Richard S. Zemel:
Graph Partition Neural Networks for Semi-Supervised Classification. ICLR (Workshop) 2018 - [c26]Qi Liu, Miltiadis Allamanis, Marc Brockschmidt, Alexander L. Gaunt:
Constrained Graph Variational Autoencoders for Molecule Design. NeurIPS 2018: 7806-7815 - [c25]Marc Brockschmidt:
Learning from code with graphs (keynote). NL4SE@ESEC/SIGSOFT FSE 2018: 1 - [i16]Renjie Liao, Marc Brockschmidt, Daniel Tarlow, Alexander L. Gaunt, Raquel Urtasun, Richard S. Zemel:
Graph Partition Neural Networks for Semi-Supervised Classification. CoRR abs/1803.06272 (2018) - [i15]Marc Brockschmidt, Miltiadis Allamanis, Alexander L. Gaunt, Oleksandr Polozov:
Generative Code Modeling with Graphs. CoRR abs/1805.08490 (2018) - [i14]Qi Liu, Miltiadis Allamanis, Marc Brockschmidt, Alexander L. Gaunt:
Constrained Graph Variational Autoencoders for Molecule Design. CoRR abs/1805.09076 (2018) - [i13]Chenglong Wang, Po-Sen Huang, Alex Polozov, Marc Brockschmidt, Rishabh Singh:
Execution-Guided Neural Program Decoding. CoRR abs/1807.03100 (2018) - [i12]Pengcheng Yin, Graham Neubig, Miltiadis Allamanis, Marc Brockschmidt, Alexander L. Gaunt:
Learning to Represent Edits. CoRR abs/1810.13337 (2018) - [i11]Patrick Fernandes, Miltiadis Allamanis, Marc Brockschmidt:
Structured Neural Summarization. CoRR abs/1811.01824 (2018) - 2017
- [j3]Jürgen Giesl, Cornelius Aschermann, Marc Brockschmidt, Fabian Emmes, Florian Frohn, Carsten Fuhs, Jera Hensel, Carsten Otto, Martin Plücker, Peter Schneider-Kamp, Thomas Ströder, Stephanie Swiderski, René Thiemann:
Analyzing Program Termination and Complexity Automatically with AProVE. J. Autom. Reason. 58(1): 3-31 (2017) - [j2]Thomas Ströder, Jürgen Giesl, Marc Brockschmidt, Florian Frohn, Carsten Fuhs, Jera Hensel, Peter Schneider-Kamp, Cornelius Aschermann:
Automatically Proving Termination and Memory Safety for Programs with Pointer Arithmetic. J. Autom. Reason. 58(1): 33-65 (2017) - [c24]Marc Brockschmidt, Sebastiaan J. C. Joosten, René Thiemann, Akihisa Yamada:
Certifying Safety and Termination Proofs for Integer Transition Systems. CADE 2017: 454-471 - [c23]Matthias Naaf, Florian Frohn, Marc Brockschmidt, Carsten Fuhs, Jürgen Giesl:
Complexity Analysis for Term Rewriting by Integer Transition Systems. FroCoS 2017: 132-150 - [c22]Matej Balog, Alexander L. Gaunt, Marc Brockschmidt, Sebastian Nowozin, Daniel Tarlow:
DeepCoder: Learning to Write Programs. ICLR (Poster) 2017 - [c21]John K. Feser, Marc Brockschmidt, Alexander L. Gaunt, Daniel Tarlow:
Neural Functional Programming. ICLR (Workshop) 2017 - [c20]Alexander L. Gaunt, Marc Brockschmidt, Nate Kushman, Daniel Tarlow:
Lifelong Perceptual Programming By Example. ICLR (Workshop) 2017 - [c19]Chengtao Li, Daniel Tarlow, Alexander L. Gaunt, Marc Brockschmidt, Nate Kushman:
Neural Program Lattices. ICLR (Poster) 2017 - [c18]Alexander L. Gaunt, Marc Brockschmidt, Nate Kushman, Daniel Tarlow:
Differentiable Programs with Neural Libraries. ICML 2017: 1213-1222 - [c17]Marc Brockschmidt, Yuxin Chen, Pushmeet Kohli, Siddharth Krishna, Daniel Tarlow:
Learning Shape Analysis. SAS 2017: 66-87 - [c16]Cristina Borralleras, Marc Brockschmidt, Daniel Larraz, Albert Oliveras, Enric Rodríguez-Carbonell, Albert Rubio:
Proving Termination Through Conditional Termination. TACAS (1) 2017: 99-117 - [i10]Miltiadis Allamanis, Marc Brockschmidt:
SmartPaste: Learning to Adapt Source Code. CoRR abs/1705.07867 (2017) - [i9]Miltiadis Allamanis, Marc Brockschmidt, Mahmoud Khademi:
Learning to Represent Programs with Graphs. CoRR abs/1711.00740 (2017) - 2016
- [j1]Marc Brockschmidt, Fabian Emmes, Stephan Falke, Carsten Fuhs, Jürgen Giesl:
Analyzing Runtime and Size Complexity of Integer Programs. ACM Trans. Program. Lang. Syst. 38(4): 13:1-13:50 (2016) - [c15]Florian Frohn, Matthias Naaf, Jera Hensel, Marc Brockschmidt, Jürgen Giesl:
Lower Runtime Bounds for Integer Programs. IJCAR 2016: 550-567 - [c14]Marc Brockschmidt, Byron Cook, Samin Ishtiaq, Heidy Khlaaf, Nir Piterman:
T2: Temporal Property Verification. TACAS 2016: 387-393 - [c13]Yujia Li, Daniel Tarlow, Marc Brockschmidt, Richard S. Zemel:
Gated Graph Sequence Neural Networks. ICLR (Poster) 2016 - [i8]Alexander L. Gaunt, Marc Brockschmidt, Rishabh Singh, Nate Kushman, Pushmeet Kohli, Jonathan Taylor, Daniel Tarlow:
TerpreT: A Probabilistic Programming Language for Program Induction. CoRR abs/1608.04428 (2016) - [i7]John K. Feser, Marc Brockschmidt, Alexander L. Gaunt, Daniel Tarlow:
Neural Functional Programming. CoRR abs/1611.01988 (2016) - [i6]Matej Balog, Alexander L. Gaunt, Marc Brockschmidt, Sebastian Nowozin, Daniel Tarlow:
DeepCoder: Learning to Write Programs. CoRR abs/1611.01989 (2016) - [i5]Alexander L. Gaunt, Marc Brockschmidt, Nate Kushman, Daniel Tarlow:
Lifelong Perceptual Programming By Example. CoRR abs/1611.02109 (2016) - [i4]Alexander L. Gaunt, Marc Brockschmidt, Rishabh Singh, Nate Kushman, Pushmeet Kohli, Jonathan Taylor, Daniel Tarlow:
Summary - TerpreT: A Probabilistic Programming Language for Program Induction. CoRR abs/1612.00817 (2016) - 2015
- [c12]Marc Brockschmidt, Daniel Larraz, Albert Oliveras, Enric Rodríguez-Carbonell, Albert Rubio:
Compositional Safety Verification with Max-SMT. FMCAD 2015: 33-40 - [i3]Marc Brockschmidt, Daniel Larraz, Albert Oliveras, Enric Rodríguez-Carbonell, Albert Rubio:
Compositional Safety Verification with Max-SMT. CoRR abs/1507.03851 (2015) - [i2]Marc Brockschmidt, Byron Cook, Samin Ishtiaq, Heidy Khlaaf, Nir Piterman:
T2: Temporal Property Verification. CoRR abs/1512.08689 (2015) - 2014
- [b1]Marc Manuel Johannes Brockschmidt:
Termination analysis for imperative programs operating on the heap. RWTH Aachen University, 2014 - [c11]Jürgen Giesl, Marc Brockschmidt, Fabian Emmes, Florian Frohn, Carsten Fuhs, Carsten Otto, Martin Plücker, Peter Schneider-Kamp, Thomas Ströder, Stephanie Swiderski, René Thiemann:
Proving Termination of Programs Automatically with AProVE. IJCAR 2014: 184-191 - [c10]Thomas Ströder, Jürgen Giesl, Marc Brockschmidt, Florian Frohn, Carsten Fuhs, Jera Hensel, Peter Schneider-Kamp:
Proving Termination and Memory Safety for Programs with Pointer Arithmetic. IJCAR 2014: 208-223 - [c9]Tewodros A. Beyene, Marc Brockschmidt, Andrey Rybalchenko:
CTL+FO verification as constraint solving. SPIN 2014: 101-104 - [c8]Marc Brockschmidt, Fabian Emmes, Stephan Falke, Carsten Fuhs, Jürgen Giesl:
Alternating Runtime and Size Complexity Analysis of Integer Programs. TACAS 2014: 140-155 - [i1]Tewodros A. Beyene, Marc Brockschmidt, Andrey Rybalchenko:
CTL+FO Verification as Constraint Solving. CoRR abs/1406.3988 (2014) - 2013
- [c7]Marc Brockschmidt, Byron Cook, Carsten Fuhs:
Better Termination Proving through Cooperation. CAV 2013: 413-429 - 2012
- [c6]Marc Brockschmidt, Richard Musiol, Carsten Otto, Jürgen Giesl:
Automated Termination Proofs for Java Programs with Cyclic Data. CAV 2012: 105-122 - 2011
- [c5]Thorsten Bormer, Marc Brockschmidt, Dino Distefano, Gidon Ernst, Jean-Christophe Filliâtre, Radu Grigore, Marieke Huisman, Vladimir Klebanov, Claude Marché, Rosemary Monahan, Wojciech Mostowski, Nadia Polikarpova, Christoph Scheben, Gerhard Schellhorn, Bogdan Tofan, Julian Tschannen, Mattias Ulbrich:
The COST IC0701 Verification Competition 2011. FoVeOOS 2011: 3-21 - [c4]Marc Brockschmidt, Thomas Ströder, Carsten Otto, Jürgen Giesl:
Automated Detection of Non-termination and NullPointerExceptions for Java Bytecode. FoVeOOS 2011: 123-141 - [c3]Marc Brockschmidt, Carsten Otto, Jürgen Giesl:
Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting. RTA 2011: 155-170 - 2010
- [c2]Marc Brockschmidt, Carsten Otto, Christian von Essen, Jürgen Giesl:
Termination Graphs for Java Bytecode. Verification, Induction, Termination Analysis 2010: 17-37 - [c1]Carsten Otto, Marc Brockschmidt, Christian von Essen, Jürgen Giesl:
Automated Termination Analysis of Java Bytecode by Term Rewriting. RTA 2010: 259-276
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-06-12 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
