CompCertM: CompCert with C-Assembly Linking and Lightweight Modular Verification

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 20
  • Download : 0
Supporting multi-language linking such as linking C and handwritten assembly modules in the verified compiler CompCert requires a more compositional verification technique than that used in CompCert just supporting separate compilation. The two extensions, CompCertX and Compositional CompCert, supporting multi-language linking take different approaches. The former simplifies the problem by imposing restrictions that the source modules should have no mutual dependence and be verified against certain well-behaved specifications. On the other hand, the latter develops a new verification technique that directly solves the problem but at the expense of significantly increasing the verification cost. In this paper, we develop a novel lightweight verification technique, called RUSC (Refinement Under Self-related Contexts), and demonstrate how RUSC can solve the problem without any restrictions but still with low verification overhead. For this, we develop CompCertM, a full extension of the latest version of CompCert supporting multi-language linking. Moreover, we demonstrate the power of RUSC as a program verification technique by modularly verifying interesting programs consisting of C and handwritten assembly against their mathematical specifications.
Publisher
ASSOC COMPUTING MACHINERY
Issue Date
2020-01
Language
English
Article Type
Article
Citation

PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL, v.4

ISSN
2475-1421
DOI
10.1145/3371091
URI
http://hdl.handle.net/10203/287745
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0