Compositional proof systems for shared variable concurrent programs can be devised by
including the interference information in the specifications. The formalism falls into a …

We introduce a simple compositional proof system for proving (partial) correctness of
concurrent constraint programs (CCP). The proof system is based on a denotational …

The typical correspondence between a concrete representation and an abstract conceptual
value of an abstract data type (ADT) variable (object) is a many-to-one function. For …

Much research in axiomatic semantics suffers from a lack of formality. In particular, most
proposed verification calculi for imperative programs dealing with recursive procedures are …

A new compositional logic for verifying safety properties of shared variable concurrency is
presented, in which, in order to characterize infinite computations, a Hoare-style I/pre/post …

This paper presents a compositional proof system for shared variable concurrency. The
proof system is based on an assertion language which describes a computation, ie a …

A theory of state-oriented, partially-ordered model named, Communicating Minimal prefix
machines (CMpms) that represent a fixed set of processes, is presented. Each of these …

We propose a methodology for designing sound and complete proof systems for proving
progress properties of parallel programs under various fairness assumptions. Our …

Component-level maintenance involves changing the behavior of a system in useful and
predictable ways by removing and replacing entire components. In order to perform …

In a deterministic program there is at most one instruction to be executed “next,” so that from
a given initial state only one execution sequence is generated. In classical programming …