Graph Construction and Matching for Imperative Programs using Neural and Structural Methods

arXiv:2604.26578v3 Announce Type: replace-cross Abstract: Reusing verification artefacts requires identifying structural and semantic similarities across programs and their specifications. In this paper, we focus on graph construction as a foundational step toward this goal. We present a pipeline that converts imperative programs and their annotations…

Thank you for reading this post, don't forget to subscribe!

Source: cs.AI updates on arXiv.org

Automatically aggregated summary — full article and all rights belong to the original publisher.

Leave a Comment