Semantic independence (Q911745)

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.