In usual proof systems, like the sequent calculus, only a very limited way of combining proofs is available through the tree structure. We present in this paper a logicindependent ...
This paper develops some control structures suitable for composing fault-tolerant distrib uted applications using atomic actions (atomic transactions) as building blocks, and then...
Abstract. This paper describes the development of two kinds of atomic action schemes for Ada 95. We start by discussing the basic features required of an atomic action scheme and w...
Alexander B. Romanovsky, Stuart E. Mitchell, Andy ...
Abstract. We examine the role of transactional memory from two perspectives: that of a programming language with atomic actions and that of implementations of the language. We argu...