We automatically verify Back's atomicity refinement law and a classical data refinement law for action systems. Our novel approach mechanises a refinement calculus based on K...
: We investigate behavioral institutions and refinements in the context of the object oriented paradigm. The novelty of our approach is the application of generalized abstract alge...
An implication operator A is said to be tied if there is a binary operation T that ties A; that is, the identity A(a, A(b, z)) = A(T (a, b), z) holds for all a, b, z. We aim at th...
Nehad N. Morsi, Wafik Boulos Lotfallah, Moataz Sal...
We formulate an algebra of binary temporal relations between events the number of occurrences of which is unknown, but which are known to recur in time. Ontologically, we view the...
Contemporary use of the term ’intension’ derives from the traditional logical doctrine that an idea has both an extension and an intension. In this paper we introduce an intens...