By Topic

Software, IEE Proceedings -

Issue 2 • Date Apr 2002

Filter Results

Displaying Results 1 - 2 of 2
  • ODP computational-to-information viewpoint mappings: a translation of CORBA IDL to Z

    Publication Year: 2002 , Page(s): 57 - 63
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (541 KB)  

    The reference model of open distributed processing prescribes the use of a number of viewpoints (i.e. partial specifications). Specifications written in these viewpoints are likely to use different notations, e.g., the computational viewpoint is likely to include descriptions given in CORBA IDL, while the information viewpoint might well use a schema-based notation such as Z. To support such a specification scenario a translation from a subset of CORBA IDL to the Z specification notation is described, which has been implemented in a prototype translator based on the IDL parsing tool HaskellDirect. Although the main motivation is to integrate CORBA IDL into an existing multilanguage framework for viewpoint specification and consistency checking, the translation could also serve as the basis for a reverse translation from a subset of Z into IDL. In addition, it will help support a translation into Z from IDL specifications augmented with Z annotations that express behavioural constraints not expressible in IDL itself View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Classification-tree restructuring methodologies: a new perspective

    Publication Year: 2002 , Page(s): 65 - 74
    Cited by:  Papers (1)
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (711 KB)  

    The classification-tree method developed by Grochtmann et al. (1993, 1995) provided a useful approach for constructing test cases from functional specifications. It was automated by Chen and Poon (1997, 1998) through their tree construction methodology. In a follow-up study, Chen and Poon found that the effectiveness of constructing legitimate test cases could be improved under certain circumstances via a classification-tree restructuring algorithm. We develop another tree restructuring algorithm to cater for other situations not covered previously. The algorithms complement each other. We also compare the relative effectiveness of these algorithms and provide guidelines on applying them in practice View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.