Newest papers

Function Contracts for Bounded Model Checking of C Programs

Weiqi Wang, Marie Farrell, Liping Zhao, Lucas Carvalho Cordeiro · 2026 · arXiv (Cornell University)

DOI: 10.48550/arxiv.2610.26089 · cited by 0 works (OpenAlex) · open-access PDF

Japanese

ES Bounded モデル コントロール ツールは単一の公式にプログラムを解析するので、ロープを保持する機能は、各呼び出しサイトでそのロープの新しいコピーを解析者にコストをコストします。 機能契約は、そのコントロールを破ります。 MLBMC に対して 1 回体を検証し、それから生じたステップによって各呼び出しを置き換えます。 CBMC は、ダイナミック フレーム 状態のコントロールを通じてこれをサポートします、産業規模で適用されますが、なぜそのロープのコントロールが音質であり、機能のコントロールコストの特徴を示さないという公式な説明はありません。 ESBMC に対して機能契約枠を 1 回検証します。 条項

Machine translation (Meta M2M100); the English original follows.

Abstract

Bounded model checking unrolls a program into a single formula, so a function holding a loop costs the solver a fresh copy of that loop at every call site. Function contracts break that coupling. Verify the body once against its contract, then replace each call by a stub derived from it. CBMC supports this through dynamic frame condition checking, applied at industrial scale, but with no formal account of why the replacement is sound and no characterisation of what the frame check costs. We present the function-contract framework for ESBMC. The clause syntax, both phases, and the first assigns enforcement the tool has had are all introduced here. Its technical core is an observational frame rule: snapshot the locations the contract does not permit the function to write, then compare them at exit. The encoding emits a number of verification conditions set by how many globals the program has, not by how many writes the body performs, while dynamic frame condition checking grows with the write count. That is a property of the encoding rather than a timing, so it moves with neither the machine nor the solver. The rule itself is the classical one; what we add is its bounded form inside a BMC encoding, with the pipeline's algebraic skeleton machine-checked in Lean 4 and the limits of that model stated. We evaluate on synthetic sweeps, SV-COMP tasks, an ANSSI X.509 parser, the FreeRTOS heap_1 allocator, and the ML-KEM reference implementation whose CBMC contracts we reuse unchanged. At the coefficient count FIPS-203 mandates, neither tool finishes on the monolithic route inside ten minutes, and both finish on the modular one. The framework is merged into ESBMC master. Contracts are what is left when unrolling runs out of room.

Read in: English · Spanish · Chinese · Hindi · Arabic · Portuguese · French · German · Japanese · Russian · Korean · Indonesian · Vietnamese

Topics: Bounded function, Computer science, Model checking, Frame (networking), Reuse, Programming language

Sources: OpenAlex (CC0), arXiv, Crossref. Agent Exchange