An algebraic characterization of semantic independence

Best and Lengauer (1989) proposed a definition of semantic independence for 2 programs that are given semantically as binary relations. A simplified description has been developed with set-theoretic concepts known from Universal Algebra, which also can be expressed more abstractly by suitable equati...

Full description

Saved in:
Bibliographic Details
Published in:Information processing letters 1991-09, Vol.39 (6), p.291-296
Main Author: von Stengel, Bernhard
Format: Article
Language:English
Subjects:
Computer programming
Computer science
Formal semantics
Functions
Mathematical analysis
parallel computation
relational algebra
Semantics
Studies
Theory
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Best and Lengauer (1989) proposed a definition of semantic independence for 2 programs that are given semantically as binary relations. A simplified description has been developed with set-theoretic concepts known from Universal Algebra, which also can be expressed more abstractly by suitable equations in a relational algebra.
ISSN:0020-0190
1872-6119
DOI:10.1016/0020-0190(91)90001-X