Regularity of relations: A measure of uniformity

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

Research output: Contribution to journalArticlepeer-review

12 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 languageEnglish (US)
Pages (from-to)323-339
Number of pages17
JournalTheoretical Computer Science
Volume79
Issue number2
DOIs
StatePublished - Feb 27 1991
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Regularity of relations: A measure of uniformity'. Together they form a unique fingerprint.

Cite this