Comparing Model Checking and Term Rewriting for the Verification of an Embedded System

Abstract

There are two main streams for the verification of digital systems: Theorem proving methods such as term rewriting are used for the verification of data oriented systems, and model checking of temporal logics is usually used for the verification of control dominated systems. While theorem proving is an inherently interactive verification method, model checking is performed automatically.In this paper, we investigate for the verification of algorithms for computing the discrete cosine transform by means of term rewriting and model checking. We show the advantages and disadvantages of both approaches at different abstraction levels of the design.