Semantic independence
type: Item
instance of: scholarly article
title: Semantic independence
zbMATH Open document ID: 0697.68021
DOI: 10.1016/0167-6423(89)90014-2
author: Eike Best
author: Christian Lengauer
published in: Science of Computer Programming
publication date: 1989-01-01T00:00:00Z
review text: The paper studies the possibilities of noninterferring implementations which can achieve a fully concurrent execution of semantically independent assignments (programs). Semantic independence of assignments is defined so that i) it is a generalization of the Bernstein condition (common variables do not appear on the left side of the assignments); ii) it implies commutativity of assignments; iii) it allows the implementation and execution of assignments on disjoint pieces of memory; (iv) it does not appeal to particular forms of the assignment syntax or of the variable access. The authors concentrate on the definition of orthogonality and investigate possible relaxations of it.
reviewed by: Gabriel Ciobanu
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 68N25
Mathematics Subject Classification ID: 68Q55
zbMATH DE Number: 4143417
zbMATH Keywords: concurrency
zbMATH Keywords: semantic of programs
MaRDI profile type: Publication
full work available at URL: 0167-6423(89)90014-2
OpenAlex ID: W2913346117
description: scientific article; zbMATH DE number 4143417