A Theory of Tagged Objects

Foundational models of object-oriented constructs typically model objects as records with a structural type. However, many object-oriented languages are class-based; statically-typed formal models of these languages tend to sacrifice the foundational nature of the record-based models, and in addition cannot express dynamic class loading or creation. In this paper, we explore how to model statically-typed object-oriented languages that support dynamic class creation using foundational constructs of type theory. We start with an extensible tag construct motivated by type theory, and adapt it to support static reasoning about class hierarchy and the tags supported by each object. The result is a model that better explains the relationship between object-oriented and functional programming paradigms, suggests a useful enhancement to functional programming languages, and paves the way for more expressive statically typed object-oriented languages. In that vein, we describe the design and implementation of the Wyvern language, which leverages our theory

Graphical deep knowledge representation in VODAK/VML object-oriented database

Applying Object-oriented concepts to the design of complex graphical interface has received great attention in the database and knowledge representation disciplines. Traditional CAD systems can not support efficient environments for design processes because they store information about all the objects for display purposes but do not store any knowledge for reasoning purposes. They are called knowledge poor . Graphical Deep Knowledge in Artificial Intelligence has been proven successful to represent knowledge about objects for display purposes as well as reasoning purposes. We introduwd the theory of Graphical Deep Knowledge into the object-oriented database s stem VML to design a Knowledge rich system which can support better graphical interface. We showed that the theory of Graphical Deep Knowledge can improve graphical interface design and functions as a flexible, and knowledgeable tool for design processes. Based on the presented theory, we developed a system called GDKRIVVOOD (Graphical Deep Knowledge Representation In Vodak/VML Object-Oriented Database) for circuit board design

Engineering Object-Oriented Semantics Using Graph Transformations

In this paper we describe the application of the theory of graph transformations to the practise of language design. We have defined the semantics of a small but realistic object-oriented language (called TAAL) by mapping the language constructs to graphs and their operational semantics to graph transformation rules. In the process we establish a mapping between UML models and graphs. TAAL was developed for the purpose of this paper, as an extensive case study in engineering object-oriented language semantics using graph transformation. It incorporates the basic aspects of many commonly used object-oriented programming languages: apart from essential imperative programming constructs, it includes inheritance, object creation and method overriding. The language specification is based on a number of meta-models written in UML. Both the static and dynamic semantics are defined using graph rewriting rules. In the course of the case study, we have built an Eclipse plug-in that automatically transforms arbitrary TAAL programs into graphs, in a graph format readable by another tool. This second tool is called Groove, and it is able to execute graph transformations. By combining both tools we are able to visually simulate the execution of any TAAL program

The object-oriented paradigm as an implementation of systems theory in IS

Classical General Systems Theory (GST) is rich with fundamental concepts relating to the explanation of how systems behave and operate. The new concept of object-oriented techniques and methodologies was found to be closely aligned with most of the fundamental theories of GST. This article presents these alignments and similarities and clearly shows that object-oriented techniques provide a better fit to GST than older design methodologies

A Classical Probabilistic Computer Model of Consciousness

We show that human consciousness can be modeled as a classical (not quantum) probabilistic computer. A quantum computer representation does not appear to be indicated because no known feature of consciousness depends on Planck's constant h, the telltale sign of quantum phenomena. It is argued that the facets of consciousness are describable by an object-oriented design with dynamically defined classes and objects. A comparison to economic theory is also made. We argue consciousness may also have redundant, protective mechanisms

Integrating Schedulability Analysis with UML-RT

The use of object oriented techniques and methodologies for the design of real-time control systems appear to be necessary in order to deal with the increasing complexity of such systems. Recently many object-oriented methods have been used for the modeling and design of real-time control systems. We believe that an approach that integrates the advancements in both object modeling and design methods, and real-time scheduling theory is the key to successful use of object oriented technology for real-time software. However, past approaches to integrate the two either restrict the object models, or do not allow sophisticated schedulability analysis techniques. In this paper we show how schedulability analysis can be integrated with object-oriented design; we develop the schedulability and feasibility analysis method for the external messages that may suffer release jitter due to being dispatched by a tick driven scheduler in real-time control system, and we also develop the scheduliability method for sporadic activities, where message arrive sporadically then execute periodically for some bounded time. This method can be used to cope with timing constraints in complex real-time control systems

