Code property graph: Difference between revisions

Revision as of 12:51, 5 September 2022

Revision as of 12:53, 5 September 2022

Line 5:

== Definition ==

A code property graph of a program is a graph representation of the program obtained by merging its [[Abstractabstract syntax tree|abstract syntax trees]]s (AST), [[Control-flow graph|control flow graphs]]s (CFG) and [[Programprogram dependence graph|program dependence graphs]]s (PDG) at statement and predicate nodes. The resulting graph is a property graph, which is the underlying graph model of graph databases such as Neo4J, JanusGraph and OrientDB where data is stored in the nodes and edges as key-value pairs. In effect, code property graphs can be stored in graph databases and queried using graph query languages.

== Example ==

Consider the function of a [[C (programming language)|C]] program:

<syntaxhighlight lang="c">

void foo() {

Line 38:

== See also ==

* [[Abstract syntax tree|Abstract Syntax Tree]] (AST)

* [[Control-flow graph|Control Flow Graph]] (CFG)

* [[Program dependence graph|Program Dependence Graph]] (PDG)

* [[Graph database|Graph Database]]

==References==