Proceedings 17th IEEE International Conference on Automated Software Engineering,

23-27 Sept. 2002

Filter Results

Displaying Results 1 - 25 of 48
  • Proceedings ASE 2002. 17th IEEE International Conference on Automated Software Engineering [front matter]

    Publication Year: 2002
    Request permission for commercial reuse | PDF file iconPDF (308 KB)
    Freely Available from IEEE
  • A model of planning and enactment support in complex software development projects

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

    Summary form only given. We propose an approach to facilitating not only project enactment but also project planning and monitoring, by tracking all decisions made during project planning and enactment and managing dependencies between these decisions. In order to identify those dependencies relevant for a decision, we established an extendable model of planning and plan enactment, which explicitl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed modular model checking

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

    Summary form only given. Model checking is a formal method that verifies whether a finite state model of a system satisfies a specification given as a temporal logic formula. The most severe problem model checking suffers from is the so called state explosion problem. Distribution is one of the techniques that combat the state explosion. The aim is to distribute the state space among a number of c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adapting applications on the fly

    Publication Year: 2002
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (193 KB) | HTML iconHTML

    Summary form only given. Adapting a component-based application means adapting one or more of its components, and in general, adapting a component at run-time means disconnecting it from the application and connecting a new version of this component. Many approaches like OLAN and DCUP are based on component models in which each component is constituted by a functional part and a control part. This... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Process support for tools interoperability

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

    Summary form only given. Our work seeks to build a platform that makes entities of various types (component, COTS, tools, etc.) interoperate in order to build a new application. We call this new kind of application a federation. Our federations use workflow as a support for application integration and interoperability. In this approach, the process is not defined in term of tools and their paramet... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatic synthesis of distributed systems

    Publication Year: 2002
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (191 KB) | HTML iconHTML

    Summary form only given. Our research aims towards a new method of synthesis for distributed systems using Mazurkiewicz traces for specification and asynchronous automata for models. Mazurkiewicz trace languages are languages closed under an explicit independence relation between actions and therefore they are suitable to describe concurrent behaviour. The main objectives of this work are: (a) to ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatic inter-procedural test case generation

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

    Summary form only given. Our work is based on a new approach of the automatic structural test case generation problem defined previously. It uses constraint logic programming (CLP) to try and solve the problem of generating test cases in order to attain the structural covering of a procedure. A test tool prototype, named Inka has been developed by Thales Systemes Aeroportes. Inka. is designed for ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Semantic links and co-evolution in object-oriented software development

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

    Summary form only given. This research focuses on the problem of the semantic linking and co-evolution of the different design diagrams and models of an object-oriented software application. The blueprint of an object-oriented software application consists mainly of models drawn in a modeling language. The state-of-the-art modeling language in object-oriented software development is the Unified Mo... View full abstract»

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

    Publication Year: 2002, Page(s):318 - 319
    Request permission for commercial reuse | PDF file iconPDF (180 KB)
    Freely Available from IEEE
  • Enabling iterative software architecture derivation using early non-functional property evaluation

    Publication Year: 2002, Page(s):172 - 182
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (329 KB) | HTML iconHTML

    The structure of a software architecture strongly influences the architecture's ability to prescribe systems satisfying functional requirements, non functional requirements, and overall qualities such as maintainability, reusability, and performance. Achieving an acceptable architecture requires an iterative derivation and evaluation process that allows refinement based on a series of tradeoffs. R... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Assumption generation for software component verification

    Publication Year: 2002, Page(s):3 - 12
    Cited by:  Papers (37)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (321 KB) | HTML iconHTML

    Model checking is an automated technique that can be used to determine whether a system satisfies certain required properties. The typical approach to verifying properties of software components is to check them for all possible environments. In reality, however, a component is only required to satisfy properties in specific environments. Unless these environments are formally characterized and us... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automating requirements traceability: Beyond the record & replay paradigm

    Publication Year: 2002, Page(s):163 - 171
    Cited by:  Papers (42)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (297 KB) | HTML iconHTML

    Requirements traceability (RT) aims at defining relationships between stakeholder requirements and artifacts produced during the software development life-cycle. Although techniques for generating and validating RT are available, RT in practice often suffers from the enormous effort and complexity of creating and maintaining traces or from incomplete trace information that cannot assist engineers ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generating product-lines of product-families

    Publication Year: 2002, Page(s):81 - 92
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (311 KB) | HTML iconHTML

    GenVoca is a methodology and technology for generating product-lines, i.e. building variants of a program. The primitive components from which applications are constructed are refinements or layers, which are modules that implement a feature that many programs of a product-line can share. Unlike conventional components (e.g., COM, CORBA, EJB), a layer encapsulates fragments of multiple classes. Se... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dependence management for dynamic reconfiguration of component-based distributed systems

    Publication Year: 2002, Page(s):279 - 284
    Cited by:  Papers (5)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (291 KB) | HTML iconHTML

    The growing popularity of wired and wireless Internet requires distributed systems to be more flexible, adaptive and easily extensible. Dynamic reconfiguration of component-based distributed systems is one possible solution to meet these demands. However, there are some challenges for building dynamically reconfigurable distributed systems. Managing dependencies among components is one of the most... View full abstract»

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

    Publication Year: 2002, Page(s):23 - 34
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (488 KB) | HTML iconHTML

    A design pattern encapsulates the knowledge of object-oriented designers into re-usable artifacts. A design pattern is a descriptive device that fosters software design re-use. There are several reasons why design patterns are not used as generative constructs that support code re-use. The first reason is that design patterns describe a set of solutions to a family of related design problems and i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • VIATRA - visual automated transformations for formal verification and validation of UML models

    Publication Year: 2002, Page(s):267 - 270
    Cited by:  Papers (32)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (242 KB) | HTML iconHTML

    The VIATRA (visual automated model transformations) framework is the core of a transformation-based verification and validation environment for improving the quality of systems designed using the Unified Modeling Language by automatically checking consistency, completeness, and dependability requirements. In the current paper, we present an overview of (i) the major design goals and decisions, (ii... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Monitoring requirements: a case study

    Publication Year: 2002, Page(s):299 - 304
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (410 KB) | HTML iconHTML

    In our study of composite systems, we found a class of requirements that could not be guaranteed to hold. Specifically, these requirements required the environment of the overall system to behave in ways that could not be controlled. The best we could do in such cases was to note the assumptions placed on the environment for the requirements to be met, and then monitor the environment at runtime t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Experience report on automated procedure construction for deductive synthesis

    Publication Year: 2002, Page(s):69 - 78
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (415 KB) | HTML iconHTML

    Deductive program synthesis systems based on automated theorem proving offer the promise of "correct by construction" software. However, the difficulty encountered in constructing usable deductive synthesis systems has prevented their widespread use. Amphion is a real-world, domain-independent program synthesis system. It is specialized to specific applications through the creation of an operation... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • What makes finite-state models more (or less) testable?

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

    This paper studies how details of a particular model can effect the efficacy of a search for detects. We find that if the test method is fixed, we can identity classes of software that are more or less testable. Using a combination of model mutators and machine learning, we find that we can isolate topological features that significantly change the effectiveness of a defect detection tool. More sp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Report on the workshop on the state of the art in automated software engineering

    Publication Year: 2002, Page(s):307 - 308
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (207 KB) | HTML iconHTML

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adding value to formal test oracles

    Publication Year: 2002, Page(s):275 - 278
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (245 KB) | HTML iconHTML

    Test oracles are programs which check the output of test cases run on other programs. We describe techniques which add value to formally-defined test oracles in three ways: (a) by measuring functional coverage of test suites, (b) by giving automated support to the process of validating the oracles, and (c) by automating the generation of test cases from the oracles. The techniques involve the use ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generating test data for functions with pointer inputs

    Publication Year: 2002, Page(s):149 - 160
    Cited by:  Papers (13)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (390 KB) | HTML iconHTML

    Generating test inputs for a path in a function with integer and real parameters is an important but difficult problem. The problem becomes more difficult when pointers are passed as inputs to a function. In this case, the shape of the input data structure as well as the data values in the fields of this data structure need to be determined for traversal of the given path. The existing techniques ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generating expected results for automated black-box testing

    Publication Year: 2002, Page(s):139 - 148
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (323 KB) | HTML iconHTML

    In this paper we describe a technique for generating expected results for automated black-box testing. Generating expected results allows larger automated test suites to be created, moving us toward continuous product testing. Our technique uses a program's Input-Output (IO) relationships to identify unique combinations of program inputs that influence program outputs. With this information, a sma... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SeDiTeC-testing based on sequence diagrams

    Publication Year: 2002, Page(s):261 - 266
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (264 KB) | HTML iconHTML

    In this paper we present a concept for automated testing of object-oriented applications and a tool called SeDiTeC that implements these concepts for Java applications. SeDiTeC uses UML sequence diagrams, that are complemented by test case data sets consisting of parameters and return values for the method calls, as test specification and therefore can easily be integrated into the development pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • No Java without caffeine: A tool for dynamic analysis of Java programs

    Publication Year: 2002, Page(s):117 - 126
    Cited by:  Papers (8)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (408 KB) | HTML iconHTML

    To understand the behavior of a program, a maintainer reads some code, asks a question about this code, conjectures an answer, and searches the code and the documentation for confirmation of her conjecture. However, the confirmation of the conjecture can be error-prone and time-consuming because the maintainer has only static information at her disposal. She would benefit from dynamic information.... View full abstract»

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