Tobias Tebbi: Publications

Saarland University Computer Science

Journal, conference and workshop publications

Equivalence of System F and λ2 in Coq Based on Context Morphism Lemmas   (pdf)
Jonas Kaiser, Tobias Tebbi, Gert Smolka
Proceedings of CPP 2017, 2017.

Autosubst: Reasoning with de Bruijn Terms and Parallel Substitutions   (pdf)
Steven Schäfer, Tobias Tebbi, Gert Smolka
Interactive Theorem Proving - 6th International Conference, ITP 2015, Nanjing, China, August 24-27, 2015, 2015.

Completeness and Decidability of de Bruijn Substitution Algebra in Coq   (pdf)
Steven Schäfer, Gert Smolka, Tobias Tebbi
Proceedings of the 2015 Conference on Certified Programs and Proofs, CPP 2015, Mumbai, India, January 15-17, 2015, 2015.

Unification Modulo Nonnested Recursion Schemes via Anchored Semi-Unification   (pdf)
Gert Smolka, Tobias Tebbi
24rd International Conference on Rewriting Techniques and Applications (RTA'13), 2013.

InKreSAT: Modal Reasoning via Incremental Reduction to SAT   (pdf)
Mark Kaminski, Tobias Tebbi
CADE-24, 2013.


Unification Modulo Nonnested Recursion Schemes via Anchored Semi-Unification   (pdf)
Tobias Tebbi
Master's Thesis, Saarland University, 2013.

Correctness of Tableau-Based Decision Procedures with Backjumping   (pdf)
Tobias Tebbi
B.Sc. Thesis, Programming Systems Lab, Department of Informatics, Saarland University, 2011.

Legal notice, Privacy policy