Gramlich, B. (1990). Completion based inductive theorem proving: A case study in verifying sorting algorithms. Fachber. Informatik, Univ. Kaiserslautern.
Chicago Style (17th ed.) CitationGramlich, Bernhard. Completion Based Inductive Theorem Proving: A Case Study in Verifying Sorting Algorithms. Kaiserslautern: Fachber. Informatik, Univ. Kaiserslautern, 1990.
MLA (9th ed.) CitationGramlich, Bernhard. Completion Based Inductive Theorem Proving: A Case Study in Verifying Sorting Algorithms. Fachber. Informatik, Univ. Kaiserslautern, 1990.
Warning: These citations may not always be 100% accurate.