1991 ◽  
Vol 20 (345) ◽  
Author(s):  
Jens Palsberg ◽  
Michael I. Schwartzbach

We present a new approach to inferring types in untyped object-oriented programs with inheritance, assignments, and late binding. It guarantees that all messages are understood, annotates the program with type information, allows polymorphic methods, and can be used as the basis of an optimizing compiler. Types are finite sets of classes and subtyping is set inclusion. Using a trace graph, our algorithm constructs a set of conditional type constraints and computes the least solution by least fixed-point derivation.


Author(s):  
JAE HUN CHOI ◽  
JAE DONG YANG ◽  
DONG GILL LEE

In this paper, we propose a new approach for managing domain specific thesauri, where object-oriented paradigm is applied to thesaurus construction and query-based browsing. The approach provides an object-oriented mechanism to assist domain experts in constructing thesauri; it determines a considerable part of relationship degrees between terms by inheritance and supplies the domain expert with information available from other parts of the thesaurus being constructed or already constructed. In addition to that, it enables domain experts to incrementally construct the thesaurus, since the automatically determined relationship degrees can be refined whenever a more sophisticated thesaurus is needed. It may minimize domain experts' burden caused by the exhaustive specification of individual relationship. This approach also provides a query-based browsing facility, which enables users to find desired thesaurus terms without tedious browsing in the thesaurus. A browsing query can be formulated with terms rather ambiguous, yet capable of deriving the desired terms. This browsing query is useful especially when users want precise results. In other words, it is useful when they want to use only thesaurus terms carefully selected in reformulating Boolean queries. To demonstrate the feasibility of our approach, we fully implemented an object-based thesaurus system, which supports the semiautomatic thesaurus construction and the query-based browsing facility.


2013 ◽  
Vol 2013 ◽  
pp. 1-11 ◽  
Author(s):  
Kagiso Mguni ◽  
Yirsaw Ayalew

Software maintenance is an important activity in software development. Some development methodologies such as the object-oriented have contributed in improving maintainability of software. However, crosscutting concerns are still challenges that affect the maintainability of OO software. In this paper, we discuss our case study to assess the extent of maintainability improvement that can be achieved by employing aspect-oriented programming. Aspect-oriented programming (AOP) is a relatively new approach that emphasizes dealing with crosscutting concerns. To demonstrate the maintainability improvement, we refactored a COTS-based system known as OpenBravoPOS using AspectJ and compared its maintainability with the original OO version. We used both structural complexity and concern level metrics. Our results show an improvement of maintainability in the AOP version of OpenBravoPOS.


Author(s):  
Shadi Banitaan ◽  
Kendall E. Nygard ◽  
Kenneth Magel

Object-oriented software systems contain large number of modules which make unit testing, integration testing, and system testing very difficult and challenging. While the aim of unit testing is to show that individual modules are working properly and the aim of the system testing is to determine whether the whole system meets its specifications, the aim of integration testing is to uncover errors in the interactions between system modules. However, it is generally impossible to test all connections between modules because of time and budget constraints. Thus, it is important to focus the testing on the connections presumed to be more error-prone. The goal of this work is to guide software testers where in a software system to focus when performing integration testing to save time and resources. This paper proposes a new approach to predict and rank error-prone connections. We use method level metrics that capture both dependencies and internal complexity of methods. We performed experiments on several Java applications and used error seeding techniques for evaluation. The experimental results showed that our approach is effective for selecting the test focus in integration testing.


1989 ◽  
Vol 27 (1-5) ◽  
pp. 127-132 ◽  
Author(s):  
S. Goutas ◽  
P. Soupos ◽  
D. Christodoulakis

Author(s):  
Fairouz Dahi ◽  
Nora Bounour

International audience The existence of crosscutting concerns tangled or scattered, complicates the understanding and evolution of object oriented source code. The industrial adoption of aspect-oriented paradigm has led to research new approaches supporting aspect oriented migration. This migration requires the identification of crosscutting concerns, in order to encapsulate them into aspects. We propose in this paper a new approach for the identification of crosscutting concerns at the conceptual level. We materialize this latter by the UML class and sequence diagrams. We use the formal concept analysis to group scattered functionalities in sequence diagrams, and we analyze the order of method calls to detect the tangled ones. Then, we filter all obtained candidate aspects, in order to avoid the mistakes.


Author(s):  
Zoran Ž. Avramović ◽  
Radomir Z. Radojičić ◽  
Saša D. Mirković

The paper presents original object oriented programming system ARS for modelling and simulation queuing systems. Programming system was developed in programming language C++. It establishes connection with intrinsic, but also with other Windows programming packages, in a simple way, through object oriented environment. Basic characteristics and possibilities of programming system, as well as comparative analysis of simulators: mathematical model (analytical solution) - GPSS/H - ARS, on the example of closed queuing network in the paper is given. The significant application for computer performance evaluation is reported.


Sign in / Sign up

Export Citation Format

Share Document