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.

Proceedings 13th IEEE International Conference on Automated Software Engineering (Cat. No.98EX239)

13-16 Oct. 1998

Filter Results

Displaying Results 1 - 25 of 46
  • Proceedings 13th IEEE International Conference on Automated Software Engineering (Cat. No.98EX239)

    Publication Year: 1998
    Request permission for commercial reuse | PDF file iconPDF (253 KB)
    Freely Available from IEEE
  • A tool for automated system analysis based on modular specifications

    Publication Year: 1998, Page(s):2 - 11
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (97 KB)

    An effective means for analyzing and reasoning on software systems is to use formal specifications to simulate their execution. The simulation traces can be used for specification testing and reused, later in the development process, for functional testing of the system. It is widely acknowledged that, to deal with the complexity of industrial-size systems, specifications must be structured into m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Management of evolving specifications using category theory

    Publication Year: 1998, Page(s):12 - 21
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (187 KB)

    Structure is important in large specifications for understanding, testing and managing change. Category theory has been explored as framework for providing this structure, and has been successfully used to compose specifications. This work has typically adopted a "correct-by-construction" approach: components are specified, proved correct and then composed together in such a way as to preserve the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Specification-based testing of Ada units with low encapsulation

    Publication Year: 1998, Page(s):22 - 31
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (120 KB)

    Describes a system that improves testing quality by supporting automatic test data selection, execution and result verification. The system tests poorly-encapsulated Ada units against formal specifications. This task is difficult partly because the unit's interface is not explicit, but rather is buried in the body/implementation code. We attack this problem by making the unit's interface explicit ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Identifying pre-conditions with the Z/EVES theorem prover

    Publication Year: 1998, Page(s):32 - 41
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (102 KB)

    Starting from a graphical data model (a subset of the OMT object model), a skeleton of formal specification can be generated and completed to express several constraints and provide a precise formal data description. Then standard operations to modify instances of this data model can be systematically specified. Since these operations may invalidate the constraints, it is interesting to identify t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Planning equational verification in CCS

    Publication Year: 1998, Page(s):43 - 52
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (163 KB)

    Most efforts to automate the formal verification of communicating systems have centred around finite-state systems (FSSs). However, FSSs are incapable of modelling many practical communicating systems, and hence there is interest in a novel class of problems, which we call VIPSs (Value-passing Infinite-state Parameterised Systems). Existing approaches using model checking over FSSs are insufficien... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Don't verify, abstract!

    Publication Year: 1998, Page(s):53 - 62
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (36 KB)

    Describes a notation and tool for demonstrating to a third-party certifier that software written in a subset of Ada is safe, and gives some experience of using them on real projects. The thesis underlying the design is that people write adequate code, but that they make design and implementation decisions which can conflict with each other to introduce safety problems. The usual paradigm of formal... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A design pattern based approach to generating synchronization adaptors from annotated IDL

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

    Middleware forms such as CORBA and DCOM provide standard component interfaces, interaction protocols and communication services to support interoperability of object-oriented applications operating in heterogeneous and distributed environments. General-purpose services and facilities foster re-use and help reduce development costs. Yet the degree of automation of the software development process i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Specification-based browsing of software component libraries

    Publication Year: 1998, Page(s):74 - 83
    Cited by:  Papers (16)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (141 KB)

    Specification-based retrieval provides exact content-oriented access to component libraries but requires too much deductive power. Specification-based browsing evades this bottleneck by moving any deduction into an off-line indexing phase. In this paper, we show how match relations are used to build an appropriate index and how formal concept analysis is used to build a suitable navigation structu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reusability hypothesis verification using machine learning techniques: a case study

    Publication Year: 1998, Page(s):84 - 93
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (67 KB)

    Since the emergence of object technology, organizations have accumulated a tremendous amount of object-oriented (OO) code. Instead of continuing to recreate components that are similar to existing artifacts, and considering the rising costs of development, many organizations would like to decrease software development costs and cycle time by reusing existing OO components. This paper proposes an e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An automated approach for supporting software reuse via reverse engineering

    Publication Year: 1998, Page(s):94 - 103
    Cited by:  Papers (6)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (126 KB)

    Formal approaches to software reuse rely heavily upon a specification matching criterion, where a search query using formal specifications is used to search a library of components indexed by specifications. In previous investigations, we addressed the use of formal methods and component libraries to support software reuse and construction of software based on component specifications. A difficult... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards the automated debugging and maintenance of logic-based requirements models

    Publication Year: 1998, Page(s):105 - 114
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (72 KB)

    We describe a tools environment which automates the validation and maintenance of a requirements model written in many-sorted first order logic. We focus on a translator that produces an executable form of the model; blame assignment functions, which input batches of mis-classified tests (i.e. training examples) and output likely faulty parts of the model; and a theory reviser; which inputs the fa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Explanation based scenario generation for reactive system models

    Publication Year: 1998, Page(s):115 - 124
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (277 KB)

    Reactive systems control many useful and complex real-world devices. Tool-supported specification modelling helps software engineers design such systems correctly. One such tool is a scenario generator, which constructs an input event sequence for the spec model that reaches a state satisfying given criteria. It can uncover counterexamples to desired safety properties, explain feature interactions... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automated integrative analysis of state-based requirements

    Publication Year: 1998, Page(s):125 - 134
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (88 KB)

    Statically analyzing requirements specifications to assure that they possess desirable properties is an important activity in any rigorous software development project. The analysis is performed on an abstraction of the original requirements specification. Abstractions in the model may lead to spurious errors in the analysis output. Spurious errors are conditions that are reported as errors, but i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automated software test data generation for complex programs

    Publication Year: 1998, Page(s):136 - 146
    Cited by:  Papers (12)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (293 KB)

    We report on GADGET, a new software test generation system that uses combinatorial optimization to obtain condition/decision coverage of C/C++ programs. The GADGET system is fully automatic and supports all C/C++ language constructs. This allows us to generate tests for programs more complex than those previously reported in the literature. We address a number of issues that are encountered when a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Programmatic testing of the Standard Template Library containers

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

    We describe part of an STL conformance test suite under development. Test suites for all of the STL containers have been written, demonstrating the feasibility of thorough and highly automated testing of industrial component libraries. We describe affordable test suites that provide good code and boundary value coverage, including the thousands of cases that naturally occur from combinations of bo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Testing using log file analysis: tools, methods, and issues

    Publication Year: 1998, Page(s):157 - 166
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (65 KB)

    Large software systems often keep log files of events. Such log files can be analyzed to check whether a run of a program reveals faults in the system. We discuss how such log files can be used in software testing. We present a framework for automatically analyzing log files, and describe a language for specifying analyzer programs and an implementation of that language. The language permits compo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Schema-guided synthesis of constraint logic programs

    Publication Year: 1998, Page(s):168 - 176
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (115 KB)

    By focusing on the families of assignment and permutation problems (such as graph colouring and n-Queens), we show how to adapt D.R. Smith's (1990) KIDS approach for the synthesis of constraint programs (with implicit constraint satisfaction code), rather than applicative Refine programs with explicit constraint propagation and pruning code. Synthesis is guided by a global search schema and can be... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automating UI generation by model composition

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

    Automated user-interface generation environments have been criticized for their failure to deliver rich and powerful interactive applications. To specify more powerful systems, designers require multiple specialized modeling notations. The model-composition problem is concerned with automatically deriving powerful, correct, and efficient user interfaces from multiple models specified in different ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On detecting and handling inconsistencies in integrating software architecture design and performance evaluation

    Publication Year: 1998, Page(s):188 - 191
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (44 KB)

    We consider the problem of detecting and handling inconsistencies in software development processes using a graph based approach. It seems to be a natural way to express the various options and possibilities in attacking the problem. We apply the techniques developed in the area of software architecture design which uses in a structured way performance models in order to produce a design which inc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Synthesizing software architecture descriptions from Message Sequence Chart specifications

    Publication Year: 1998, Page(s):192 - 195
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (168 KB)

    Message Sequence Chart (MSC) specifications have found their way into many software engineering methodologies and CASE tools, in particular to represent early life-cycle requirements and high-level design specifications. We analyze iterating and branching MSC specifications with respect to their software architectural content. We present algorithms for the automated synthesis of Real-Time Object-O... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Component-based software process support

    Publication Year: 1998, Page(s):196 - 199
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (36 KB)

    Only recently has the research community started to consider how to make software process models interoperable and reusable. The task is difficult Software processes are inherently creative and dynamic difficult to define and repeat at an enactable level of detail. Additionally, interoperability and reusability have not been considered important issues. Recent interoperability and reusability solu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Illustrating object-oriented library reuse by example: a tool-based approach

    Publication Year: 1998, Page(s):200 - 203
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (81 KB)

    The authors present a tool-based approach that examines how example programs reuse a particular library. The approach can facilitate reuse by: (1) guiding the developer towards important library classes of general utility; (2) guiding the developer towards library classes particularly useful for a specific application domain; and (3) providing access to the relevant source code in each example for... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dowsing: a tool framework for domain-oriented browsing of software artifacts

    Publication Year: 1998, Page(s):204 - 207
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (20 KB)

    Program understanding relates a computer program to the goals and requirements it is designed to accomplish. Application-domain analysis is a source of information that can aid program understanding by guiding the source-code analysis and providing structure to its results. The authors use the term "dowsing" to describe the process of exploring software and the related documentation from an applic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • From Z to BON/Eiffel

    Publication Year: 1998, Page(s):209 - 212
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (189 KB)

    The article shows how to make a transition from the Z formal notation to the Business Object Notation (BON). It is demonstrated that BON has the expressive power of Z, with the additional advantages of object-orientation and a supporting seamless development method. The transition is illustrated for some widely used Z constructs. The translation lays the groundwork for a semi-automated tool for ex... View full abstract»

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