Regularity of relations: A measure of uniformity

A. Jaoua; A. Mili; N. Boudriga; J. L. Durieux

doi:10.1016/0304-3975(91)90335-Y

Regularity of relations: A measure of uniformity

A. Jaoua
, A. Mili
, N. Boudriga
, J. L. Durieux

Research output: Contribution to journal › Article › peer-review

13 Scopus citations

Abstract

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.

Original language	English (US)
Pages (from-to)	323-339
Number of pages	17
Journal	Theoretical Computer Science
Volume	79
Issue number	2
DOIs	https://doi.org/10.1016/0304-3975(91)90335-Y
State	Published - Feb 27 1991
Externally published	Yes

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
General Computer Science

Access to Document

10.1016/0304-3975(91)90335-Y

Cite this

@article{d2e489c968f549b4a670923b0af0c58b,

title = "Regularity of relations: A measure of uniformity",

abstract = "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.",

author = "A. Jaoua and A. Mili and N. Boudriga and Durieux, \{J. L.\}",

note = "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.",

year = "1991",

month = feb,

day = "27",

doi = "10.1016/0304-3975(91)90335-Y",

language = "English (US)",

volume = "79",

pages = "323--339",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier B.V.",

number = "2",

}

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 - https://www.scopus.com/pages/publications/0026104992

UR - https://www.scopus.com/pages/publications/0026104992#tab=citedBy

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 -

Regularity of relations: A measure of uniformity

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this