By Topic

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
  • Index of authors

    Publication Year: 1998, Page(s):333 - 334
    Request permission for commercial reuse | PDF file iconPDF (179 KB)
    Freely Available from IEEE
  • Automated software test data generation for complex programs

    Publication Year: 1998, Page(s):136 - 146
    Cited by:  Papers (9)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (300 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.
  • Illustrating object-oriented library reuse by example: a tool-based approach

    Publication Year: 1998, Page(s):200 - 203
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (88 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.
  • From Z to BON/Eiffel

    Publication Year: 1998, Page(s):209 - 212
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (196 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.
  • 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 (80 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.
  • An automated approach for supporting software reuse via reverse engineering

    Publication Year: 1998, Page(s):94 - 103
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (132 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.
  • 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 (80 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.
  • 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 (40 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.
  • 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 (48 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.
  • Requirements engineering and verification using specification animation

    Publication Year: 1998, Page(s):302 - 305
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (52 KB)

    Presents an overview of the Possum specification animation system and its integration into the Cogito methodology and toolset. Possum allows interpretation (or animation) of specifications written in Sum, the specification language of Cogito. We distinguish two potential uses for Possum and illustrate each of these with an example. The first is the use of Possum for specification verification, whe... View full abstract»

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

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

    Motivated by NASA's need for high-assurance software, NASA Ames' Amphion project has developed a generic program generation system based on deductive synthesis. Amphion has a number of advantages, such as the ability to develop a new synthesis system simply by writing a declarative domain theory. However, as a practical matter, the validation of the domain theory for such a system is problematic b... 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 (40 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.
  • 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 (120 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.
  • 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 (24 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 fr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A configurable automatic instrumentation tool for ANSI C

    Publication Year: 1998, Page(s):249 - 258
    Cited by:  Papers (8)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (80 KB)

    Automatic software instrumentation is usually done at the machine level or is targeted at specific program behavior for use with a particular monitoring application. The paper describes CCI, an automatic software instrumentation tool for ANSI C designed to serve a broad range of program execution monitors. CCI supports high level instrumentation for both application-specific behavior as well as st... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parameterising (algebraic) specifications on diagrams

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

    The paper presents an extension of previous work on the parameterisation of logical and algebraic specifications leading to a novel formalisation of parameterisation which is general enough to become independent of the specificities of the underlying formalism, and flexible enough to accommodate the manipulation of complex parameterised specifications where the parameters are presented by means of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards a theory for integration of mathematical verification and empirical testing

    Publication Year: 1998, Page(s):322 - 331
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1940 KB)

    From the viewpoint of a project manager who is responsible for the verification and validation (V&V) of a software system, mathematical verification techniques provide a potentially valuable addition to otherwise standard empirical testing. However, the value they add, both in terms of coverage and in fault detection, has been difficult to quantify. Potential cost savings from replacing testin... 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 (168 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.
  • Detection of exclusive OR global predicates

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

    Detecting global predicates in a distributed program is a useful tool for debugging and testing the program. Past research has considered several restricted forms of predicates, including conjunctive predicates and linked predicates, and their detection algorithms. The authors introduce an exclusive OR global predicates to describe exclusive usages of shared resources in distributed programs. An e... 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 (148 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.
  • Planware-domain-specific synthesis of high-performance schedulers

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

    Planware is a domain-specific generator of high-performance scheduling software, currently being developed at the Kestrel Institute. Architecturally, Planware is an extension of the Specware system with domain-independent and domain-dependent parts. The domain-independent part includes a general algorithm design facility (including mechanisms to synthesize global-search and constraint propagation ... 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 (96 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.
  • Development, assessment, and reengineering of language descriptions

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

    Discusses tools that aid in the development, assessment and reengineering of language descriptions (i.e. syntactic descriptions of a language). We develop assessment tools that give an indication as to what is wrong with an existing language description, and give hints towards its correction. From a correct and complete language description, it is possible to generate a parser, a manual and online... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A coordination system approach to software workflow process evolution

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

    Describes a coordination-based approach to the dynamic evolution of (software) workflow processes. Our interest is in widely distributed workflow processes, i.e. systems that allow each instance of a process model to be enacted in a distributed fashion, with different parts of the process being enacted on different nodes of the system. More specifically, we are interested in the problem of dynamic... View full abstract»

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