By Topic

Automated Software Engineering, 1999. 14th IEEE International Conference on.

Date 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
  • Author index

    Publication Year: 1999, Page(s):339 - 340
    Request permission for commercial reuse | PDF file iconPDF (8 KB)
    Freely Available from IEEE
  • 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 (196 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.
  • 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 (96 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.
  • 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 (796 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.
  • Implementing effective automatic cryptographic protocol analysis

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

    A cryptographic protocol is a short series of message exchanges, usually involving encryption, intended to establish secure communication over an insecure network. A protocol fails if an active wiretapper can obtain confidential information or impersonate a legitimate user, without performing cryptanalysis, by blocking, replaying, relabeling or otherwise modifying messages. Since the number of pos... 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 (120 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.
  • Beyond components-connections-constraints: dealing with software architecture difficulties

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

    Recent work in the area of software architectures is exploring the use of formal methods for specification and analysis of software architecture designs. The work is particularly aimed at achieving better possibilities for evolution, sharing and reuse among software entities. However, it is believed that specifying architecture components and connections without revealing their underlying design a... 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 (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (84 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.
  • 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 (72 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.
  • A formal ontology for re-use of software architecture documents

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

    Software architecture has been established as a viable level of representation for reuse in practical software engineering efforts. The main reason for this is that an architectural view of software is sufficiently abstract to have many instantiations. Even with technologies such as CORBA and JavaBeans, which emphasize reuse of components, the realization of widespread reuse has been severely limi... 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 (148 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.
  • An approach to automatic code generation for safety-critical systems

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

    Automated translation, or code generation, of a formal requirements model to production code can alleviate many of the problems associated with design and implementation. In this paper, we outline the requirements of such code generation to obtain a high level of confidence in the correctness of the translation process. We then describe a translator for a state-based modeling language called RSML ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A comparative study between linear programming verification (LPV) and other verification methods

    Publication Year: 1999, Page(s):299 - 302
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (64 KB)

    Compares our linear programming technology for software verification (LPV) with other verification systems: explicit exploration using partial order reduction (Spin) and implicit exploration using BDDs (Xeve/Esterel). The case study is a safety property of an easily-scalable problem (a bus arbiter). The results show that exploration-based methods (Spin and Xeve/Esterel) have an overall exponential... 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 (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (52 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.
  • Verification of picture generated code

    Publication Year: 1999, Page(s):127 - 136
    Cited by:  Papers (3)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (320 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.
  • Enhancing annotation visibility for software inspection

    Publication Year: 1999, Page(s):243 - 246
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (40 KB)

    Annotation of software artifacts is common in software development, and vital for software inspection. People viewing annotated artifacts encounter delocalization: they must understand various parts of an artifact (and their annotations) to understand the part they are viewing. We taxonomize delocalization within software systems into lateral delocalization (different items of the artifact within ... 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 (80 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.
  • Component-based systems as an aid to design validation

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

    There is a continuing need for software engineers to design better-quality systems more quickly. Component-based technologies promise to make this possible, but modern systems are too complex for a full analysis of their behaviour to be practical. We propose that a reasonable alternative is to analyse abstract models of the essential features of a system. Since these models are abstract, they need... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatic synthesis of control software for an industrial automation control system

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

    We present a case study on automatic synthesis of control software from formal specifications for an industrial automation control system. Our aim is to compare the effectiveness (i.e. design effort and controller quality) of automatic controller synthesis from closed loop formal specifications with that of manual controller design, followed by automatic verification. Our experimental results show... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards adaptive web agents

    Publication Year: 1999, Page(s):335 - 338
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (40 KB)

    There is an increasingly large demand for software systems which are able to operate effectively in dynamic environments. In such environments, automated software engineering is extremely valuable since a system needs to evolve in order to respond to changing requirements. One way for software to evolve is for it to reflect upon a model of its own design. A key challenge in reflective evolution is... 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 (92 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 c... 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 (108 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.
  • vUML: a tool for verifying UML models

    Publication Year: 1999, Page(s):255 - 258
    Cited by:  Papers (52)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (40 KB)

    The Unified Modelling Language (UML) is a standardised notation for describing object oriented software designs. We present vUML, a tool that automatically verifies UML models where the behaviour of the objects is described using UML Statecharts diagrams. The tool uses the SPIN model checker to perform the verification, but the user does not have to know how to use SPIN or the PROMELA language. If... 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 (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (44 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.