New Experiments With A Constraint-Based Approach To Program Plan Matching
Yongjun Zhang and
Steven Woods and
Alex
Quilici.
Abstract
In earlier work, we presented some preliminary empirical scalability
results for a constraint-based program plan matching algorithm.
Those initial experiments had several important shortcomings:
they worked with a collection of artifically generated programs,
and they applied a particular constraint satisfaction approach.
This paper reports the results of a collection of new
experiments that begin to address these deficiencies.
In particular, we have begun experimenting with real-world C code,
and we have begun exploring alternative approaches
to solving constraint satisfaction problems.
While not definitive, these new experiments
provide further support for our earlier results,
and they have led to a new approach that provides
significant improvements in the scalability of our plan
matching algorithm.
Comments
None.
Copyright Notice
Copyright 1997 IEEE. Published in the Proceedings of the IEEE Working
Conference on Reverse Engineering (WCRE-97), October, 1997, Amsterdam, The Netherlands. Personal use of this material is permitted. However,
permission to reprint/republish this material for advertising or
promotional purposes or for creating new collective works for resale
or redistribution to servers or lists, or to reuse any copyrighted
component of this work in other works, must be obtained from the IEEE.
The Paper