Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Timothy A. Budd

dblp:26/3088 · also Timothy Budd 0001 · DBLP profile ↗
← Back
10ranked-venue papers
9as first author
0since 2021 · last 2006
—ORCID · none

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

Software engineering, systems software and programming languages · 6 · 6 first-authorTheory of computation · 3 · 2 first-authorDatabases, data management, data science and information retrieval · 2 · 1 first-authorHuman-computer interaction and ubiquitous computing · 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
2 papers
Compilers and program optimization · 38% Software testing · 32% Programming languages and type systems · 19%

Topics — the 6 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Compilers and program optimization › code generation
parallel code generation
0.011984
An APL Compiler for a Vector Processor · ACM Trans. Program. Lang. Syst. 1984
Compilers and program optimization › vectorization
vectorizing compiler
0.011984
An APL Compiler for a Vector Processor · ACM Trans. Program. Lang. Syst. 1984
Program verification
functional correctness
0.011980
Theoretical and Emperical Studies on Using Program Mutation to Test the Functional Correctness of Programs · POPL 1980
Software testing
mutation testing
0.011980
Theoretical and Emperical Studies on Using Program Mutation to Test the Functional Correctness of Programs · POPL 1980
Software testing › mutation testing
program mutation
0.011980
Theoretical and Emperical Studies on Using Program Mutation to Test the Functional Correctness of Programs · POPL 1980
Software testing
test adequacy
0.011980
Theoretical and Emperical Studies on Using Program Mutation to Test the Functional Correctness of Programs · POPL 1980

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

dragthrough optimization · 0.0empirical study · 0.0
YearPublicationVenuePosition
2006 An active learning approach to teaching the data structures course
abstract
In this paper, we describe the how active learning techniques have been successfully applied in a CS 2 course.
Timothy A. Budd
SIGCSE1
1995 General-purpose multiparadigm programming languages: an enabling technology for constructing complex systems
abstract
Multiparadigm programming languages have been envisioned as a vehicle for constructing large and complex heterogeneous systems, such as a stock market exchange or a telecommunications network. General-purpose multiparadigm languages, as opposed to hybrid multiparadigm languages, embody several prevalent programming paradigms without being motivated by a single problem. One such language is Leda, which embodies the foundational paradigms of imperative, functional, logic, and object-oriented programming. We explore aspects of solving complex problems using Leda, in order to illustrate the benefits of using a multiparadigm language in expressing solutions to complex systems. We claim that general-purpose multiparadigm programming languages like Leda greatly expedite solutions to a variety of complex problems.
Timothy A. Budd, Timothy P. Justice, Rajeev K. Pandey
ICECCS1
1989 The Design of an Object-oriented Command Interpreter
abstract
Abstract Object‐oriented programming languages are noted for their ability to allow users quickly to construct large software systems. They achieve this ability by allowing the programmer to concentrate on what it is they want to do, ignoring details of how that functionality is achieved. Such characteristics should make the object‐oriented style of programming attractive to casual or novice computer users, indeed one of the best known object‐oriented programming languages, Smalltalk, was initially designed with just such novice users in mind. The Unix operating system is widely regarded as a good environment for doing software development. Nevertheless, its large number of often terse and cryptic commands make it difficult for novice or casual users to use. In this paper we argue that one solution is to create an object‐oriented command interpreter, or shell, between the user and the underlying system. This paper reports on the construction of one such prototype shell, and the lessons we have learned from the use of this system.
Timothy A. Budd
Softw. Pract. Exp.1
1985 Program Testing by Specification Mutation
Timothy A. Budd, Ajei S. Gopal
Comput. Lang.1
1985 Creation and Reflexive Rights in Grammatical Protection Systems
Timothy A. Budd
Inf. Process. Lett.1
1984 Extensions to Grid Selector Composition and Compilation in APL
Joseph M. Treat, Timothy A. Budd
Inf. Process. Lett.2
1984 An APL Compiler for a Vector Processor
abstract
Although vector processors have been available for over a decade, the software necessary to make effective use of these facilities has generally not been available.In this paper the design of a compiler for the programming language APL, which produces code that allows most operations to be performed in parallel, is described.This design is based on a similar sequential compiler currently in use.Both compilers use a technique called dragthrough to reduce the size of intermediate values generated during the course of execution.
Timothy A. Budd
ACM Trans. Program. Lang. Syst.1
1982 Two Notions of Correctness and Their Relation to Testing
Timothy A. Budd, Dana Angluin
Acta Informatica1
1982 An Implementation of Generators in C
Timothy A. Budd
Comput. Lang.1
1980 Theoretical and Emperical Studies on Using Program Mutation to Test the Functional Correctness of Programs
abstract
In testing for program correctness, the standard approaches [11,13,21,22,23,24,34] have centered on finding data D, a finite subset of all possible inputs to program P, such that
Timothy A. Budd, Richard A. DeMillo, Richard J. Lipton, Frederick G. Sayward
POPL1