Refinement type checking via assertion checking

Ryosuke Sato, Kazuyuki Asada, Naoki Kobayashi

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)827-834
Number of pages8
JournalJournal of information processing
Volume23
Issue number6
DOIs
Publication statusPublished - Nov 15 2015

Fingerprint

Specifications
Experiments

All Science Journal Classification (ASJC) codes

  • Computer Science(all)

Cite this

Refinement type checking via assertion checking. / Sato, Ryosuke; Asada, Kazuyuki; Kobayashi, Naoki.

In: Journal of information processing, Vol. 23, No. 6, 15.11.2015, p. 827-834.

Research output: Contribution to journalArticle

Sato, Ryosuke ; Asada, Kazuyuki ; Kobayashi, Naoki. / Refinement type checking via assertion checking. In: Journal of information processing. 2015 ; Vol. 23, No. 6. pp. 827-834.
@article{3f22bffa2a75467c88d28b8f1c44a59b,
title = "Refinement type checking via assertion checking",
abstract = "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.",
author = "Ryosuke Sato and Kazuyuki Asada and Naoki Kobayashi",
year = "2015",
month = "11",
day = "15",
doi = "10.2197/ipsjjip.23.827",
language = "English",
volume = "23",
pages = "827--834",
journal = "Journal of Information Processing",
issn = "0387-6101",
publisher = "Information Processing Society of Japan",
number = "6",

}

TY - JOUR

T1 - Refinement type checking via assertion checking

AU - Sato, Ryosuke

AU - Asada, Kazuyuki

AU - Kobayashi, Naoki

PY - 2015/11/15

Y1 - 2015/11/15

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84947233320&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84947233320&partnerID=8YFLogxK

U2 - 10.2197/ipsjjip.23.827

DO - 10.2197/ipsjjip.23.827

M3 - Article

AN - SCOPUS:84947233320

VL - 23

SP - 827

EP - 834

JO - Journal of Information Processing

JF - Journal of Information Processing

SN - 0387-6101

IS - 6

ER -