Scheduled System Maintenance
IEEE Xplore is currently undergoing scheduled maintenance.
During this time, there may be intermittent impact on performance. We apologize for any inconvenience.

14th IEEE International Conference on Automated Software Engineering

12-15 Oct. 1999

Filter Results

Displaying Results 1 - 25 of 52
  • 14th IEEE International Conference on Automated Software Engineering

    Publication Year: 1999
    Request permission for commercial reuse | PDF file iconPDF (163 KB)
    Freely Available from IEEE
  • Exploration harnesses: tool-supported interactive discovery of commercial component properties

    Publication Year: 1999, Page(s):7 - 14
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (86 KB)

    A key problem in component-based software development (CBSD) is that developers have incomplete knowledge of components. In many cases, the only available source of such information is experimentation. In this paper we argue that the provision of tool support for automated and repeatable experiments can provide significant value to designers. Such tools, which we call exploration harnesses, promis... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An approach to software requirements elicitation using precepts from activity theory

    Publication Year: 1999, Page(s):15 - 23
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (51 KB)

    The goal of this work is to show that precepts from activity theory can be used in software requirements elicitation. Thus, we propose an approach to requirements elicitation using principles from this theory. Initially, we mention common problems found in requirements elicitation. Then we explain the main precepts of activity theory. Finally, we present a case study using the suggested approach t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data mining library reuse patterns in user-selected applications

    Publication Year: 1999, Page(s):24 - 33
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (124 KB)

    In this paper, we show how data mining can be used to discover library reuse patterns in user-selected applications. This can be helpful in building and debugging applications that use a particular library by observing how other developers have used that library in their applications. Specifically, we consider the problem of discovering association rules that identify library components that are o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Industrial applications of software synthesis via category theory

    Publication Year: 1999, Page(s):35 - 43
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (174 KB)

    Over the last two years, we have demonstrated the feasibility of applying category-theoretic methods in specifying, synthesizing, and maintaining industrial strength software systems. We have been using a first-of-its-kind tool for this purpose. Kestrel's Specware/sup TM/ software development system. In this paper, we describe our experiences and give an industrial perspective on what is needed to... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards automatic imperative program synthesis through proof planning

    Publication Year: 1999, Page(s):44 - 51
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (103 KB)

    An approach to automatic imperative program synthesis is presented which builds upon Gries' (1981) vision of developing a program and its proof hand in hand. To achieve this vision we rely on the proof planning paradigm, which enables the coupling of both heuristic and deductive components. By formalising structured programming and proof heuristics within the proof planning framework we focus the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An integration of deductive retrieval into deductive synthesis

    Publication Year: 1999, Page(s):52 - 61
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (142 KB)

    Deductive retrieval and deductive synthesis are two conceptually closely related software development methods which apply theorem proving techniques to support the construction of correct programs. In this paper, we describe an integration of both methods which combines their complementary benefits and alleviates some of their drawbacks. The core of our integration is an algorithm which automatica... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatic generation of test oracles: from pilot studies to application

    Publication Year: 1999, Page(s):63 - 72
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (86 KB)

    There is a trend towards the increased use of automation in V&V (verification and validation). Automation can yield savings in time and effort. For critical systems, where thorough V&V is required, these savings can be substantial. We describe a progression from pilot studies to development and use of V&V automation. We used pilot studies to ascertain opportunities for, and suitability... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An automatic and optimized test generation technique applying to TCP/IP protocol

    Publication Year: 1999, Page(s):73 - 80
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (72 KB)

    In this paper an automatic and optimized technique for test generation for communication protocol control and data portion is described, the goal is to minimize the number of tests with a guaranteed coverage. The test generation algorithm is applied to the client layer part of the TCP/IP protocol. The protocol used for the experiment is TCP-Reno, which is specified in the SDL language and is one o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Siddhartha: a method for developing domain-specific test driver generators

    Publication Year: 1999, Page(s):81 - 90
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (90 KB)

    Siddhartha applies the domain-specific language (DSL) paradigm to solve difficult problems in specification-based testing (SBT). Domain-specific test case data specifications (TestSpecs) and difficult-to-test program design styles engender difficult SBT problems, which are the essential phenomena of interest to Siddhartha. Difficult-to-test program design styles are explicitly represented by domai... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modular and incremental analysis of concurrent software systems

    Publication Year: 1999, Page(s):92 - 101
    Cited by:  Papers (2)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (190 KB)

    Modularization and abstraction are the keys to practical verification and analysis of large and complex systems. We present in an incremental methodology for the automatic analysis and verification of concurrent software systems. Our methodology is based on the theory of abstract interpretation. We first propose a compositional data flow analysis algorithm that computes invariants of concurrent sy... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automated translation of UML models of architectures for verification and simulation using SPIN

    Publication Year: 1999, Page(s):102 - 109
    Cited by:  Papers (18)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (70 KB)

    The Unified Modeling Language (UML) is fast becoming an industry standard for object-oriented modeling and analysis. Applying the UML to model, analyze and design dependable systems require methods and tools for model checking that are integrated with the UML and its support environment. Recent advances in model-checking technologies have led to the development of approaches and tools to check the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A visualization tool for constraint program debugging

    Publication Year: 1999, Page(s):110 - 117
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (250 KB)

    Constraint programming is an emerging technology that offers an original approach allowing for efficient and flexible solving of complex problems. Its main advantage relies in its ability to compute with partial information expressed in terms of constraints. These constraints are monotonically, accumulated during the program execution in order to restrict the problem search space. We address one o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Advanced modelling and verification techniques applied to a cluster file system

    Publication Year: 1999, Page(s):119 - 126
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (99 KB)

    This paper describes the application of advanced formal modelling techniques and tools from the CADP toolset to the verification of CFS, a distributed file system kernel. After a short overview of the specification of CFS, we describe the techniques used for model generation and verification, and their application to CFS. Two original aspects are put forth: firstly, the model is generated in a com... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Verification of picture generated code

    Publication Year: 1999, Page(s):127 - 136
    Cited by:  Papers (4)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (313 KB)

    Tools such as Simulink(R) are being used by engineers around the world to model and solve real problems about dynamical systems. In particular control systems are modelled graphically, simulated and then code is generated automatically. Code generated from such a tool is being proposed for use in safety critical control systems. The problem for certifiers is why should they trust such generated co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Combining fault avoidance, fault removal and fault tolerance: an integrated model

    Publication Year: 1999, Page(s):137 - 146
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (114 KB)

    Fault avoidance, fault removal and fault tolerance represent three successive lines of defense against the contingency of faults in software systems and their impact on system reliability. Beyond the colorful discussions of the relative merits of these techniques, the law of diminishing returns advocates that they be used in concert, where each is applied whenever it is most effective. Such a prem... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fixing some transformation problems

    Publication Year: 1999, Page(s):148 - 157
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (791 KB)

    Defining domain-specific abstractions for generator systems leads to a quandary between choosing abstractions that exhibit powerful programming amplification through the combinatorial opportunities provided by composition, and choosing abstractions that can be easily transformed into high-performance code. Most generators opt for abstraction to improve programming productivity, which usually compr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Retrenchment: extending the reach of refinement

    Publication Year: 1999, Page(s):158 - 165
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (119 KB)

    Discusses a simple example that demonstrates various expressive limitations of the refinement calculus, and suggests a liberalization of refinement, called retrenchent, which supports an analogous formal development calculus. Useful concrete system behaviour can be specified outside the domain of pure refinement, and a case is made for fluidity between I/O and state components across the developme... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An ML editor based on proofs-as-programs

    Publication Year: 1999, Page(s):166 - 173
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (112 KB)

    C/sup Y/NTHIA is a novel editor for the functional programming language ML in which each function definition is represented as the proof of a simple specification. Users of C/sup Y/NTHIA edit programs by applying sequences of high-level editing commands to existing programs. These commands make changes to the proof representation from which a new program is then extracted. The use of proofs is a s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evolving object-oriented designs with refactorings

    Publication Year: 1999, Page(s):174 - 181
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (43 KB)

    Refactorings are behaviour-preserving program transformations that automate design-level changes in object-oriented applications. Our previous research established that many schema transformations, design patterns and hot-spot meta-patterns are automatable. This research evaluates whether refactoring technology can be transferred to the mainstream by restructuring non-trivial C++ applications. The... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • AML: an Architecture Meta-Language

    Publication Year: 1999, Page(s):183 - 190
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (67 KB)

    The language AML (Architecture Meta-Language) is used to specify the semantics of architecture description languages (ADLs). It is a very primitive language, having declarations for only three constructs: elements, kinds and relationships. Each of these constructs may be constrained via predicates in temporal logic. The essence of AML is the ability to specify structure and to constrain the dynami... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatically detecting mismatches during component-based and model-based development

    Publication Year: 1999, Page(s):191 - 198
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (73 KB)

    A major emphasis in software development is placed on identifying and reconciling architectural and design mismatches. These mismatches happen during software development on two levels: while composing system components (e.g. COTS or in-house developed) and while reconciling view perspectives. Composing components into a system and 'composing' views (e.g. diagrams) into a system model are often se... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Separating concerns in direct manipulation user interfaces

    Publication Year: 1999, Page(s):199 - 206
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (85 KB)

    Direct-manipulation user interfaces are difficult to implement as a tapered hierarchy. Features such as drag enabling and continuous graphical feedback require frequent interaction and collaboration among a large number of objects in multiple layers. These collaborations complicate the design of the interfaces in the various layers. We present a new component-interface model called a "mode compone... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An overview of Lutess a specification-based tool for testing synchronous software

    Publication Year: 1999, Page(s):208 - 215
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (114 KB)

    Test data generation and test execution are both time-consuming activities when done manually. Automated testing methods promise to save a great deal of human effort. This especially applies to reactive programs which have complex behaviour over time and which require long test sequences. We present Lutess, a testing environment for synchronous reactive software. Lutess produces automatically and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Applying test automation to type acceptance testing of telecom networks: a case study with customer participation

    Publication Year: 1999, Page(s):216 - 223
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (79 KB)

    This paper presents results of a joint case study of Ericsson and the German cellular network provider Mannesmann Mobilfunk, targeted at automating type acceptance tests. Faced with a growing number of tests required to verify the quality of the telecom switch software, both companies seek to improve testing efficiency by means of test automation. In a joint effort, a test platform originally crea... View full abstract»

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