David R. Barstow

dblp:35/1087 · DBLP profile ↗
← Back
23ranked-venue papers
18as first author
0since 2021 · last 1999
—ORCID · none

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

Artificial intelligence and machine learning · 11 · 9 first-authorSoftware engineering, systems software and programming languages · 11 · 8 first-authorGraphics, computer vision, multimedia, augmented reality and games · 9 · 8 first-authorTheory of computation · 1 · 1 first-author

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
14 papers
Compilers and program optimization · 70% Program synthesis and code generation · 16% Programming languages and type systems · 7%
Artificial intelligence
5 papers
Knowledge representation and reasoning · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Processor architecture and microarchitecture · 100%

Topics — the 14 heaviest of 18, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Compilers and program optimization
code generation
0.061988
Automatic Programming for Streams II: Transformational Implementation · ICSE 1988
Domain-Specific Automatic Programming · IEEE Trans. Software Eng. 1985
Automatic Programming for Streams · IJCAI 1985
Compilers and program optimization › program transformation › program derivation
transformational implementation
0.011988
Automatic Programming for Streams II: Transformational Implementation · ICSE 1988
Compilers and program optimization
program transformation
0.011985
On Convergence Toward a Database of Program Transformations · ACM Trans. Program. Lang. Syst. 1985
Processor architecture and microarchitecture
dataflow architecture
0.011985
The Stream Machine: A Data Flow Architecture for Real-Time Applications · ICSE 1985
Programming languages and type systems
programming environment
0.011981
Overview of a Display-Oriented Editor for INTERLISP · IJCAI 1981
Knowledge, reasoning and agents › Knowledge representation and reasoning
expert systems
0.011980
Exploiting a Domain Model in an Expert Spectral Analysis Program · AAAI 1980
Knowledge, reasoning and agents › Knowledge representation and reasoning
knowledge engineering
0.011979
Knowledge Engineering in Nuclear Physics · IJCAI 1979
Program synthesis and code generation
deductive program synthesis
0.011979
The Roles of Knowledge and Deduction in Program Synthesis · IJCAI 1979
Compilers and program optimization
stream programming
0.011988
Automatic Programming for Streams II: Transformational Implementation · ICSE 1988
Software maintenance and evolution
software reuse
0.011985
On Convergence Toward a Database of Program Transformations · ACM Trans. Program. Lang. Syst. 1985
Programming languages and type systems › programming models
stream processing
0.011985
Automatic Programming for Streams · IJCAI 1985
Knowledge, reasoning and agents › Knowledge representation and reasoning
knowledge-based systems
0.021980
Exploiting a Domain Model in an Expert Spectral Analysis Program · AAAI 1980
A Knowledge-Based System for Automatic Program Construction · IJCAI 1977
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 › logic-based reasoning
deductive reasoning
0.011979
The Roles of Knowledge and Deduction in Program Synthesis · IJCAI 1979

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

domain modeling · 0.0rule-based transformation · 0.0spectral analysis · 0.0search knowledge · 0.0refinement paradigm · 0.0cost bounds · 0.0program synthesis · 0.0knowledge-based synthesis · 0.0
YearPublicationVenuePosition
1999 Baseball Seasons and Dog Years
abstract
Article Free Access Share on Baseball seasons and dog years Author: David R. Barstow TeraQuest Metrics, Inc., P.O. Box 200490, Austin, TX and Instant Sports, Inc., P.O. Box 162197, Austin, TX TeraQuest Metrics, Inc., P.O. Box 200490, Austin, TX and Instant Sports, Inc., P.O. Box 162197, Austin, TXView Profile Authors Info & Claims ICSE '99: Proceedings of the 21st international conference on Software engineeringMay 1999 Pages 535–542https://doi.org/10.1145/302405.302688Published:16 May 1999Publication History 3citation324DownloadsMetricsTotal Citations3Total Downloads324Last 12 Months5Last 6 weeks4 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
David R. Barstow
ICSE1
1993 Should we specify systems or domain?
abstract
The question of specifying systems or domains is addressed. Among the issues discussed are: the requirements of first-class connectors for domain specifications; the use of application frameworks as domain specifications; the role of connectors in domain specifications; domain model specification; the question of what precisely is meant by a domain of the question of reuse; and the difficulty in producing sound domain specifications.>
D. Partridge, David Garlan, David R. Barstow, Jeff Kramer
RE3
1988 Automatic Programming for Streams II: Transformational Implementation
David R. Barstow
ICSE1
1987 Artificial Intelligence and Software Engineering
David R. Barstow
ICSE1
1985 The Stream Machine: A Data Flow Architecture for Real-Time Applications
P. Barth, Scott B. Guthery, David R. Barstow
ICSE3
1985 Automatic Programming for Streams
David R. Barstow
IJCAI1
1985 On Convergence Toward a Database of Program Transformations
abstract
Several fairly large sets of programming rules have been developed recently. It is natural to ask whether the process of developing such rule bases may converge. Having developed sets of rules for specific programming tasks and domains, will they be helpful when other tasks and domains are considered? While it is too early to give definitive answers, experience with the rules of the PECOS system has been positive. Both during the process of developing the rule set and while developing rules for another domain, the existence of already codified rules proved very helpful.
David R. Barstow
ACM Trans. Program. Lang. Syst.1
1985 Domain-Specific Automatic Programming
abstract
Domain knowledge is crucial to an automatic programming system and the interaction between domain knowledge and programming at the current time. The NIX project at Schlumberger-Doll Research has been investigating this issue in the context of two application domains related to oil well logging. Based on these experiments we have developed a framework for domain-specific automatic programming. Within the framework, programming is modeled in terms of two activities, formalization and implementation, each of which transforms descriptions of the program as it proceeds through intermediate states of development. The activities and transformations may be used to characterize the interaction of programming knowledge and domain knowledge in an automatic programming system.
David R. Barstow
IEEE Trans. Software Eng.1
1983 A Perspective on Automatic Programming
David R. Barstow
IJCAI1
1982 An Overview of PhiNIX
David R. Barstow, Roger Duffey, Stephen W. Smoliar, Stanley Vestal
AAAI1
1982 An Automatic Programming System to Support an Experimental Science
David R. Barstow, Roger Duffey, Stephen W. Smoliar, Stanley Vestal
ICSE1
1981 Overview of a Display-Oriented Editor for INTERLISP
David R. Barstow
IJCAI1
1981 Guest Editorial: Programming Environments
David R. Barstow, Howard E. Shrobe
IEEE Trans. Software Eng.1
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.2
1980 Exploiting a Domain Model in an Expert Spectral Analysis Program
David R. Barstow
AAAI1
1980 Remarks on "A Synthesis of Several Sorting Algorithms" by John Darlington
David R. Barstow
Acta Informatica1
1979 Knowledge Engineering in Nuclear Physics
David R. Barstow
IJCAI1
1979 The Roles of Knowledge and Deduction in Program Synthesis
David R. Barstow
IJCAI1
1979 An Experiment in Knowledge-Based Automatic Programming
David R. Barstow
Artif. Intell.1
1978 On Program Synthesis Knowledge
Cordell Green, David R. Barstow
Artif. Intell.2
1977 A Knowledge-Based System for Automatic Program Construction
David R. Barstow
IJCAI1
1976 Observations on the Interaction Between Coding and Efficiency Knowledge in the PSI Program Synthesis System
David R. Barstow, Elaine Kant
ICSE1
1975 Some Rules For The Automatic Synthesis Of Programs
Cordell Green, David R. Barstow
IJCAI2