Proceedings 12th IEEE International Conference Automated Software Engineering

1-5 Nov. 1997

Filter Results

Displaying Results 1 - 25 of 49
  • Proceedings 12th IEEE International Conference Automated Software Engineering

    Publication Year: 1997
    Request permission for commercial reuse | PDF file iconPDF (219 KB)
    Freely Available from IEEE
  • Automatic synthesis of recursive programs: the proof-planning paradigm

    Publication Year: 1997, Page(s):2 - 9
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (888 KB)

    We describe a proof plan that characterises a family of proofs corresponding to the synthesis of recursive functional programs. This plan provides a significant degree of automation in the construction of recursive programs from specifications, together with correctness proofs. This plan makes use of meta-variables to allow successive refinement of the identity of unknowns, and so allows the progr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Moving proofs-as-programs into practice

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

    Proofs in the Nuprl system, an implementation of a constructive type theory, yield "correct-by-construction" programs. In this paper a new methodology is presented for extracting efficient and readable programs from inductive proofs. The resulting extracted programs are in a form suitable for use in hierarchical verifications in that they are amenable to clean partial evaluation via extensions to ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A structured approach for synthesizing planners from specifications

    Publication Year: 1997, Page(s):18 - 26
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (889 KB)

    Plan synthesis approaches in AI fall into two categories: domain-independent and domain-dependent. The domain-independent approaches are applicable across a variety of domains, but may not be very efficient in any one given domain. The domain-dependent approaches can be very efficient for the domain for which they are designed, but would need to be written separately for each domain of interest. T... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Formal specification of human-computer interaction by graph grammars under consideration of information resources

    Publication Year: 1997, Page(s):28 - 35
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (810 KB)

    A successful design of an interactive system requires a clear understanding of human-machine interaction. For the specification of such a system a precise consideration of the user's context during each step of the development process is therefore necessary. Moreover, a formal specification method for expressing interaction is highly desirable in order to achieve a precise and continuous specifica... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Processing natural language requirements

    Publication Year: 1997, Page(s):36 - 45
    Cited by:  Papers (41)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1082 KB)

    The importance of requirements, which in practice often means natural language requirements, for a successful software project cannot be underestimated. Although requirement analysis has been traditionally reserved to the experience of professionals, there is no reason not to use various automatic techniques to the same end. In this paper we present Circe, a Web-based environment for aiding in nat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tools supporting the creation and evolution of software development knowledge

    Publication Year: 1997, Page(s):46 - 53
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1086 KB)

    Software development is a knowledge-intensive activity involving the integration of diverse knowledge sources that undergo constant change. The volatility of knowledge in software development requires that knowledge bases are able to support a continuous knowledge acquisition process where tools are available that can make use of partial knowledge. To address these issues, case-based technology is... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed cooperative formal methods tools

    Publication Year: 1997, Page(s):55 - 62
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (921 KB)

    This paper describes some tools to support formal methods, and conversely some formal methods for developing such tools. We focus on distributed cooperative proving over the web. Our tools include a proof editor/assistant, servers for remote proof execution, a distributed truth protocol, an editor generator; and a new method for interface design called algebraic semiotics, which combines semiotics... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Specification and verification of the Co/sub 4/ distributed knowledge system using LOTOS

    Publication Year: 1997, Page(s):63 - 70
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (798 KB)

    This paper relates the formal specification and verification of a consensual decision protocol based on Co/sub 4/, a computer environment dedicated to the building of a distributed knowledge base. This protocol has been specified in the ISO formal description technique LOTOS. The CADP tools from the EUCALYPTUS LOTOS toolset have been used to verify different safety and liveness properties. The ver... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using KIV to specify and verify architectures of knowledge-based systems

    Publication Year: 1997, Page(s):71 - 80
    Cited by:  Papers (4)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (955 KB)

    Building knowledge-based systems from reusable elements is a key factor in developing them economically. However, one has to ensure that the assumptions and functionality of the reused building block fit together with each other and the specific circumstances of the actual problem and knowledge. We use the Karlsruhe Interactive Verifier (KIV) for this purpose. We show how the verification of conce... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A metric-based approach to detect abstract data types and state encapsulations

    Publication Year: 1997, Page(s):82 - 89
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (703 KB)

    This article presents an approach to identify abstract data types (ADT) and abstract state encapsulations (ASE, also called abstract objects) in source code. This approach groups together functions, types, and variables into ADT and ASE candidates according to the proportion of features they share. The set of features considered includes the context of these elements, the relationships to their en... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatic high-quality reengineering of database programs by temporal abstraction

    Publication Year: 1997, Page(s):90 - 97
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (727 KB)

    The relational database model is currently the target of choice for the conversion of legacy software that uses older models (such as indexed-sequential, hierarchical or network models). The relational model makes up for its lower efficiency by a greater expressive power and by optimization of queries, using indexes and other means. However, sophisticated analysis is required in order to take adva... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extracting objects from legacy imperative code

    Publication Year: 1997, Page(s):98 - 106
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (748 KB)

    This paper presents a methodology for extracting objects from legacy imperative code. The parameter-based object identification (PBOI) methodology is based on the thesis that object attributes manifest themselves as data items passed from subprogram to subprogram in the imperative paradigm. A taxonomy of imperative subprograms is presented and the PBOI methodology is defined. Several examples are ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Notes on refinement, interpolation and uniformity

    Publication Year: 1997, Page(s):108 - 116
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (967 KB)

    The connection between some modularity properties and interpolation is revisited and restated in a general "logic-independent" framework. The presence of uniform interpolants is shown to assist in certain proof obligations, which suffice to establish the composition of refinements. The absence of the desirable interpolation properties from many logics that have been used in refinement motivates a ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exploiting domain-specific knowledge to refine simulation specifications

    Publication Year: 1997, Page(s):117 - 124
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1271 KB)

    Discusses our approach to the problem of refining high-level simulation specifications. Our domain is simulated combat training for tank platoon members. Our input is a high-level specification for a training scenario and our output is an executable specification for the behavior of a network-based combat simulator. Our approach combines a detailed model of the tank training domain with nonlinear ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Augmenting abstract syntax trees for program understanding

    Publication Year: 1997, Page(s):126 - 133
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (730 KB)

    Program understanding efforts by individual maintainers are dominated by a process known as discovery, which is characterized by low-level searches through the source code and documentation to obtain information that is important to the maintenance task. Discovery is complicated by the delocalization of information in the source code, and can consume from 40-60% of a maintainer's time. This paper ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A contribution to program comprehension by program analysis: application to numerical programs

    Publication Year: 1997, Page(s):134 - 141
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (771 KB)

    This paper deals with non-functional aspects of software. It presents an approach towards the integration of methods in order to handle properties of numerical programs. We develop a program analysis technique which allows us to formalise, evaluate and check non-functional properties of programs. These property evaluations are used in two main areas. The first one is related to program design to c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Precise specification and automatic application of design patterns

    Publication Year: 1997, Page(s):143 - 152
    Cited by:  Papers (25)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (825 KB)

    Despite vast interest in design patterns, the specification and application of patterns is generally assumed to rely on manual implementation. We describe a precise method of specifying how a design pattern is applied: by phrasing it as an algorithm in a meta-programming language. We present a prototype of a tool that supports the specification of design patterns and their realization in a given p... View full abstract»

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

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

    It can be argued that for (semi-)automated software development, program schemas are indispensable, since they capture not only structured program design principles but also domain knowledge, both of which are of crucial importance for hierarchical program synthesis. Most researchers represent schemas purely syntactically (as higher-order expressions). This means that the knowledge captured by a s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Application of formal methods to the development of a software maintenance tool

    Publication Year: 1997, Page(s):162 - 171
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1049 KB)

    Partial evaluation is an optimization technique traditionally used in compilation. We have adapted this technique to the understanding of scientific application programs during their maintenance, and we have implemented a tool that analyzes Fortran 90 application programs and performs an interprocedural pointer analysis. This paper presents how we have specified this analysis with different formal... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • TESS: automated support for the evolution of persistent types

    Publication Year: 1997, Page(s):172 - 181
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (968 KB)

    Persistent data often has a long lifetime. During its lifetime, the types that are used to structure the data may undergo evolution to support new requirements or provide more efficient services. This evolution often makes the persistent data inaccessible unless it also evolves with the types. Existing systems that support type and data evolution focus on changes isolated to individual types, ther... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mapping software architectures to efficient implementations via partial evaluation

    Publication Year: 1997, Page(s):183 - 192
    Cited by:  Papers (8)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1068 KB)

    Flexibility is recognized as a key feature in structuring software, and many architectures have been designed to that effect. However, they often come with performance and code size overhead, resulting in a flexibility vs. efficiency dilemma. The source of inefficiency in software architectures can be identified in the data and control integration of components, because flexibility is present not ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automated configuration of distributed applications from reusable software architectures

    Publication Year: 1997, Page(s):193 - 200
    Cited by:  Papers (2)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (727 KB)

    In this paper a reuse-oriented perspective is taken to designing and implementing configurable distributed applications. An application domain is defined as a family of systems that have some features in common and others that differentiate them. During domain engineering, reusable specifications, architectures and component types are developed, which capture the similarities and variations of the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Declarative specification of software architectures

    Publication Year: 1997, Page(s):201 - 208
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (692 KB)

    Scaling formal methods to large, complex systems requires methods of modeling systems at high levels of abstraction. In this paper, we describe such a method for specifying system requirements at the software architecture level. An architecture represents a way breaking down a system into a set of interconnected components. We use architecture theories to specify the behavior of a system in terms ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Applying concept formation methods to object identification in procedural code

    Publication Year: 1997, Page(s):210 - 218
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (817 KB)

    Legacy software systems present a high level of entropy combined with imprecise documentation. This makes their maintenance more difficult, more time consuming, and costlier. In order to address these issues, many organizations have been migrating their legacy systems to new technologies. In this paper, we describe a computer-supported approach aimed at supporting the migration of procedural softw... View full abstract»

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