Abstract
A new approach to deciding quasi-reducibility is proposed by introducing witnesses. Furthermore, an algorithm for constructing witnessed test sets of left-linear rewrite systems has been designed. Compared with the standard test set approach presented by Kapur, Narendran and Zhang, the method proposed generates test sets of smaller size and therefore has more efficient applications.
Access this article
We’re sorry, something doesn't seem to be working properly.
Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Kapur D, Musser D R. Inductive reasoning with incomplete specifications. InProceedings of Logic in Computer Science Conference, Cambridge, MA, 1986, pp.367–377.
Jouannaud J-P, Kounalis E Automatic proofs by induction in theories without constructors.Information and Computation, 1989, 82: 1–33.
Kapur D, Narendran P, Zhang H. Automating inductionless induction using test sets.Journal of Symbolic Computation, 1991, 11: 83–111.
Schmid K, Fettig R. Towards an efficient construction of test sets for deciding ground reducibility.Lecture Notes in Computer Science, 1995, 914: 86–100.
Author information
Authors and Affiliations
Additional information
This work was supported by the Ninth Five-Year Science and Technology Development Program and the National Natural Science Foundation of China.
SHAO Zhiqing received the Ph.D. degree in computer science from Shanghai Jiao Tong University. He is now an Associate Professor in the Department of Computer Science and Engineering, East China University of Science and Technology. His current interests include rewrite systems and theoretical computer science.
SUN Yongqiang is a Professor in the Department of Computer Science and Engineering, Shanghai Jiao Tong University. His current interests are formal techniques of software development, new paradigms of programming languages and parallel processing.
SONG Guoxin is a Professor in the Department of Computer Science and Engineering, East China University of Science and Technology. His current interests are formal methods, object-oriented programming, and concurrent engineering.
YU Huiqun received the Ph.D. degree in computer science from Shanghai Jiao Tong University. He is currently an Associate Professor in the Department of Computer Science and Engineering, East China University of Science and Technology. His areas of interest are formal methods, concurrency, reliable real-time systems, and semantics of programming languages.
Rights and permissions
About this article
Cite this article
Shao, Z., Sun, Y., Song, G. et al. Deciding quasi-reducibility using witnessed test sets. J. Comput. Sci. & Technol. 14, 146–152 (1999). https://doi.org/10.1007/BF02946521
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02946521