Search
for Author
All Reviews
Plaisted, David
Options:
All Media Types
Journals
Proceedings
Div Books
Whole Books
Other
Date Reviewed
Title
Author
Publisher
Published Date
Descending
Ascending
Date Reviewed
1
-
5
of
5
reviews
On the mechanical derivation of loop invariants
Chadha R., Plaisted D. Journal of Symbolic Computation 15(5-6): 705-744, 1993. Type: Article
A method for automatically deriving loop invariants for loops in a flowchart program for the purpose of proving the partial correctness of the program is described. In fact, the authors present a method for deriving logical consequence...
...
Mar 1 1995
Rewrite, rewrite, rewrite, rewrite, rewrite, …
Dershowitz N. (ed), Kaplan S., Plaisted D. Theoretical Computer Science 83(1): 71-96, 1991. Type: Article
By imposing a topology on the set defining a binary relation →, the authors extend the notion of finite convergence of → to that of &agr;-convergence, for &agr; an arbitrary ordinal number. In specializing to ...
...
Aug 1 1992
A heuristic algorithm for small separators in arbitrary graphs
Plaisted D. SIAM Journal on Computing 19(2): 267-280, 1990. Type: Article
Plaisted describes an algorithm for decomposing (cutting) a graph
G
into subgraphs,
G
i
, in a near-optimum manner. The resulting graphs
G
i
have a near-mini...
...
Oct 1 1991
Associative path orderings
Bachmair L., Plaisted D. Rewriting techniques and applications (, Dijon, France, 2541985. Type: Proceedings
The problem of finding a canonical form bor a word in a free algebra that represents an equational theory can be more or less easily solved when the equations of interest constitute the reduction rules under some simplified ordering of...
...
Oct 1 1987
A structure-preserving clause form translation
Plaisted D., Greenbaum S. Journal of Symbolic Computation 2(3): 293-304, 1986. Type: Article
This short paper (10 pages) describes an idea for improving resolution theorem provers: Avoid exponential growth in the number of clauses due to the usual way of converting to conjunctive normal form. Instead, invent new predicates to ...
...
Apr 1 1987
Reproduction in whole or in part without permission is prohibited. Copyright 1999-2024 ThinkLoud
®
Terms of Use
|
Privacy Policy