Abstract. Information flow for concurrent imperative languages is defined and studied. As a working formalism we use UNITY, where programs consist of sets of assignments executed randomly, i.e. without control flow. We study noninterference for programs which reach and do not reach fixed point- a state which is not changed by a subsequent execution. We present logic formulation of noninterference as well as type system for it