Elaine Kant

dblp:73/5351 · DBLP profile ↗
← Back
15ranked-venue papers
8as first author
0since 2021 · last 2000
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 7 · 5 first-authorGraphics, computer vision, multimedia, augmented reality and games · 6 · 4 first-authorSoftware engineering, systems software and programming languages · 5 · 2 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-authorHuman-computer interaction and ubiquitous computing · 1Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
7 papers
Program synthesis and code generation · 47% Program analysis · 20% Compilers and program optimization · 17%
Theoretical computer science
4 papers
Automated reasoning and model checking · 57% Algorithms and data structures · 43%
Artificial intelligence
2 papers
Planning, search and constraint satisfaction · 70% Knowledge representation and reasoning · 30%

Topics — the 5 heaviest of 10, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Compilers and program optimization
code generation
0.011985
Understanding and Automating Algorithm Design · IEEE Trans. Software Eng. 1985
Program analysis
symbolic execution
0.011985
Symbolic Execution in Algorithm Design · IJCAI 1985
Program synthesis and code generation
knowledge-based program synthesis
0.011979
Results in Knowledge-Based Program Synthesis · IJCAI 1979
Program analysis
cost analysis
0.011981
The Refinement Paradigm: The Interaction of Coding and Efficiency Knowledge in Program Synthesis · IEEE Trans. Software Eng. 1981
Knowledge, reasoning and agents › Knowledge representation and reasoning › automated reasoning
knowledge base reasoning
0.011979
Results in Knowledge-Based Program Synthesis · IJCAI 1979

Methods — techniques the papers use, named apart from their topics

program synthesis · 0.0problem space analysis · 0.0knowledge-based design · 0.0execution and analysis of partial algorithms · 0.0developmental evaluation · 0.0knowledge-based reasoning · 0.0automated design · 0.0search knowledge · 0.0refinement paradigm · 0.0cost bounds · 0.0
YearPublicationVenuePosition
2000 A knowledge-based electronic information and documentation system
abstract
We describe the capabilities of a knowledge-based system to automatically generate a collection of electronic notebooks containing various forms of online documentation and reports. This system is a subsystem of a larger knowledge-based system called SciNapse. SciNapse's raison d'etre is to transform high-level simulation problem specifications into executable numerical programs. The electronic notebooks are generated from the same domain knowledge bases that the system uses to perform its primary tasks. These online notebooks are of two different kinds: reference materials and reports. Reference materials are generated from the latest version of the knowledge base, which includes the classes that drive the system, and a network of objects representing meta-information about the system. The reference materials document the system's capabilities and help users understand what the system can do. Reports are generated from the instances created by a run of the system. They document the transformations the input specification underwent in becoming code, and are intended to help a user understand what the system has done.
Robert L. Young, Elaine Kant, Larry A. Akers
IUI2
1997 Numerical options models without programming
abstract
The authors describe the automatic generation of finite difference codes for solving the Black-Scholes and related equations for option valuation using the SCINAPSE software synthesis system. Analysts can specify codes at a very high level that mirrors the mathematical description of the problem. A typical option pricing specification occupies less than a half page. From such concise input, the system automatically generates validated, documented codes of several hundred lines of either C or Fortran in minutes, codes of several thousand lines in about an hour.
Curt Randall, Elaine Kant
CIFEr2
1985 Understanding and Automating Algorithm Design
Elaine Kant
IJCAI1
1985 Symbolic Execution in Algorithm Design
David M. Steier, Elaine Kant
IJCAI2
1985 Incremental parsing without a parser
Gail E. Kaiser, Elaine Kant
J. Syst. Softw.2
1985 Understanding and Automating Algorithm Design
abstract
Algorithm design is a challenging intellectual activity that provides a rich source of observation and a test domain for a theory of problem-solving behavior. This paper describes a theory of the algorithm design process based on observations of human design and also outlines a framework for automatic design. The adaptation of the theory of human design to a framework for automation in the DESIGNER system helps us understand human design better, and the implementation process helps validate the framework. Issues discussed in this paper include the problem spaces used for design, the loci of knowledge and problem-solving power, and the relationship to other methods of algorithm design and to automatic programming as a whole.
Elaine Kant
IEEE Trans. Software Eng.1
1985 The Roles of Execution and Analysis in Algorithm Design
abstract
The analysis and execution of partial algorithm descriptions is an important part of the algorithm design process (as is borne out by studying the behavior of human algorithm designers). In this paper, we describe a language for representing partially designed algorithms and a process, developmental evaluation, that can discover useful knowledge to guide design. Using these and other results from our research in artificial intelligence, we are building a system, DESIGNER, that automatically designs algorithms. This paper also compares developmental evaluation to execution and analysis techniques used for testing complete programs and for validation of abstract specifications; concepts similar to those found in developmental evaluation are thus shown to apply to all stages of the software life cycle.
David M. Steier, Elaine Kant
IEEE Trans. Software Eng.2
1984 Problem solving techniques for the design of algorithms
Elaine Kant, Allen Newell
Inf. Process. Manag.1
1983 An Automatic Algorithm Designer: An Initial Implementation
Elaine Kant, Allen Newell
AAAI1
1983 On the Efficient Synthesis of Efficient Programs
Elaine Kant
Artif. Intell.1
1982 Naive Algorithm Design Techniques: A Case Study
Elaine Kant, Allen Newell
ECAI1
1981 The Refinement Paradigm: The Interaction of Coding and Efficiency Knowledge in Program Synthesis
abstract
A refinement paradigm for implementing a high-level specification in a low-level target language is discussed. In this paradigm, coding and analysis knowledge work together to produce an efficient program in the target language. Since there are many possible implementations for a given specification of a program, searching knowledge is applied to increase the efficiency of the process of finding a good implementation. For example, analysis knowledge is applied to determine upper and lower cost bounds on alternate implementations, and these bounds are used to measure the potential impact of different design decisions and to decide which alternatives should be pursued. In this paper we also describe a particular implementation of this program synthesis paradigm, called PSI/SYN, that has automatically implemented a number of programs in the domain of symbolic processing.
Elaine Kant, David R. Barstow
IEEE Trans. Software Eng.1
1979 Results in Knowledge-Based Program Synthesis
Cordell Green, Richard P. Gabriel, Elaine Kant, Beverly I. Kedzierski, Brian P. McCune, Jorge V. Phillips, Steve Tappel, Stephen J. Westfold
IJCAI3
1979 A Knowledge-Based Approach to Using Efficiency Estimation in Program Synthesis
Elaine Kant
IJCAI1
1976 Observations on the Interaction Between Coding and Efficiency Knowledge in the PSI Program Synthesis System
David R. Barstow, Elaine Kant
ICSE2