Subgraph isomorphism, matching relational structures and maximal cliques

Barrow, Harry G.; Burstall, Rod M.

doi:10.1016/0020-0190(76)90049-1

Cited by 165 publications

(108 citation statements)

References 1 publication

Supporting

Mentioning

107

Contrasting

Unclassified

Order By: Relevance

“…You can see this by following the edge named "argv" (the program's arguments). Dereferencing the first element of argv (following the edge labeled "() [1]", we find argv [1]-the argument "zeller". 2 To fetch the full name, userinfo accesses the user database via its pwd variable.…”

Section: An Example Graphmentioning

confidence: 99%

“…The memory graph shows the state of a program named userinfo 1 . userinfo takes a UNIX user name as argument and shows the user's full name and e-mail address.…”

Section: An Example Graphmentioning

confidence: 99%

“…Further descendants include the user id, the group id, the full name of the user and the UNIX user name "zeller" as well). You see that the two strings argv [1] and pwd → pw name are disjoint; however, arg points to the same string as argv [1]. Obviously, such a graph drawing is much more valuable than, say, a table of variables and values.…”

Section: An Example Graphmentioning

confidence: 99%

“…A similar case occurs when a C struct contains arrays that grow beyond its boundaries, as in struct foo { int member; int array [1]; } . Although array is declared to have only one element, it is actually used as dynamic array, expanding beyond the struct boundaries.…”

Section: Dealing With C Data Structuresmentioning

confidence: 99%

“…How does one compute a maximum common subgraph? Barrow and Burstall [1] first observed that a maximum subgraph can be obtained by using a correspondence graph . In our notation, their algorithm looks like this: …”

Section: Graph Differencesmentioning

confidence: 99%

See 4 more Smart Citations

Visualizing Memory Graphs

Zimmermann

Zeller

2002

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract.To understand the dynamics of a running program, it is often useful to examine its state at specific moments during its execution. We present memory graphs as a means to capture and explore program states. A memory graph gives a comprehensive view of all data structures of a program; data items are related by operations like dereferencing, indexing or member access. Although memory graphs are typically too large to be visualized as a whole, one can easily focus on specific aspects using well-known graph operations. For instance, a greatest common subgraph visualizes commonalities and differences between program states. Keywords: program understanding, debugging aids, diagnostics, data types and structures, graphs A Structured View of MemoryExploring the state of a program, to view its variables, values, and current execution position, is a typical task in debugging programs. Today's interactive debuggers allow accessing the values of arbitrary variables and printing their values. Typically, values are shown as texts. Here's an example output from the GNU debugger GDB:(gdb) print *tree *tree = {value = 7, name = 0x8049e88 "Ada", left = 0x804d7d8, right = 0x0, left thread = false, right thread = false, date = {day of week = Thu, day = 1, month = 1, year = 1970, vptr. = 0x8049f78 Date virtual table }, static shared = 4711} (gdb) _ Fig. 1. Printing textual data with GDB Although modern debuggers offer graphical user interfaces instead of GDB's command line, data values are still shown as text. This is useful in the most cases, but fails badly as soon as references and pointers come into play. Consider Figure 1, for example: where does tree-> left point to? Of course, one can simply print the dereferenced value. However, a user will never notice if two pointers point to the same address-except by thoroughly checking and comparing pointer values.

show abstract

Section: An Example Graphmentioning

confidence: 99%

“…The memory graph shows the state of a program named userinfo 1 . userinfo takes a UNIX user name as argument and shows the user's full name and e-mail address.…”

Section: An Example Graphmentioning

confidence: 99%