This paper takes polymorphism to the multi-object level. Traditional inheritance, polymorphism, and late binding interact nicely to provide both flexibility and safety – when a method is invoked on an object via a polymorphic reference, late binding ensures that we get the appropriate implementation of that method for the actual object. We are granted the flexibility of using different kinds of...

Design-for-testability is a very important issue in software engineering. It becomes crucial in the case of OO designs where control flows are generally not hierarchical, but are diffuse and distributed over the whole architecture. We introduce the concept of a "testing conflict" when potentially concurrent client/supplier relationships between the same classes along different paths exist in a ...

Let Y = Z× (Z/LZ), where L > 1 is an integer, G = {−e1, e1,−e2, e2} where ej are coordinate vectors. We denote the coordinates of points y ∈ Y by (x(y), s(y)). Consider a cookie environment on Y, that is, for each y ∈ Y, j ∈ N, there is a probability distribution ω(y, j, e) on G. Consider an excited random walk Yn = (Xn, Sn) that is P(Yn+1 − Yn = e|Y1, . . . , Yn) = ω(Yn, ln, e) where ln is the...

Code reuse is a fundamental aspect of object-oriented programs, and in particular, the mechanisms of inheritance and late binding provide great flexibility in code reuse, without semantical limitations other than typecorrectness. However, modular reasoning about late binding and inheritance is challenging, and formal reasoning approaches place semantical restrictions on code reuse in order to p...

The thesis concentrates on two problems in discrete geometry, whose solutions are obtained by analytic, probabilistic and combinatoric tools. The first chapter deals with the strong polarization problem. This states that for any sequence u1, . . . , un of norm 1 vectors in a real Hilbert space H , there exists a unit vector v ∈ H , such that X 1 〈ui, v〉2 6 n . The 2-dimensional case is proved b...

We present a metagrammatical formalism, generic rules, to give a default interpretation to grammar rules. Our formalism introduces a process of dynamic binding interfacing the level of pure grammatical knowledge representation and the parsing level. We present an approach to non-constituent coordination within categorial grammars, and reformulate it as a generic rule. This reformulation is cont...

Follow this and additional works at: http://engagedscholarship.csuohio.edu/enece_facpub Part of the Computer Engineering Commons Publisher's Statement NOTICE: this is the author’s version of a work that was accepted for publication in Journal of Systems and Software. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other qualit...