#### Filter Results:

- Full text PDF available (5)

#### Publication Year

1995

2001

- This year (0)
- Last 5 years (0)
- Last 10 years (0)

#### Publication Type

#### Journals and Conferences

#### Key Phrases

Learn More

- Adam Brooks Webber
- Annals of Mathematics and Artificial Intelligence
- 1995

In their study of algorithms for reasoning about intervals, Golumbic and Shamir conjectured that a certain class of interval inference problems is intractable (Golumbic and Shamir, J. ACM 40(1993)1108-1133). The conjecture is correct; this paper proves the NP-completeness of the interval satisfiability (ISAT) problem for the domain of relations known as Δ5.

- Adam Brooks Webber
- SIGCSE
- 1996

INTRODUCTION For the past three semesters I have taught programming to beginners using a new software system called the Pascal Trainer. In closed labs the students solve a carefully planned sequence of well over a hundred simple programming exercises. The most elementary of these exercises require the student to write simple expressions; later exercises… (More)

- Adam Brooks Webber
- ACM Trans. Program. Lang. Syst.
- 1995

We describe a new technique for optimizing first-order functional programs. Programs are represented as graph grammars, and optimization proceeds by counterexample: when a graph generated by the grammar is found to contain an unnecessary computation, the optimizer attempts to reformulates the grammar so that it never again generates any graph that contains… (More)

- Adam Brooks Webber
- PASTE
- 2001

This paper is a progress report on our research into the problem of automatically identifying and using class invariants in object-oriented programs. We introduce an example of a class invariant in Java, and review applications for class invariants in software engineering tools and in compiler optimization. We then focus on an elementary problem of… (More)

- Adam Brooks Webber
- PLDI
- 1997

This paper presents a method called <i>relational constraint</i> for finding binary relations among the variables and constants of a program. The method constructs a table of binary relations and treats the program as a collection of constraints on tuples of relations in the table. An experimental optimizer called Thinner uses this method to analyze… (More)

- ‹
- 1
- ›