National Tsing Hua University Institutional Repository:The Specialization of Programs by Theorem Proving
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 54367/62174 (87%)
Visitors : 15076248      Online Users : 83
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTHU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    NTHUR > Presidents > Lee, Richard Chia-Tung (1993-1994) > LRCT Journal / Magazine Articles  >  The Specialization of Programs by Theorem Proving

    Please use this identifier to cite or link to this item:

    Title: The Specialization of Programs by Theorem Proving
    Authors: Chang, C. L.;Lee, R. C. T.;Dixon, J. K.
    Teacher: 李家同
    Date: 1973
    Publisher: Society for Industrial and Applied Mathematics
    Relation: SIAM Journal on Computing, Society for Industrial and Applied Mathematics, Volume 2, Issue 1, 1973, Pages 7-15
    Keywords: axioms
    describing formulas
    halting clauses
    theorem proving
    Abstract: Suppose a program P is written to accept a set of inputs I. If we are only interested in a nonempty subset $I^ * $ of I, we usually can simplify P to another program $P^ * $ such that $P^ * $ runs faster on $I^ * $ than P does. The problem of specialization is to find such $P^ * $. In this paper, the program P and the input $I^ * $ will be specified by axioms. Using these axioms, we can obtain $P^ * $ from P through theorem-proving techniques.
    Relation Link:
    Appears in Collections:[Lee, Richard Chia-Tung (1993-1994)] LRCT Journal / Magazine Articles
    [Department of Computer Science] CS Journal / Magazine Articles

    Files in This Item:

    There are no files associated with this item.


    SFX Query


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback