Overlaying control flow graphs on P4 syntax trees with Gremlin

DOI10.14232/ACTACYB.298770MaRDI QIDQ6602519zbMATH OpenFDO

Authors Máté Tejfel

Publication date 11 September 2024

Published in Acta Cybernetica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.14232/ACTACYB.298770

zbMATH Keywords

control flow graphgraph databaseGremlinP4proof of correctnessstatic analysis

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Control flow graphs and code coverage
• Designing and implementing control flow graph for Magic 4th generation language
• Refinement-based CFG reconstruction from unstructured programs
• A threaded abstract syntax tree based generation algorithm of program dependence graph
• Graph Grammar Extraction from Source Code

This page was built for publication: Overlaying control flow graphs on P4 syntax trees with Gremlin

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6602519)