Hybrid contract checking via symbolic simplification - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year :

Hybrid contract checking via symbolic simplification


Program errors are hard to detect or prove absent. Allowing programmers to write formal and precise specifications, especially in the form of contracts, is a popular approach to program verification and error discovery. We formalize and implement a hybrid (static and dynamic) contract checker for a subset of OCaml. The key technique is symbolic simplification, which makes integrating static and dynamic contract checking easy and effective. Our technique statically checks contract satisfaction or blames the function violating the contract. When a contract satisfaction is undecidable, it leaves residual code for dynamic contract checking.

Dates and versions

hal-01110282 , version 1 (27-01-2015)



Dana N. Xu. Hybrid contract checking via symbolic simplification. PEPM'12: ACM workshop on Partial evaluation and program manipulation, Jan 2012, Philadelphia, United States. pp.107-116, ⟨10.1145/2103746.2103767⟩. ⟨hal-01110282⟩


45 View
0 Download



Gmail Facebook Twitter LinkedIn More