default search action
Markus N. Rabe
Person information
- affiliation: Google Inc.
- affiliation (former): Saarland University, Department of Computer Science
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c29]Emily First
, Markus N. Rabe
Baldur: Whole-Proof Generation and Repair with Large Language Models. ESEC/SIGSOFT FSE 2023: 1229-1241 - [i22]Emily First, Markus N. Rabe, Talia Ringer, Yuriy Brun:
Baldur: Whole-Proof Generation and Repair with Large Language Models. CoRR abs/2303.04910 (2023) - 2022
- [c28]Yuhuai Wu, Markus Norman Rabe, DeLesley Hutchins, Christian Szegedy:
Memorizing Transformers. ICLR 2022 - [c27]Yuhuai Wu, Albert Qiaochu Jiang, Wenda Li, Markus N. Rabe, Charles Staats, Mateja Jamnik, Christian Szegedy:
Autoformalization with Large Language Models. NeurIPS 2022 - [i21]Yuhuai Wu, Markus N. Rabe, DeLesley Hutchins, Christian Szegedy:
Memorizing Transformers. CoRR abs/2203.08913 (2022) - [i20]Yuhuai Wu, Albert Q. Jiang, Wenda Li, Markus N. Rabe, Charles Staats, Mateja Jamnik, Christian Szegedy:
Autoformalization with Large Language Models. CoRR abs/2205.12615 (2022) - 2021
- [c26]Markus N. Rabe
Towards the Automatic Mathematician. CADE 2021: 25-37 - [c25]Christopher Hahn, Frederik Schmitt, Jens U. Kreber, Markus Norman Rabe, Bernd Finkbeiner:
Teaching Temporal Logics to Neural Networks. ICLR 2021 - [c24]Markus Norman Rabe, Dennis Lee, Kshitij Bansal, Christian Szegedy:
Mathematical Reasoning via Self-supervised Skip-tree Training. ICLR 2021 - [c23]Yuhuai Wu, Markus N. Rabe, Wenda Li, Jimmy Ba, Roger B. Grosse, Christian Szegedy:
LIME: Learning Inductive Bias for Primitives of Mathematical Reasoning. ICML 2021: 11251-11262 - [c22]Frederik Schmitt, Christopher Hahn, Markus N. Rabe, Bernd Finkbeiner:
Neural Circuit Synthesis from Specification Patterns. NeurIPS 2021: 15408-15420 - [i19]Yuhuai Wu, Markus N. Rabe, Wenda Li, Jimmy Ba, Roger B. Grosse, Christian Szegedy:
LIME: Learning Inductive Bias for Primitives of Mathematical Reasoning. CoRR abs/2101.06223 (2021) - [i18]Frederik Schmitt, Christopher Hahn, Markus N. Rabe, Bernd Finkbeiner:
Neural Circuit Synthesis from Specification Patterns. CoRR abs/2107.11864 (2021) - [i17]Markus N. Rabe, Charles Staats:
Self-attention Does Not Need O(n2) Memory. CoRR abs/2112.05682 (2021) - 2020
- [c21]Aditya Paliwal, Sarah M. Loos, Markus N. Rabe, Kshitij Bansal, Christian Szegedy:
Graph Representations for Higher-Order Logic and Theorem Proving. AAAI 2020: 2967-2974 - [c20]Gil Lederman, Markus N. Rabe, Sanjit Seshia, Edward A. Lee:
Learning Heuristics for Quantified Boolean Formulas through Reinforcement Learning. ICLR 2020 - [c19]Dennis Lee, Christian Szegedy, Markus N. Rabe, Sarah M. Loos, Kshitij Bansal:
Mathematical Reasoning in Latent Space. ICLR 2020 - [i16]Bernd Finkbeiner, Christopher Hahn, Markus N. Rabe, Frederik Schmitt:
Teaching Temporal Logics to Neural Networks. CoRR abs/2003.04218 (2020) - [i15]Markus N. Rabe, Dennis Lee, Kshitij Bansal, Christian Szegedy:
Language Modeling for Formal Mathematics. CoRR abs/2006.04757 (2020)
2010 – 2019
- 2019
- [c18]Markus N. Rabe:
Incremental Determinization for Quantifier Elimination and Functional Synthesis. CAV (2) 2019: 84-94 - [c17]Kshitij Bansal, Sarah M. Loos, Markus N. Rabe, Christian Szegedy, Stewart Wilcox:
HOList: An Environment for Machine Learning of Higher Order Logic Theorem Proving. ICML 2019: 454-463 - [c16]Leander Tentrup
Clausal Abstraction for DQBF. SAT 2019: 388-405 - [i14]Marcell Vazquez-Chanlatte
A Model Counter's Guide to Probabilistic Systems. CoRR abs/1903.09354 (2019) - [i13]Kshitij Bansal, Sarah M. Loos, Markus N. Rabe, Christian Szegedy, Stewart Wilcox:
HOList: An Environment for Machine Learning of Higher-Order Theorem Proving (extended version). CoRR abs/1904.03241 (2019) - [i12]Aditya Paliwal
Graph Representations for Higher-Order Logic and Theorem Proving. CoRR abs/1905.10006 (2019) - [i11]Kshitij Bansal, Sarah M. Loos, Markus N. Rabe, Christian Szegedy:
Learning to Reason in Large Theories without Imitation. CoRR abs/1905.10501 (2019) - [i10]Markus N. Rabe, Leander Tentrup, Cameron Rasmussen, Sanjit A. Seshia:
Understanding and Extending Incremental Determinization for 2QBF. CoRR abs/1905.13411 (2019) - [i9]Dennis Lee, Christian Szegedy, Markus N. Rabe, Sarah M. Loos, Kshitij Bansal:
Mathematical Reasoning in Latent Space. CoRR abs/1909.11851 (2019) - 2018
- [c15]Markus N. Rabe, Leander Tentrup, Cameron Rasmussen, Sanjit A. Seshia:
Understanding and Extending Incremental Determinization for 2QBF. CAV (2) 2018: 256-274 - [i8]Peter Faymonville, Bernd Finkbeiner, Markus N. Rabe, Leander Tentrup:
Encodings of Bounded Synthesis. CoRR abs/1803.09570 (2018) - [i7]Gil Lederman, Markus N. Rabe, Sanjit A. Seshia:
Learning Heuristics for Automated Reasoning through Deep Reinforcement Learning. CoRR abs/1807.08058 (2018) - [i6]Markus N. Rabe, Leander Tentrup:
Synthesis of Boolean Functions with Clausal Abstraction. CoRR abs/1808.08759 (2018) - 2017
- [c14]Daniel J. Fremont, Markus N. Rabe, Sanjit A. Seshia:
Maximum Model Counting. AAAI 2017: 3885-3892 - [c13]Markus N. Rabe:
A Resolution-Style Proof System for DQBF. SAT 2017: 314-325 - [c12]Peter Faymonville
Encodings of Bounded Synthesis. TACAS (1) 2017: 354-370 - 2016
- [b1]Markus N. Rabe:
A temporal logic approach to iInformation-flow control. Saarland University, 2016 - [j5]John Fearnley, Markus N. Rabe, Sven Schewe
Efficient approximation of optimal control for continuous-time Markov games. Inf. Comput. 247: 106-129 (2016) - [c11]Bernd Finkbeiner, Markus N. Rabe:
Verifying hyperproperties of hardware systems. FMCAD 2016: 5 - [c10]Markus N. Rabe, Sanjit A. Seshia:
Incremental Determinization. SAT 2016: 375-392 - 2015
- [c9]Bernd Finkbeiner, Markus N. Rabe, César Sánchez
Algorithms for Model Checking HyperLTL and HyperCTL ^*. CAV (1) 2015: 30-48 - [c8]Markus N. Rabe, Leander Tentrup:
CAQE: A Certifying QBF Solver. FMCAD 2015: 136-143 - [i5]Benjamin Caulfield, Markus N. Rabe, Sanjit A. Seshia, Stavros Tripakis:
What's Decidable about Syntax-Guided Synthesis? CoRR abs/1510.08393 (2015) - 2014
- [j4]Markus N. Rabe, Peter Lammich, Andrei Popescu:
A shallow embedding of HyperCTL. Arch. Formal Proofs 2014 (2014) - [j3]Bernd Finkbeiner, Markus N. Rabe:
The linear-hyper-branching spectrum of temporal logics. it Inf. Technol. 56(6): 273-279 (2014) - [c7]Michael R. Clarkson, Bernd Finkbeiner, Masoud Koleini, Kristopher K. Micinski, Markus N. Rabe, César Sánchez
Temporal Logics for Hyperproperties. POST 2014: 265-284 - [c6]Markus N. Rabe, Christoph M. Wintersteiger
Symbolic Approximation of the Bounded Reachability Probability in Large Markov Chains. QEST 2014: 388-403 - [i4]Michael R. Clarkson, Bernd Finkbeiner, Masoud Koleini, Kristopher K. Micinski, Markus N. Rabe, César Sánchez:
Temporal Logics for Hyperproperties. CoRR abs/1401.4492 (2014) - 2013
- [j2]Markus N. Rabe, Sven Schewe
Optimal time-abstract schedulers for CTMDPs and continuous-time Markov games. Theor. Comput. Sci. 467: 53-67 (2013) - [i3]Bernd Finkbeiner, Markus N. Rabe, César Sánchez:
A Temporal Logic for Hyperproperties. CoRR abs/1306.6657 (2013) - 2012
- [c5]Sergio Giro, Markus N. Rabe:
Verification of Partial-Information Probabilistic Systems Using Counterexample-Guided Refinements. ATVA 2012: 333-348 - [c4]Rayna Dimitrova, Bernd Finkbeiner, Markus N. Rabe:
Monitoring Temporal Information Flow. ISoLA (1) 2012: 342-357 - [c3]Rayna Dimitrova, Bernd Finkbeiner, Máté Kovács, Markus N. Rabe, Helmut Seidl:
Model Checking Information Flow in Reactive Systems. VMCAI 2012: 169-185 - 2011
- [j1]Markus N. Rabe, Sven Schewe
Finite optimal control for time-bounded reachability in CTMDPs and continuous-time Markov games. Acta Informatica 48(5-6): 291-315 (2011) - [c2]John Fearnley, Markus N. Rabe, Sven Schewe
Efficient Approximation of Optimal Control for Continuous-Time Markov Games. FSTTCS 2011: 399-410 - 2010
- [c1]Markus N. Rabe, Sven Schewe
Optimal Time-Abstract Schedulers for CTMDPs and Markov Games. QAPL 2010: 144-158 - [i2]Markus N. Rabe, Sven Schewe:
Finite Optimal Control for Time-Bounded Reachability in CTMDPs and Continuous-Time Markov Games. CoRR abs/1004.4005 (2010) - [i1]Markus N. Rabe, Sven Schewe, Lijun Zhang:
Efficient Approximation of Optimal Control for Markov Games. CoRR abs/1011.0397 (2010)
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 2024-06-03 00:56 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 and maintained by:
the dblp computer science bibliography is funded and supported by: