Fabian Mitterwallner

Orcid: 0000-0001-5992-9517

According to our database1, Fabian Mitterwallner authored at least 9 papers between 2021 and 2024.

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

Timeline

2021
2022
2023
2024
0
1
2
3
4
5
2
2
2
1
2

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Automated Strategy Invention for Confluence of Term Rewrite Systems.
CoRR, 2024

Undecidability Results on Orienting Single Rewrite Rules.
Arch. Formal Proofs, 2024

Linear Termination is Undecidable.
Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024

Confluence of Logically Constrained Rewrite Systems Revisited.
Proceedings of the Automated Reasoning - 12th International Joint Conference, 2024

2023
First-Order Theory of Rewriting for Linear Variable-Separated Rewrite Systems: Automation, Formalization, Certification.
J. Autom. Reason., June, 2023

Linear Termination over N is Undecidable.
CoRR, 2023

2022
Polynomial Termination Over ℕ Is Undecidable.
Proceedings of the 7th International Conference on Formal Structures for Computation and Deduction, 2022

2021
Certifying Proofs in the First-Order Theory of Rewriting.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2021

A verified decision procedure for the first-order theory of rewriting for linear variable-separated rewrite systems.
Proceedings of the CPP '21: 10th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2021


  Loading...