Markus N. Rabe

Orcid: 0000-0003-4795-7259

Affiliations:
  • Google Inc.
  • Saarland University, Department of Computer Science (former)


According to our database1, Markus N. Rabe authored at least 45 papers between 2010 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Baldur: Whole-Proof Generation and Repair with Large Language Models.
Proceedings of the 31st ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering, 2023

2022
Autoformalization with Large Language Models.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Memorizing Transformers.
Proceedings of the Tenth International Conference on Learning Representations, 2022

2021
Self-attention Does Not Need O(n<sup>2</sup>) Memory.
CoRR, 2021

Neural Circuit Synthesis from Specification Patterns.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

LIME: Learning Inductive Bias for Primitives of Mathematical Reasoning.
Proceedings of the 38th International Conference on Machine Learning, 2021

Mathematical Reasoning via Self-supervised Skip-tree Training.
Proceedings of the 9th International Conference on Learning Representations, 2021

Teaching Temporal Logics to Neural Networks.
Proceedings of the 9th International Conference on Learning Representations, 2021

Towards the Automatic Mathematician.
Proceedings of the Automated Deduction - CADE 28, 2021

2020
Language Modeling for Formal Mathematics.
CoRR, 2020

Teaching Temporal Logics to Neural Networks.
CoRR, 2020

Mathematical Reasoning in Latent Space.
Proceedings of the 8th International Conference on Learning Representations, 2020

Learning Heuristics for Quantified Boolean Formulas through Reinforcement Learning.
Proceedings of the 8th International Conference on Learning Representations, 2020

Graph Representations for Higher-Order Logic and Theorem Proving.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
Learning to Reason in Large Theories without Imitation.
CoRR, 2019

HOList: An Environment for Machine Learning of Higher-Order Theorem Proving (extended version).
CoRR, 2019

A Model Counter's Guide to Probabilistic Systems.
CoRR, 2019

Clausal Abstraction for DQBF.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2019, 2019

HOList: An Environment for Machine Learning of Higher Order Logic Theorem Proving.
Proceedings of the 36th International Conference on Machine Learning, 2019

Incremental Determinization for Quantifier Elimination and Functional Synthesis.
Proceedings of the Computer Aided Verification - 31st International Conference, 2019

2018
Synthesis of Boolean Functions with Clausal Abstraction.
CoRR, 2018

Learning Heuristics for Automated Reasoning through Deep Reinforcement Learning.
CoRR, 2018

Understanding and Extending Incremental Determinization for 2QBF.
Proceedings of the Computer Aided Verification - 30th International Conference, 2018

2017
Encodings of Bounded Synthesis.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2017

A Resolution-Style Proof System for DQBF.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28, 2017

Maximum Model Counting.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
A temporal logic approach to iInformation-flow control.
PhD thesis, 2016

Efficient approximation of optimal control for continuous-time Markov games.
Inf. Comput., 2016

Incremental Determinization.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2016, 2016

Verifying hyperproperties of hardware systems.
Proceedings of the 2016 Formal Methods in Computer-Aided Design, 2016

2015
What's Decidable about Syntax-Guided Synthesis?
CoRR, 2015

CAQE: A Certifying QBF Solver.
Proceedings of the Formal Methods in Computer-Aided Design, 2015

Algorithms for Model Checking HyperLTL and HyperCTL ^*.
Proceedings of the Computer Aided Verification - 27th International Conference, 2015

2014
The linear-hyper-branching spectrum of temporal logics.
it Inf. Technol., 2014

A shallow embedding of HyperCTL.
Arch. Formal Proofs, 2014

Symbolic Approximation of the Bounded Reachability Probability in Large Markov Chains.
Proceedings of the Quantitative Evaluation of Systems - 11th International Conference, 2014

Temporal Logics for Hyperproperties.
Proceedings of the Principles of Security and Trust - Third International Conference, 2014

2013
Optimal time-abstract schedulers for CTMDPs and continuous-time Markov games.
Theor. Comput. Sci., 2013

A Temporal Logic for Hyperproperties.
CoRR, 2013

2012
Model Checking Information Flow in Reactive Systems.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2012

Monitoring Temporal Information Flow.
Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation. Technologies for Mastering Change, 2012

Verification of Partial-Information Probabilistic Systems Using Counterexample-Guided Refinements.
Proceedings of the Automated Technology for Verification and Analysis, 2012

2011
Finite optimal control for time-bounded reachability in CTMDPs and continuous-time Markov games.
Acta Informatica, 2011

2010
Efficient Approximation of Optimal Control for Markov Games
CoRR, 2010

Optimal Time-Abstract Schedulers for CTMDPs and Markov Games
Proceedings of the Proceedings Eighth Workshop on Quantitative Aspects of Programming Languages, 2010


  Loading...