J-STAGE Home  >  Publications - Top  > Bibliographic Information

Journal of Information Processing
Vol. 23 (2015) No. 6 pp. 827-834

Language:

http://doi.org/10.2197/ipsjjip.23.827


A refinement type can be used to express a detailed specification of a higher-order functional program. Given a refinement type as a specification of a program, we can verify that the program satisfies the specification by checking that the program has the refinement type. Refinement type checking/inference has been extensively studied and a number of refinement type checkers have been implemented. Most of the existing refinement type checkers, however, need type annotations, which is a heavy burden on users. To overcome this problem, we reduce a refinement type checking problem to an assertion checking problem, which asks whether the assertions in a program never fail; and then we use an existing assertion checker to solve it. This reduction enables us to construct a fully automated refinement type checker by using a state-of-the-art fully automated assertion checker. We also prove the soundness and the completeness of the reduction, and report on implementation and preliminary experiments.

Copyright © 2015 by the Information Processing Society of Japan

Article Tools

Share this Article