By Topic

Proceedings ASE 2000. Fifteenth IEEE International Conference on Automated Software Engineering

11-15 Sept. 2000

Filter Results

Displaying Results 1 - 25 of 47
  • ASE 2000 [front matter]

    Publication Year: 2000, Page(s):iii - viii
    Request permission for commercial reuse | PDF file iconPDF (228 KB)
    Freely Available from IEEE
  • Model checking programs

    Publication Year: 2000, Page(s):3 - 11
    Cited by:  Papers (115)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (973 KB)

    The majority of the work carried out in the formal methods community throughout the last three decades has (for good reasons) been devoted to special languages designed to make it easier to experiment with mechanized formal methods such as theorem provers and model checkers. In this paper, we give arguments for why we believe it is time for the formal methods community to shift some of its attenti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exploring the design of an intentional naming scheme with an automatic constraint analyzer

    Publication Year: 2000, Page(s):13 - 22
    Cited by:  Papers (7)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (830 KB)

    Lightweight formal modeling and automatic analysis were used to explore the design of the intentional naming system (INS), a new scheme for resource discovery in a dynamic networked environment. We constructed a model of INS in Alloy a lightweight relational notation, and analyzed it with the Alloy Constraint Analyzer, a fully automatic simulation and checking tool. In doing so, we exposed several... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Management of change in structured verification

    Publication Year: 2000, Page(s):23 - 31
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (876 KB)

    The use of formal methods in large complex applications implies the need for an evolutionary formal program development in which specification and verification phases are interleaved. Any change of a specification either by adding new parts or by changing erroneous parts affects existing verification work in a subtle way. We present a truth maintenance system for structured specification and verif... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A comparison of questionnaire-based and GUI-based requirements gathering

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

    Software development includes gathering information about tasks, work practices and design options from users. Traditionally requirements gathering takes two forms. Interviews and participatory design (PD) practices gather rich information about the task and the domain but require face-to-face communication between the software engineers and the users. When such communication is not possible, trad... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CM-Builder: an automated NL-based CASE tool

    Publication Year: 2000, Page(s):45 - 53
    Cited by:  Papers (22)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (885 KB)

    This paper describes a natural language-based CASE tool called CM-Builder which aims at supporting the analysis stage of software development in an object-oriented framework. CM-Builder uses robust natural language processing techniques to analyse software requirements texts written in English and build an integrated discourse model of the processed text, represented in a semantic network. This se... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Finding comparatively important concepts between texts

    Publication Year: 2000, Page(s):55 - 60
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (612 KB)

    Finding important concepts is a common task in requirements engineering. For example, it is needed when building models of a domain or organising requirements documents. Since a lot of information is available in textual form, methods to identify important concepts from texts are potentially useful. Traditional methods for finding important concepts from texts rely on the assumption that the most ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Upgrading legacy instances of reactive systems

    Publication Year: 2000, Page(s):63 - 72
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (882 KB)

    A software product typically goes through many "upgrades" (version changes) over its lifetime. Reactive systems, such as e-mail clients, software agents, proxies, traffic controllers, and telephone switches are no exception. Evolving such stateful systems is made difficult by the fact that new versions of the software must deal correctly with legacy instances. Users of earlier versions have invest... View full abstract»

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

    Publication Year: 2000, Page(s):73 - 80
    Cited by:  Papers (8)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (796 KB)

    Finding changed identifiers in programs is important for program comparison and merging. Comparing two versions of a program is complicated if renaming has occurred. Textual merging is highly unreliable if, in one version, identifiers were renamed, while in the other version, code using the old identifiers was added or modified. A tool that automatically detects renamed identifiers between pairs o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mutation operators for specifications

    Publication Year: 2000, Page(s):81 - 88
    Cited by:  Papers (36)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (641 KB)

    Testing has a vital support role in the software engineering process, but developing tests often takes significant resources. A formal specification is a repository of knowledge about a system, and a recent method uses such specifications to automatically generate complete test suites via mutation analysis. We define an extensive set of mutation operators for use with this method. We report the re... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The use of abduction and recursion-editor techniques for the correction of faulty conjectures

    Publication Year: 2000, Page(s):91 - 99
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (775 KB)

    The synthesis of programs, as well as other synthetic tasks, often ends up with an unprovable, partially false conjecture. A successful subsequent synthesis attempt depends on determining why the conjecture is faulty and how it can be corrected. Hence, it is highly desirable to have an automated means for detecting and correcting fault conjectures. We introduce a method for patching faulty conject... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A DSL approach to improve productivity and safety in device drivers development

    Publication Year: 2000, Page(s):101 - 109
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (885 KB)

    Although new peripheral devices are emerging at a frantic pace and require the fast release of drivers, little progress has been made to improve the development of such device drivers. Too often, this development consists of decoding hardware intricacies, based on inaccurate documentation. Then, assembly-level operations need to be used to interact with the device. These low-level operations reduc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A declarative approach for designing and developing adaptive components

    Publication Year: 2000, Page(s):111 - 119
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (892 KB)

    An adaptive component is a component that is able to adapt its behavior to different execution contexts. Building an adaptive application is difficult because of component dependencies and the lack of language support. As a result, code that implements adaptation is often tangled, hindering maintenance and evolution. To overcome this problem, we propose a declarative approach to program adaptation... View full abstract»

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

    Publication Year: 2000, Page(s):123 - 131
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (693 KB)

    Circular coinductive rewriting is a new method for proving behavioral properties, that combines behavioral rewriting with circular coinduction. This method is implemented in our new BOBJ (Behavioral OBJects) behavioral specification and computation system, which is used in examples throughout this paper. These examples demonstrate the surprising power of circular coinductive rewriting. The paper a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Formal construction of the Mathematically Analyzed Separation Kernel

    Publication Year: 2000, Page(s):133 - 141
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (849 KB)

    Describes the formal specification and development of a separation kernel. The Mathematically Analyzed Separation Kernel (MASK), has been used by Motorola on a smartcard project, and as part of a hardware cryptographic platform called the Advanced INFOSEC (INFOrmation SECurity) Machine (AIM). Both MASK and AIM were jointly developed by Motorola and the National Security Agency (NSA). This paper fi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simultaneous checking of completeness and ground confluence

    Publication Year: 2000, Page(s):143 - 151
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (806 KB)

    Algebraic specifications provide a powerful method for the specification of abstract data types in programming languages and software systems. Completeness and ground confluence are fundamental notions for building algebraic specifications in a correct and modular way. In this paper, we present a procedure for simultaneously checking completeness and ground confluence for specifications with free/... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using Little-JIL to coordinate agents in software engineering

    Publication Year: 2000, Page(s):155 - 163
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (825 KB)

    Little-JIL, a new language for programming the coordination of agents, is an executable, high-level process programming language with a formal (yet graphical) syntax and rigorously defined operational semantics. Little-JIL is based on two main hypotheses. The first is that the specification of coordination control structures is separable from other process programming language issues. Little-JIL p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Practical large scale what-if queries: case studies with software risk assessment

    Publication Year: 2000, Page(s):165 - 173
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (808 KB)

    When a lack of data inhibits decision-making, large-scale what-if queries can be conducted over the uncertain parameter ranges. Such queries can generate an overwhelming amount of data. We describe a general method for understanding that data. Large-scale what-if queries can guide Monte Carlo simulations of a model. Machine learning can then be used to summarize the output. The summarization is an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exploring and validating the contributions of real-world knowledge to the diagnostic performance of automated database design tools

    Publication Year: 2000, Page(s):177 - 185
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (862 KB)

    Automated database design tools employ knowledge-based systems technology in order to provide intelligent support to humans during the process of database analysis and design. However, the level to which these tools can simulate the diagnostic capabilities of human designers when performing a design task remains in question. Human designers employ what might be called "knowledge of the real world"... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using graph rewriting to specify software architectural transformations

    Publication Year: 2000, Page(s):187 - 196
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (792 KB)

    In order to understand, analyze and possibly modify software, we commonly examine and manipulate its architecture. For example, we may want to examine the architecture at different levels of abstraction or repair the architecture if it has deviated from our mental model of the software. We can view such manipulations as architectural transformations, and more specifically, as graph transformations... View full abstract»

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

    Publication Year: 2000, Page(s):197 - 206
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (944 KB)

    Design patterns offer many advantages for software development, but can introduce inefficiency into the final program. Program specialization can eliminate such overheads, but is most effective when targeted by the user to specific bottlenecks. Consequently, we propose that these concepts are complementary. Program specialization can optimize programs written using design patterns, and design patt... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Identification of potentially infeasible program paths by monitoring the search for test data

    Publication Year: 2000, Page(s):209 - 218
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (989 KB)

    A tool and techniques are presented for test data generation and identification of a path's likely unfeasibility in structural software testing. The tool is based on the dynamic technique and search using genetic algorithms. Our work introduces a new fitness function that combines control and data flow dynamic information to improve the process of search for test data. The unfeasibility issue is a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generating test data for branch coverage

    Publication Year: 2000, Page(s):219 - 227
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (812 KB)

    Branch coverage is an important criteria used during the structural testing of programs. We present a new program execution based approach to generate input data that exercises a selected branch in a program. The test data generation is initiated with an arbitrarily chosen input from the input domain of the program. A new input is derived from the initial input in an attempt to force execution thr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Test sequences generation from LUSTRE descriptions: GATEL

    Publication Year: 2000, Page(s):229 - 237
    Cited by:  Papers (37)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (762 KB)

    We describe a test sequence generation method from LUSTRE descriptions and its companion tool, GATEL. The LUSTRE language is declarative and describes synchronous data-flow computations. It is used for reactive control/command systems, mainly for electrical power production applications. Such critical applications require a high level of reliability. While this language benefits from powerful veri... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automating the composition of middleware configurations

    Publication Year: 2000, Page(s):241 - 244
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (419 KB)

    A method is presented for the automatic construction of all possible valid compositions of different middleware software architectures. This allows reusing the latter in order to create systems providing a set of different non-functional properties. These compositions are constructed by using only the structural information of the architectures, i.e. their configurations. Yet, they provide a valua... View full abstract»

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