Date of Award

2014

Degree Type

Dissertation

Degree Name

Doctor of Philosophy in Computer Science

Department

Computer Science and Stastistics

First Advisor

Lutz Hamel

Abstract

We present an alternative model theory for rewriting logic in the calculus of inductive constructions. Making use of the Coq theorem proving environment, we create a formal specification of rewriting logic, and gain an interactive logical and semantic framework for rewriting logic, which is a logic well suited to the specification and validation of concurrent computations and proofs. We then show how we can use Coq and this specification as a formal proof environment for working with rewriting logic theories. Finally, we present tactics to automate portions of the proof generation and validation process.

Share

COinS
 
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.