A Formal Description of an Incremental Type-Checker for Z

Abstract

In this paper, we describe some of the difficulties that must be tackled when type-checking Z [1] specifications on an incremental basis. We formalise, in Z itself, the possible dependency relationships for each kind of Z definition. Then, we present an extensive list of issues that an incremental type-checking algorithm for Z must deal with, as well as an outline specification of an incremental type-checking algorithm which deals with these issues.