Skip to main content
SpringerLink
Log in

Deciding quasi-reducibility using witnessed test sets

  • Correspondence
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Kapur D, Musser D R. Inductive reasoning with incomplete specifications. InProceedings of Logic in Computer Science Conference, Cambridge, MA, 1986, pp.367–377.

  2. Jouannaud J-P, Kounalis E Automatic proofs by induction in theories without constructors.Information and Computation, 1989, 82: 1–33.

    Article  MATH  MathSciNet  Google Scholar 

  3. Kapur D, Narendran P, Zhang H. Automating inductionless induction using test sets.Journal of Symbolic Computation, 1991, 11: 83–111.

    Article  MATH  MathSciNet  Google Scholar 

  4. Schmid K, Fettig R. Towards an efficient construction of test sets for deciding ground reducibility.Lecture Notes in Computer Science, 1995, 914: 86–100.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, East China University of Science and Technology, 200237, Shanghai, P.R. China

    Shao Zhiqing, Song Guoxin & Yu Huiqun

  2. Department of Computer Science and Engineering, Shanghai Jiao Tong University, 200030, Shanghai, P.R. China

    Shao Zhiqing & Sun Yongqiang

Authors
  1. Shao Zhiqing
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sun Yongqiang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Song Guoxin
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Yu Huiqun
    View author publications

    You can also search for this author in PubMed Google Scholar

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

Reprints 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

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02946521

Keywords

Search

Navigation