A pipeline converts programs with annotations into typed attributed graphs using AST parsing and neural embeddings to support verification artefact reuse across languages.
In: International conference on applied engineering and natural sciences, vol 1, pp 1050–1056
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.SE 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Graph Construction and Matching for Imperative Programs using Neural and Structural Methods
A pipeline converts programs with annotations into typed attributed graphs using AST parsing and neural embeddings to support verification artefact reuse across languages.