Transforming Algebraically-Based Object Models into a Canonical Form for Design Refinement

The understandability of object-oriented design techniques and the rigor of formal methods have improved the state of software development; however, both ideas have limitations. Object-oriented techniques, which are semi-formal, can still result in incorrect designs, while formal methods are complex and require an extensive mathematical background. The two approaches can be coupled, however, to produce designs that are both understandable and verifiable, and to produce executable code. This research proposes an approach where object-oriented models are first represented algebraically in a formal specification language such as LARCH and then transformed into a canonical form suitable for design refinement. In the canonical form presented in this work, object-oriented models are represented as domain theories consisting of multiple class specifications. Each class specification has sorts, operations (attributes, methods, events, states, state attributes, and operations), and axioms which describe its structure and behavior. The ability to reason about relationships between specifications is handled through the use of category theory operations. Although the canonical form is methodology independent, this work demonstrates the proposed approach on object-oriented models developed using Rumbaugh\u27s Object Modeling Technique. The models are first mapped to LARCH and then translated into the canonical form by a set of rewrite rules. The rewrite rules are shown to produce unique normal forms. The final product is a transformation system which converts object-oriented designs into a canonical form that can be used with a design refinement tool

UML Extensions for Real-Time Control Systems

The use of object oriented techniques and methodologies for the design of real-time control systems appears to be necessary in order to deal with the increasing complexity of such systems. Recently many object-oriented methods have been used for the modeling and design of real-time control systems. We believe that an approach that integrates the advancements in both object modeling and design methods, and real-time scheduling theory is the key to successful use of object oriented technology for real-time software. Surprisingly several past approaches to integrate the two either restrict the object models, or do not allow sophisticated schedulability analysis techniques. In this paper we show how schedulability analysis can be integrated with object-oriented design. More specifically, we develop the schedulability and feasibility analysis method for the external messages that may suffer release jitter due to being dispatched by a tick driven scheduler in real-time control system, and we also develop the scheduliability method for sporadic activities, where message arrive sporadically then execute periodically for some bounded time. This method can be used to cope with timing constraints in realistic and complex real-time control systems. Using this method, a designer can quickly evaluate the impact of various implementation decisions on schedulability. In conjunction with automatic code-generation, we believe that this will greatly streamline the design and development of real-time control system software

On the Design and Development of Object-oriented Scheduling Systems

In this paper, we describe the architecture of an object-oriented scheduling system. First, a mathematical framework is presented that is based on set theory and graph theory. Then a number of basic as well as more specialized methods are defined which can be applied on the entities of any decision support system. The principal objects of a scheduling system are defined, as well as the methods specifically designed for the manipulation of the schedules. The object base design, the schedule generator design and the user interface design are then discussed in detail.Information Systems Working Papers Serie

HZTool and Rivet: Toolkit and Framework for the Comparison of Simulated Final States and Data at Colliders

A common problem in particle physics is the requirement to reproduce comparisons between data and theory when the theory is a (general purpose) Monte Carlo simulation and the data are measurements of final state observables in high energy collisions. The complexity of the experiments, the obervables and the models all contribute to making this a highly non-trivial task. We describe an existing library of Fortran routines, HZTool, which enables, for each measurement of interest, a comparable prediction to be produced from any given Monte Carlo generator. The HZTool library is being maintained by CEDAR, with subroutines for various measurements contributed by a number of authors within and outside the CEDAR collaboration. We also describe the outline design and current status of a replacement for HZTool, to be called Rivet (Robust Independent Validation of Experiment and Theory). This will use an object-oriented design, implemented in C++, together with standard interfaces (such as HepMC and AIDA) to make the new framework more flexible and extensible than the Fortran HZTool.Comment: Contribution to CHEP06 conferenc