There has been something of an academic debate between proponents of two different kinds of computer self-efficacy: general computer self-efficacy ala Compeau and Higgins on the o...
We present a framework in which different notions of security can be defined in a uniform and modular way. Each definition of security is formalized as a security predicate by ass...
In the previous, companion, paper [13] to this paper we introduced our general model of refinement, discussed ideas around determinism and interfaces that the general definition r...
In this paper, we discuss a general methodology for analysis and modeling of trust relationships in distributed computing. We discuss the classification of trust relationships, cat...
The paper focuses on means of defining parameterized type categories and algorithms built on such types in Mathematica. Symbolic algorithms based on category theory have the advan...