TY - JOUR
T1 - Regularity of relations
T2 - A measure of uniformity
AU - Jaoua, A.
AU - Mili, A.
AU - Boudriga, N.
AU - Durieux, J. L.
N1 - Funding Information:
* This work is partly supported by the Tunisian Commission for Scientific and Technical Research, the Ministry 3f Higher Education and Scientific Research, under grants number MA7/85/FST, MA1:88/FST, MA4/88/FST and MAS/SI/FST.
PY - 1991/2/27
Y1 - 1991/2/27
N2 - In their most general form, program specifications can be represented as binary relations. The study of binary relations for the purpose of discussing program construction, program fault tolerance and program exception handling have led us to discover an interesting property of relations: regularity. The interest of this property is twofold: first it is very general, i.e. it is verified by several specifications we encounter; second, it is very strong, i.e. it allows us to simplify our formal computations rather dramatically.
AB - In their most general form, program specifications can be represented as binary relations. The study of binary relations for the purpose of discussing program construction, program fault tolerance and program exception handling have led us to discover an interesting property of relations: regularity. The interest of this property is twofold: first it is very general, i.e. it is verified by several specifications we encounter; second, it is very strong, i.e. it allows us to simplify our formal computations rather dramatically.
UR - http://www.scopus.com/inward/record.url?scp=0026104992&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0026104992&partnerID=8YFLogxK
U2 - 10.1016/0304-3975(91)90335-Y
DO - 10.1016/0304-3975(91)90335-Y
M3 - Article
AN - SCOPUS:0026104992
SN - 0304-3975
VL - 79
SP - 323
EP - 339
JO - Theoretical Computer Science
JF - Theoretical Computer Science
IS - 2
ER -