By Topic

18th IEEE International Conference on Automated Software Engineering, 2003. Proceedings.

6-10 Oct. 2003

Filter Results

Displaying Results 1 - 25 of 56
  • Proceedings 18th IEEE International Conference on Automated Software Engineering

    Publication Year: 2003
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (253 KB)

    The following topics are discussed: requirements, interfaces, and groupware; software architectures and distributed systems; model checking; software components; software evolution and maintenance; and automated software engineering. View full abstract»

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

    Publication Year: 2003, Page(s):381 - 382
    Request permission for commercial reuse | PDF file iconPDF (158 KB)
    Freely Available from IEEE
  • Specification and synthesis of hybrid automata for physics-based animation

    Publication Year: 2003, Page(s):80 - 91
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (293 KB) | HTML iconHTML

    Physics-based animation programs can often be modeled in terms of hybrid automata. A hybrid automaton includes both discrete and continuous dynamical variables. The discrete variables define the automaton's modes of behavior. The continuous variables are governed by mode-dependent differential equations. This paper describes a system for specifying and automatically synthesizing physics-based anim... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A type system for statically detecting spreadsheet errors

    Publication Year: 2003, Page(s):174 - 183
    Cited by:  Papers (26)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (371 KB) | HTML iconHTML

    We describe a methodology for detecting user errors in spreadsheets, using the notion of units as our basic elements of checking. We define the concept of a header and discuss two types of relationships between headers, namely is-a and has-a relationships. With these, we develop a set of rules to assign units to cells in the spreadsheet. We check for errors by ensuring that every cell has a well-f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A programmable client-server model: robust extensibility via DSLs

    Publication Year: 2003, Page(s):70 - 79
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (290 KB) | HTML iconHTML

    The client-server model has been successfully used to support a wide variety of families of services in the context of distributed systems. However, its server-centric nature makes it insensitive to fast changing client characteristics like terminal capabilities, network features, user preferences and evolving needs. To overcome these key limitations, we present an approach to enabling a server to... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • What test oracle should I use for effective GUI testing?

    Publication Year: 2003, Page(s):164 - 173
    Cited by:  Papers (53)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (712 KB) | HTML iconHTML

    Test designers widely believe that the overall effectiveness and cost of software testing depends largely on the type and number of test cases executed on the software. In this paper we show that the test oracle used during testing also contributes significantly to test effectiveness and cost. A test oracle is a mechanism that determines whether software executed correctly for a test case. We defi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • DeCo: a declarative coordination framework for scientific model federations

    Publication Year: 2003, Page(s):60 - 69
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (488 KB) | HTML iconHTML

    Program federation is assembling a software system from cooperating but independent application programs. We present DeCo, a declarative approach to creating and coordinating federations, and discuss its application in the domain of scientific computing. DeCo is meant to automate several aspects of the typically manual process of program federation. A federation is expressed in the functional lang... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Model-based verification of Web service compositions

    Publication Year: 2003, Page(s):152 - 161
    Cited by:  Papers (170)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (439 KB) | HTML iconHTML

    In this paper, we discuss a model-based approach to verifying Web service compositions for Web service implementations. The approach supports verification against specification models and assigns semantics to the behavior of implementation model so as to confirm expected results for both the designer and implementer. Specifications of the design are modeled in UML (Unified Modeling Language), in t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatically inferring concern code from program investigation activities

    Publication Year: 2003, Page(s):225 - 234
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (316 KB) | HTML iconHTML

    When performing a program evolution task, developers typically spend a significant amount of effort investigating and reinvestigating source code. To reduce this effort, we propose a technique to automatically infer the essence of program investigation activities as a set of concern descriptions. The concern descriptions produced by our technique list methods and fields of importance in the contex... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new structural coverage criterion for dynamic detection of program invariants

    Publication Year: 2003, Page(s):49 - 58
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (320 KB) | HTML iconHTML

    Dynamic detection of program invariants is emerging as an important research area with many challenging problems. Generating suitable test cases that support accurate detection of program invariants is crucial to the dynamic approach of program invariant detection. In this paper, we propose a new structural coverage criterion called invariant-coverage criterion for dynamic detection of program inv... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generating design pattern detectors from pattern specifications

    Publication Year: 2003, Page(s):245 - 248
    Cited by:  Papers (11)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (241 KB) | HTML iconHTML

    We present our approach to support program understanding by a tool that generates static and dynamic analysis algorithms from design pattern specifications to detect design patterns in legacy code. We therefore specify the static and dynamic aspects of patterns as predicates, and represent legacy code by predicates that encode its attributed abstract syntax trees. Given these representations, the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatic generation of content management systems from EER-based specifications

    Publication Year: 2003, Page(s):259 - 262
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (234 KB) | HTML iconHTML

    ERW (entity-relationship Web browser) is an innovative open-source system for handling complex databases using a Web browser. Once the details of an enhanced entity-relationship schema have been specified in XML (eXtended Markup Language), ERW generates a complete application that lets the user interact with the database. Then, specification percolation makes it possible to customize heavily the a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Theoretical foundations of updating systems

    Publication Year: 2003, Page(s):291 - 294
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (274 KB) | HTML iconHTML

    Software systems inevitably require update and revision during their lifetime. The concept of features is often used to model system update: a feature is a unit of functionality which may be integrated into a base system. Possible features of an email client program include: spam filtering; absence messages; selective forwarding; and encryption. In our work, we use AI techniques to understand the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automating component adaptation for reuse

    Publication Year: 2003, Page(s):142 - 151
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (308 KB) | HTML iconHTML

    Reuse is a sound and practical design technique in many engineering disciplines. Although successful instances of software reuse are becoming more common, the cost of reuse tends to outweigh the potential benefits. The costs of software reuse include establishing and maintaining a library of reusable components, searching for applicable components to be reused, as well as adapting components towar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Model checking software requirement specifications using domain reduction abstraction

    Publication Year: 2003, Page(s):314 - 317
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (279 KB) | HTML iconHTML

    As an automated verification and validation tool, model checking can be quite effective in practice. Nevertheless, model checking has been quite inefficient when dealing with systems with data variables over a large (or infinite) domain, which is a serious limiting factor for its applicability in practice. To address this issue, we have investigated a static abstraction technique, domain reduction... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Graph rewriting and transformation (GReAT): a solution for the model integrated computing (MIC) bottleneck

    Publication Year: 2003, Page(s):364 - 368
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (220 KB) | HTML iconHTML

    Graph grammars and transformations (GGT) have been a field of theoretical study for over two decades. However, it has produced only a handful of practical implementations. GGT needs a widely used practical application to exploit its potential. On the other hand model integrated computing (MIC) has grown from the practical standpoint and is widely used and recognized in both industry and practice t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SPQR: flexible automated design pattern extraction from source code

    Publication Year: 2003, Page(s):215 - 224
    Cited by:  Papers (27)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (671 KB) | HTML iconHTML

    Previous automated approaches to discovering design patterns in source code have suffered from a need to enumerate static descriptions of structural and behavioral relationships, resulting in a finite library of variations on pattern implementation. Our approach, system for pattern query and recognition, or SPQR, differs in that we do not seek statically to encode each variant of the patterns that... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A pragmatic study of binary class relationships

    Publication Year: 2003, Page(s):277 - 280
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (280 KB) | HTML iconHTML

    A discontinuity exists between modeling and object-oriented programming languages. This discontinuity is a consequence of ambiguous notions in modeling languages and lack of corresponding notions in object-oriented programming languages. It hinders the transition between software implementation and design and hampers software maintenance. This discontinuity is particularly acute for binary class r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automation for exception freedom proofs

    Publication Year: 2003, Page(s):343 - 346
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (240 KB) | HTML iconHTML

    Run-time errors are typically seen as unacceptable within safety and security critical software. The SPARK approach to the development of high integrity software addresses the problem of run-time errors through the use of formal verification. Proofs are constructed to show that each run-time check will never raise an error, thus proving freedom from run-time exceptions. Here we build upon the succ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tool-assisted unit test selection based on operational violations

    Publication Year: 2003, Page(s):40 - 48
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (314 KB) | HTML iconHTML

    Unit testing, a common step in software development, presents a challenge. When produced manually, unit test suites are often insufficient to identify defects. The main alternative is to use one of a variety of automatic unit test generation tools: these are able to produce and execute a large number of test inputs that extensively exercise the unit under test. However, without a priori specificat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel breadth-first search LTL model-checking

    Publication Year: 2003, Page(s):106 - 115
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (356 KB) | HTML iconHTML

    We propose a practical parallel on-the-fly algorithm for enumerative LTL (linear temporal logic) model checking. The algorithm is designed for a cluster of workstations communicating via MPI (message passing interface). The detection of cycles (faulty runs) effectively employs the so called back-level edges. In particular, a parallel level-synchronized breadth-first search of the graph is performe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extending diagnosis to debug programs with exceptions

    Publication Year: 2003, Page(s):240 - 244
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2795 KB) | HTML iconHTML

    Even with modern software development methodologies, the actual debugging of source code, i.e., location and identification of errors in the program when errant behavior is encountered during testing, remains a crucial part of software development. To apply model-based diagnosis techniques which have long been state of the art in hardware diagnosis, for automatic debugging a model of a given progr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Semi-automatic fault localization and behavior verification for physical system simulation models

    Publication Year: 2003, Page(s):253 - 258
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (297 KB) | HTML iconHTML

    Mathematical modeling and simulation of complex physical systems are emerging as key technologies in engineering. Modern approaches to physical system simulation allow users to specify simulation models with the help of equation-based languages. Due to the high-level declarative abstraction of these languages program errors are extremely hard to find. This paper presents an algorithmic semi-automa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Architecture style-based calculi for non-functional properties

    Publication Year: 2003, Page(s):299 - 303
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (234 KB) | HTML iconHTML

    Engineers wield various "calculi" to help determine solutions to their problems, calculation tools varying in power from tensile strength tables to the differential calculus. A calculus is normally based on induction over an algebraic structure. Here the author explores how architecture styles can be used to describe such structures. An example calculus based on an "integration" style is presented... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Refactoring C with conditional compilation

    Publication Year: 2003, Page(s):323 - 326
    Cited by:  Papers (7)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (228 KB) | HTML iconHTML

    Refactoring, an important technique for increasing flexibility of the source code, can be applied with much ease and efficiency by using automated tools. There is currently a lack of refactoring tools for C with full support for preprocessor directives because directives complicate refactorings in many ways. This paper describes refactoring of C programs in the presence of conditional compilation ... View full abstract»

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