3,458 papers · page 168 of 173
Sabine Dick, Thomas Santen
We report on a case study to assess the use of an advanced knowledge-based software design technique to programmers who have not participated in the technique's development. We use the KIDS approach to algorithm design to construct two global search algorithms that route baggage …
Thomas Ellman, John Eric Keane, Takahiro Murata, Mark Schwabacher
Numerical design optimization algorithms are highly sensitive to the particular formulation of the optimization problems they are given. The formulation of the search space, the objective function and the constraints will generally have a large impact on the duration of the optim…
Yishai A. Feldman, Doron Friedman
Automatic code translation could be a useful technique for software migration, provided it can be done in large-scale industrial applications. We have built an automatic translation system for converting IBM 370 assembly-language programs to C, in order to port the original progr…
Adele E. Howe, Anneliese von Mayrhauser, Richard T. Mraz
Most automated software testing techniques adopt a procedural approach, specifying how sequences are to be generated. In contrast, AI planners generate plans (sequences of actions) in a goal oriented fashion, specifying how actions interact and inferring sequences from that infor…
W. Lewis Johnson, Ali Erdem
This paper describes an effort to provide automated support for the interactive inquiry and explanation process that is at the heart of software understanding. A hypermedia tool called I-Doc allows software engineers to post queries about a software system, and generates focused …
Ina Kraan, Peter Baumann
Wide-spread acceptance and use of formal methods in software development hinges on the availability of powerful tools. Tools must be both reliable and offer real assistance to the user. Logical frameworks are a suitable medium to build such tools, since they provide a means to sh…
Yves Ledru
The development of formal specifications may benefit from prototyping activities. The production of an executable model for a given description helps bridging the gap between this specification and the corresponding reality. The KIDS/VDM system, based on the KIDS environment, pro…
Greger Lindén, A. Inkeri Verkamo
Information sharing between two well-defined development environments demands data transformation between the tools or the underlying repositories of the environments. We give a solution to the problem of making tools in different environments cooperate without modifying the tool…
Yanhong A. Liu
The paper describes the design and implementation of an interactive, incremental-attribution-based program transformation system, CACHET, that derives incremental programs from non-incremental programs written in a functional language. CACHET is designed as a programming environm…
Michael R. Lowry, Jeffrey Van Baalen
AMPHION is a real-world knowledge-based software engineering (KBSE) system whose program synthesis subsystem is based on deductive synthesis. AMPHION has a domain-independent generic architecture that is specialized to a domain through a declarative theory. Program synthesis has …
David D. Lowry, Michael R. Lowry
KBSE systems are maturing into viable software development environments. As KBSE systems are deployed into real-world use, legal issues of intellectual property rights and liability will play an increasing role in shaping the industry. The paper develops a conceptual framework fo…
John Penix, Phillip Baraona, Perry Alexander
Automated assistance for software component reuse involves supporting retrieval, adaptation and verification of software components. The informality of feature-based software classification schemes is an impediment to formally verifying the reusability of a software component. Th…
Harald Reuß
Using the example of the divide et impera program scheme we present a knowledge-assisted refinement process based on type theory that yields executable programs from given requirement specifications. Programming knowledge is described in terms of precise mathematical theories and…
Julian Richardson
I present an automatic technique for transforming a program by changing the data types in that program to ones which are more appropriate for the task. Programs are synthesised by proving modified synthesis theorems in the proofs-as-programs paradigm. The transformation can be ve…
Daniela Rosca, Sol J. Greenspan, J. Christian Wild, Howard B. Reubenstein, Kurt Maly, Mark Feblowitz
Decision structures have been proposed in a number of contexts an knowledge-based software engineering as an important mechanism for recording and reasoning about the information needed to make decisions during the software lifecycle. We apply decision structures to a new domain,…
William C. Sasso, Kevin Benner
To gauge the actual impact of a new technology, the paper describes an empirical study evaluating the productivity and software qualify impacts of the Concept Demo, a robust demonstration of knowledge-based software assistant (KBSA) technology. The basic results are that evolutio…
Akiyoshi Sato, Minoru Tomobe, Toru Yamanouchi, Masanobu Watanabe, Masashi Hijikata
The paper proposes a domain-oriented software process re-engineering method that allows for efficient software process modeling and cuts overall software development cost. This is achieved by use of a software synthesis shell that supports the development of program generators fr…
Enn Tyugu
A long-term effort is described which has resulted in a knowledge-based software tool, NUT, that combines object-oriented programming with automatic program synthesis. The concept of classes has been considerably extended so that they have evolved into knowledge modules possessin…
Christopher A. Welty
The KBSE community is actively engaged in finding ways to represent software and the activities that relate to various stages in its lifecycle. While the wealth of modeling activities have, necessarily, been founded on first order logic based representations, the paper reports on…
Francoise Balmas
We present a pattern matcher specially developed far the parsing of LISP functions. Its main features are patterns defined by context-free grammars, parametrized patterns, multi-step matching, as well as dynamic synthesis of new patterns. We have designed a model far the conceptu…