EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Coma , an Intermediate Verification Language with Explicit Abstraction Barriers

Andrei Paskevich, Paul Patault, Jean-Christophe Filliâtre

ACM Transactions on Programming Languages and Systems · 30.09.2026 · 48 (3) · 1-41

DOI: 10.1145/3816735 ↗

Kurz gefasst

Fachartikel in der Zeitschrift ACM Transactions on Programming Languages and Systems, online erschienen am 24.07.2026. Verfasst von Andrei Paskevich und 2 weiteren Autor:innen. Die Arbeit nennt 21 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: ANR project, Île-de-France region, French government in the context of “Plan France 2030.”.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We present Coma , a formally defined intermediate verification language. Specification annotations in Coma take the form of assertions mixed with the executable program code. A special programming construct representing the abstraction barrier is used to separate, inside a subroutine, the “interface” part of the code, which is verified at every call site, from the “implementation” part, which is verified once, at the definition site. In comparison with traditional contract-based specification, this offers us an additional degree of freedom, as we can provide separate specification (or none at all) for different execution paths. We define a verification condition procedure for Coma and prove its correctness. For programs with a specification given in a traditional way, with an abstraction barrier at the function boundary, our verification conditions are similar to those produced by a classical weakest-precondition calculus. For programs where abstraction barriers are put in the middle of a function definition, the user-written specification is seamlessly completed with the verification conditions generated for the exposed part of the code. Moreover, our procedure can factorize selected subgoals on the fly, which leads to more compact verification conditions. We illustrate the use of Coma on two non-trivial examples, formalized and verified using our implementation: a second-order regular expression engine and a sorting algorithm written in unstructured assembly code.

Förderung

  • ANR project
  • Île-de-France region
  • French government in the context of “Plan France 2030.”

Zitieren

APA

Paskevich, A., Patault, P., & Filliâtre, J. (2026). Coma , an Intermediate Verification Language with Explicit Abstraction Barriers. ACM Transactions on Programming Languages and Systems, 48(3), 1-41. https://doi.org/10.1145/3816735

Vancouver

Paskevich A, Patault P, Filliâtre J. Coma , an Intermediate Verification Language with Explicit Abstraction Barriers. ACM Transactions on Programming Languages and Systems. 2026;48(3):1-41. doi:10.1145/3816735

BibTeX
@article{Paskevich2026,
  author = {Paskevich, Andrei and Patault, Paul and Filliâtre, Jean-Christophe},
  title = {Coma , an Intermediate Verification Language with Explicit Abstraction Barriers},
  journal = {ACM Transactions on Programming Languages and Systems},
  year = {2026},
  volume = {48},
  number = {3},
  pages = {1--41},
  doi = {10.1145/3816735}
}
Kostenlos starten →