[Paper] Syntax-driven Incremental Program Verification of Matching Logic Properties

Source: arXiv - 2606.08824v1

Overview

Incrementality is a fundamental design principle to master the complexity of large, long-lived software systems. This principle has been embraced by agile development processes and it lays at the base of continuous software evolution. A major challenge in this context is to incrementally re-verify the correctness of software artifacts after every change, focusing the verification efforts only on the parts affected by the change. We present an approach to the incremental verification of programs written in KernelC, annotated with properties expressed in matching logic. The approach is based on a syntactic-semantic framework that enables analyzing code chunks in isolation so that, after a change to a program fragment, only the part whose semantics is affected by the change is re-processed. This property is obtained by expressing the language syntax through an operator precedence grammar and by formalizing its semantics through a synthesized attribute schema. We have implemented our technique in a prototype tool and experimentally evaluated its effectiveness. The results show that our approach does not penalize the efficiency of formal verification and can outperform program re-verification after changes, depending on the presence and type of annotations, as well as the position of the change and the program structure.

Key Contributions

This paper presents research in the following areas:

• cs.SE

Methodology

Please refer to the full paper for detailed methodology.

Practical Implications

This research contributes to the advancement of cs.SE.

Authors

• Domenico Bianculli
• Antonio Filieri
• Carlo Ghezzi
• Dino Mandrioli
• Alessandro Maria Rizzi

Paper Information

• arXiv ID: 2606.08824v1
• Categories: cs.SE
• Published: June 7, 2026
• PDF: Download PDF