Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | https://arxiv.org/abs/2604.26578 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866918502682591232 |
|---|---|
| author | Beg, Arshad O'Donoghue, Diarmuid Monahan, Rosemary |
| author_facet | Beg, Arshad O'Donoghue, Diarmuid Monahan, Rosemary |
| contents | 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 into typed, attributed graphs. Our experiments cover datasets including C with ACSL, Java with JML, and Dafny for C\#. The pipeline integrates abstract syntax tree parsing with semantic embeddings derived from models such as SentenceTransformer and CodeBERT. This enables the generation of graph representations that capture both structural relationships and semantic context. Our results show that consistent graph representations can be constructed across different languages and annotation styles. This work provides a practical basis for future steps in semantic enrichment and approximate graph matching for scalable verification artefact reuse. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_26578 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Graph Construction and Matching for Imperative Programs using Neural and Structural Methods Beg, Arshad O'Donoghue, Diarmuid Monahan, Rosemary Software Engineering Artificial Intelligence D.2.1; D.2.4; D.2.10; F.4.1; F.4.3 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 into typed, attributed graphs. Our experiments cover datasets including C with ACSL, Java with JML, and Dafny for C\#. The pipeline integrates abstract syntax tree parsing with semantic embeddings derived from models such as SentenceTransformer and CodeBERT. This enables the generation of graph representations that capture both structural relationships and semantic context. Our results show that consistent graph representations can be constructed across different languages and annotation styles. This work provides a practical basis for future steps in semantic enrichment and approximate graph matching for scalable verification artefact reuse. |
| title | Graph Construction and Matching for Imperative Programs using Neural and Structural Methods |
| topic | Software Engineering Artificial Intelligence D.2.1; D.2.4; D.2.10; F.4.1; F.4.3 |
| url | https://arxiv.org/abs/2604.26578 |