• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 232
  • 48
  • 28
  • 12
  • 8
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • Tagged with
  • 397
  • 397
  • 397
  • 273
  • 253
  • 97
  • 66
  • 62
  • 53
  • 49
  • 45
  • 43
  • 43
  • 42
  • 40
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.

Selective transparency in distributed transaction processing

McCue, Daniel Lawrence January 1992 (has links)
Object-oriented programming languages provide a powerful interface for programmers to access the mechanisms necessary for reliable distributed computing. Using inheritance and polymorphism provided by the object model, it is possible to develop a hierarchy of classes to capture the semantics and inter-relationships of various levels of functionality required for distributed transaction processing. Using multiple inheritance, application developers can selectively apply transaction properties to suit the requirements of the application objects. In addition to the specific problems of (distributed) transaction processing in an environment of persistent objects, there is a need for a unified framework, or architecture in which to place this system. To be truly effective, not only the transaction manager, but the entire transaction support environment must be described, designed and implemented in terms of objects. This thesis presents an architecture for reliable distributed processing in which the management of persistence, provision of transaction properties (e.g., concurrency control), and organisation of support services (e.g., RPC) are all gathered into a unified design based on the object model.

On software reusability, portability and user interface acceptability in UNIX -based aplications

Lawson, Edwin W. January 1990 (has links)
No description available.

A technique for clarifying the implementation of relationships between objects to enhance software reuse

Mayes, Jeanne Audrey January 1995 (has links)
No description available.

A graph-based framework for dynamic process systems modelling

Harris, S. J. January 1998 (has links)
No description available.

The roles of inheritance in software development

Armstrong, James Matthew January 1991 (has links)
No description available.

Object-oriented divide-and-conquer for parallel processing

Piper, Andrew James January 1994 (has links)
No description available.

An object-oriented environment for control system design

Phaal, P. January 1987 (has links)
No description available.

Detection of feature interactions in an object-oriented feature-based design system

Abdul-Razak, Ariffin January 1997 (has links)
No description available.

Static analysis for incomplete object-oriented programs

Nguyen, Phung Hua, Computer Science & Engineering, Faculty of Engineering, UNSW January 2005 (has links)
Static analysis is significant since it provides the information about the run- time behaviour of an analysed program. Such information has many applications in compiler optimisations and software engineering tools. Interprocedural anal- ysis is a form of static analysis, which can exploit information available across procedure boundaries. The analysis is traditionally designed as whole-program analysis, which processes the entire program. However, whole-program analysis is problematic when parts of the analysed program are not available to partici- pate in analysis. In this case, a whole-program analysis has to make conservative assumptions to be able to produce safe analysis results at the expense of some possible precision loss. To improve analysis precision, an analysis can exploit the access control mechanism provided by the underlying program language. This thesis introduces a points-to analysis technique for incomplete object-oriented programs, called com- pleteness analysis, which exploits the access and modification properties of classes, methods and fields to enhance the analysis precision. Two variations of the tech- nique, compositional and sequential completeness analysis, are described. This thesis also presents a mutability analysis (MA) and MA-based side-effect analy- sis, which are based on the output of completeness analysis, to determine whether a variable is potentially modified by the execution of a program statement. The results of experiments carried out on a set of Java library packages are presented to demonstrate the improvement in analysis precision.

Object-Oriented Specification and Design of User Interfaces

Hussey, Andrew Patrick Unknown Date (has links)
Formal methods are increasingly accepted for developing software systems, however their application to user-interface development is less common. In this thesis, we demonstrate the utility of formal object-oriented techniques for specifying, designing and implementing user-interfaces. The specification of a user-interface describes user-perceivable operations and information structures for an interactive system in an implementation-independent way. Operations of a user-interface specification define tasks. User-interfaces can be specified by a system of communicating agents where some agents are presented to users. An agent and its presentation together define an interactor. Defining the presentation of interactors is a design concern. Widgets are common re-usable interactors for which the presentation is usually well defined. Definitions of widgets may be stored in a library. We illustrate the characteristics of notations for interactor based specification using the Object-Z language and demonstrate using interactors from a widget library. Formal methods enable a "model-based" approach to be taken to the development of user-interface designs. A specification in terms of widgets is derivable from an abstract interactor-based specification. A corresponding user-interface design is usually easily identified from a widget-based specification. Interactor-based user-interface designs can be used to define an architecture for a corresponding system implementation. Derivation of a widget-based specification from an abstract specification corresponds to a task decomposition (i.e., the abstract and widget-based specifications enable the same tasks to be performed, although the operations involved differ). Task decomposition defines a compatibility relation between user-interface specifications. We give "specification patterns" to assist incrementally transforming an abstract user-interface specification to an equivalent specification in terms of widgets.

Page generated in 0.1603 seconds