Object-oriented languages with multiple inheritance and automatic conflict resolution typically use a linearization of superclasses to determine which version of a property to inherit when several superclasses provide definitions. Recent work has defined several desirable characteristics for linearizations, the most important being monotonicity, which prohibits inherited properties from skipping over direct superclasses. Combined with Dylan's sealing mechanism, a monotonic linearization enables some compile-time method selection that would otherwise be impossible in the absence of a closed-world assumption.The Dylan linearization is monotonic, easily described, strictly observes local precedence order, and produces the same ordering as CLOS when that is monotonic. We present an implementation based on merging and a survey of class heterarchies from several large programs, analyzing where commonly used linearizations differ.

The information processors in a decentralized computing system must trust each other enough to be mutually supportive, yet they must also protect themselves to maintain autonomy. In a decentralized system, data security is especially important because the effects of compromise or sabotage can be so wide-ranging. The trusted function is an ad hoc solution to a problem with present data security models. This "consistency" problem, never previously addressed in a formal manner, is aggravated in the decentralized processing setting. The paper examines the consistency problem and proposes an addition to existing security models to address the problem. Using the model, the impact of the trusted function on secure, decentralized-processing system design is assessed.