Towards certified separate compilation for concurrent programs

Jiang, Hanru; Liang, Haiyi; Xiao, Siyang; Zha, Junpeng; Feng, Xiaobing

doi:10.1145/3314221.3314595

Cited by 18 publications

(31 citation statements)

References 42 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The team led by Professor Feng studied the compilation and formal verification for concurrent programs Jiang et al (2019), partial methods for concurrent objects Liang and Feng (2018), and verification for kernel preemption Xu et al (20116). A program logic LiLi was proposed for verifying linearizability and progress for concurrent objects Liang and Feng (2016).…”

Section: Related Workmentioning

confidence: 99%

Formal design and verification of system task in intelligent transportation systems based on micro-kernel architecture

Qian

Jin

Sun

et al. 2021

J Ambient Intell Human Comput

View full text Add to dashboard Cite

The accuracy of design and implementation of an operating system in intelligent transportation systems is difficult to describe and validate because of its complexity. In this paper, we describe an OS in intelligent transportation systems with automaton theory and establish an OS state model. Based on this model, we construct an isomorphic model in Isabelle/HOL, describe the work objects and operational semantics of the system, and verify the system at the assembly level. We use a micro-kernel OS prototype (VSOS) for intelligent transportation systems as an example to illustrate our method and verify the correctness of design and implementation in VSOS with Isabelle/HOL. Verification shows that the proposed method is feasible.

show abstract

Section: Related Workmentioning

confidence: 99%

Formal design and verification of system task in intelligent transportation systems based on micro-kernel architecture

Qian

Jin

Sun

et al. 2021

J Ambient Intell Human Comput

View full text Add to dashboard Cite

show abstract

“…The main limitation of verified separate compilation is its assumption on using the same compiler for compiling all modules (with some variants as described by Kang et al [2016]). There exist other more general approaches to verified compositional compilation that break this limitation and support compilation and linking of heterogeneous modules Jiang et al 2019;Song et al 2020]. However, all these approaches only deal with compilation of source programs into CompCert's assembly programs and adopt the abstract view of linking in the vanilla CompCert.…”

Section: Generality Of Our Approachmentioning

confidence: 99%

“…Various techniques for more general compositional compilation in CompCert have been proposed. Notable examples include Compositional CompCert Stewart 2015], CompCertX [Gu et al 2015], CASCompCert [Jiang et al 2019] and CompCertM [Song et al 2020]. All these extensions compile only to CompCert's assembly language.…”

Section: Related Workmentioning

confidence: 99%

CompCertELF: verified separate compilation of C programs into ELF object files

Wang

Wilke

et al. 2020

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

We present CompCertELF, the first extension to CompCert that supports verified compilation from C programs all the way to a standard binary file format, i.e., the ELF object format. Previous work on Stack-Aware CompCert provides a verified compilation chain from C programs to assembly programs with a realistic machine memory model. We build CompCertELF by modifying and extending this compilation chain with a verified assembler which further transforms assembly programs into ELF object files.CompCert supports large-scale verification via verified separate compilation: C modules can be written and compiled separately, and then linked together to get a target program that refines the semantics of the program linked from the source modules. However, verified separate compilation in CompCert only works for compilation to assembly programs, not to object files. For the latter, the main difficulty is to bridge the two different views of linking: one for CompCert's programs that allows arbitrary shuffling of global definitions by linking and the other for object files that treats blocks of encoded definitions as indivisible units.We propose a lightweight approach that solves the above problem without any modification to CompCert's framework for verified separate compilation: by introducing a notion of syntactical equivalence between programs and proving the commutativity between syntactical equivalence and the two different kinds of linking, we are able to transit from the more abstract linking operation in CompCert to the more concrete one for ELF object files. By applying this approach to CompCertELF, we obtain the first compiler that supports verified separate compilation of C programs into ELF object files.

show abstract

“…CASCompCert. CASCompCert [Jiang et al 2019] extends CompComp to support concurrency in the absence of data races, which demonstrates that the proof technique of CompComp (i.e., structured simulations) scales to a concurrent setting. However, in the Coq formalization, Com-pComp tames the complexity of structured simulations by (i) not allowing address-taken stack variables (although how to support them using structured simulations is described with paper proofs in the associated technical report 13 ); and (ii) only covering 12 out of the 20 passes in its base version, CompCert 3.0.1 (although the 12 passes are exactly those that are covered by the original CompComp): these restrictions unnecessitate the use of memory injection.…”

Section: Compositional Correctness For Compcertmentioning

confidence: 99%

CompCertM: CompCert with C-assembly linking and lightweight modular verification

Song

Cho

Kim

et al. 2019

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

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.

show abstract

Towards certified separate compilation for concurrent programs

Cited by 18 publications

References 42 publications

Formal design and verification of system task in intelligent transportation systems based on micro-kernel architecture

Formal design and verification of system task in intelligent transportation systems based on micro-kernel architecture

CompCertELF: verified separate compilation of C programs into ELF object files

CompCertM: CompCert with C-assembly linking and lightweight modular verification

Contact Info

Product

Resources

About