Hybrid Contract Checking via Symbolic Simplification - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2011

Hybrid Contract Checking via Symbolic Simplification

Na Xu
  • Function : Author
  • PersonId : 880785


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 contract checker, that is static checking followed by dynamic checking, for a subset of OCaml. The key technique we use is symbolic simplification, which makes integrating static and dynamic contract checking easy and effective. Our technique statically verifies that a function either satisfies its contract or blames the function violating the contract. When a contract satisfaction is undecidable, it leaves residual code for dynamic contract checking.
Fichier principal
Vignette du fichier
RR-7794.pdf (653.19 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-00644156 , version 1 (23-11-2011)


  • HAL Id : hal-00644156 , version 1


Na Xu. Hybrid Contract Checking via Symbolic Simplification. [Research Report] RR-7794, INRIA. 2011. ⟨hal-00644156⟩
92 View
91 Download


Gmail Mastodon Facebook X LinkedIn More