Semantic independence

DOI10.1016/0167-6423(89)90014-2MaRDI QIDQ911745zbMATH OpenOpenAlexFDO

Authors Eike Best, Christian Lengauer

Publication date 1989

Published in Science of Computer Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-6423(89)90014-2

zbMATH Keywords

concurrencysemantic of programs

Mathematics Subject Classification ID

Theory of operating systems (68N25) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)

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.

Recommendations

• A generalized notion of semantic independence
• scientific article; zbMATH DE number 3902013
• Strict and nonstrict independent and-parallelism in logic programs: Correctness, efficiency, and compile-time conditions
• A criterion for atomicity
• Independence in dynamically scheduled logic languages

Cited in

(4)

• An algebraic characterization of semantic independence
• Defining conditional independence using collapses
• A generalization of traces
• A generalized notion of semantic independence

This page was built for publication: Semantic independence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q911745)