Gabriel Ebner

Orcid: 0000-0003-4057-9574

According to our database1, Gabriel Ebner authored at least 16 papers between 2016 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Towards Neural Synthesis for SMT-Assisted Proof-Oriented Programming.
CoRR, 2024

Lean Formalization of Extended Regular Expression Matching with Lookarounds.
Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2024

2023
Unifying Splitting.
J. Autom. Reason., June, 2023

Symbolic Automata: ω-Regularity Modulo Theories.
CoRR, 2023

An Extensible User Interface for Lean 4.
Proceedings of the 14th International Conference on Interactive Theorem Proving, 2023

2022
HyperTree Proof Search for Neural Theorem Proving.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2021
A Unifying Splitting Framework.
Proceedings of the Automated Deduction - CADE 28, 2021

2020
Maintaining a Library of Formal Mathematics.
Proceedings of the Intelligent Computer Mathematics - 13th International Conference, 2020

2019
On the Generation of Quantified Lemmas.
J. Autom. Reason., 2019

Herbrand Constructivization for Automated Intuitionistic Theorem Proving.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2019

2018
Fast Cut-Elimination using Proof Terms: An Empirical Study.
Proceedings of the Proceedings Seventh International Workshop on Classical Logic and Computation, 2018

Complexity of Decision Problems on Totally Rigid Acyclic Tree Grammars.
Proceedings of the Developments in Language Theory - 22nd International Conference, 2018

Efficient Translation of Sequent Calculus Proofs Into Natural Deduction Proofs.
Proceedings of the 6th Workshop on Practical Aspects of Automated Reasoning co-located with Federated Logic Conference 2018 (FLoC 2018), 2018

2017
Algorithmic Compression of Finite Tree Languages by Rigid Acyclic Grammars.
ACM Trans. Comput. Log., 2017

A metaprogramming framework for formal verification.
Proc. ACM Program. Lang., 2017

2016
System Description: GAPT 2.0.
Proceedings of the Automated Reasoning - 8th International Joint Conference, 2016


  Loading...