Premium
Checking cyclic pointers
Author(s) -
Radford P.
Publication year - 1980
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/spe.4380100703
Subject(s) - modulo , consistency (knowledge bases) , computer science , sequence (biology) , set (abstract data type) , simple (philosophy) , warrant , sequential consistency , arithmetic , algorithm , programming language , consistency model , mathematics , theoretical computer science , discrete mathematics , correctness , artificial intelligence , philosophy , epistemology , biology , financial economics , economics , genetics
Variables which are incremented modulo‐ M are a feature of many resource control schemes, where the resources are allocated and released in strict sequence. If resources pass through several phases of use, again in strict sequence, then several variables may be used to keep track of the resources. Because of the modulo‐ M arithmetic checking the consistency of a set of variables may be thought sufficiently difficult to warrant the exclusion of checking. There is a simple technique for checking consistency however and this note describes it.