Formalized Proofs of the Infinity and Normal Form Predicates in the First-Order Theory of Rewriting

Alexander Lochmann, Aart Middeldorp. Formalized Proofs of the Infinity and Normal Form Predicates in the First-Order Theory of Rewriting. In Armin Biere, David Parker 0001, editors, Tools and Algorithms for the Construction and Analysis of Systems - 26th International Conference, TACAS 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25-30, 2020, Proceedings, Part II. Volume 12079 of Lecture Notes in Computer Science, pages 178-194, Springer, 2020. [doi]

Authors

Alexander Lochmann

This author has not been identified. Look up 'Alexander Lochmann' in Google

Aart Middeldorp

This author has not been identified. It may be one of the following persons: Look up 'Aart Middeldorp' in Google