#### Filter Results:

- Full text PDF available (10)

#### Publication Year

1975

2002

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

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- John Hogg, Doug Lea, Alan Wills, Dennis de Champeaux, Richard C. Holt
- Aliasing in Object-Oriented Programming
- 1992

Aliasing has been a problem in both formal verification and practical programming for a number of years. To the formalist, it can be annoyingly difficult to prove the simple Hoare formula {x = true} y := false {x = true}. If x and y refer to the same boolean variable, i.e., x and y are <i>aliased</i>, then the formula will not be valid, and proving thatā¦ (More)

- Dennis de Champeaux, Lenie Sint
- J. ACM
- 1977

A modification of Pohl's bidirectional heuristic search algorithm is described together with a simplified implementation. Theorems are proved about conditions yielding shortest paths. The results are given of a worst-case analysis of different algorithms, suggesting a rank order of their quality. Results that Pohl had obtained with a unidirectionalā¦ (More)

- Dennis de Champeaux
- J. ACM
- 1983

Extenswe modificaUons of a previously published bidirectional heuristic search algorithm are presented in order to preserve the property that shortest solutions are found under approprmte circumstances. Theoretical results encompass the generahzation of the unidirectional optimahty theorem

- Dennis de Champeaux
- ECOOP
- 1991

oo-analysis; top-down; ensemble In this paper, we address the issue of how to provide an analyst that uses the object-oriented paradigm with a top-down approach. An analyst gets this approach for free when working within the structured paradigm. Ensembles are introduced that differ from objects in that they connote entities with internal parallelism.ā¦ (More)

- Mohamed Fayad, Dennis de Champeaux
- TRI-Ada Tutorials
- 1992

- Dennis de Champeaux
- J. Comput. Syst. Sci.
- 1986

- Dennis de Champeaux
- J. ACM
- 1986

Properties are proved about INSTANCE, a theorem prover module that recognizes that a formula is a special case and/or an alphabetic variant of another formula, and about INSURER, another theorem prover module that decomposes a problem, represented by a formula, into independent subproblems, using a conjunction. The main result of INSTANCE is soundness; theā¦ (More)

- Dennis de Champeaux, Lenie Sint
- Comput. J.
- 1977

- Dennis de Champeaux
- AISB/GI
- 1978