Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Call_graph> ?p ?o }
Showing triples 1 to 94 of
94
with 100 triples per page.
- Call_graph abstract "A call graph (also known as a call multigraph) is a directed graph (and more specifically a flow graph) that represents calling relationships between subroutines in a computer program. Specifically, each node represents a procedure and each edge (f, g) indicates that procedure f calls procedure g. Thus, a cycle in the graph indicates recursive procedure calls.Call graphs are a basic program analysis result that can be used for human understanding of programs, or as a basis for further analyses, such as an analysis that tracks the flow of values between procedures. One simple application of call graphs is finding procedures that are never called.Call graphs can be dynamic or static. A dynamic call graph is a record of an execution of the program, e.g., as output by a profiler. Thus, a dynamic call graph can be exact, but only describes one run of the program. A static call graph is a call graph intended to represent every possible run of the program. The exact static call graph is an undecidable problem, so static call graph algorithms are generally overapproximations. That is, every call relationship that occurs is represented in the graph, and possibly also some call relationships that would never occur in actual runs of the program.Call graphs can be defined to represent varying degrees of precision. A more precise call graph more precisely approximates the behavior of the real program, at the cost of taking longer to compute and more memory to store. The most precise call graph is fully context-sensitive, which means that for each procedure, the graph contains a separate node for each call stack that procedure can be activated with. A fully context-sensitive call graph is called calling context tree. A calling context tree can be computed dynamically easily, although it may take up a large amount of memory. Calling context trees are usually not computed statically, because it would take too long for a large program. The least precise call graph is context-insensitive, which means that there is only one node for each procedure.With languages that feature dynamic dispatch, such as Java and C++, computing a static call graph precisely requires alias analysis results. Conversely, computing precise aliasing requires a call graph. Many static analysis systems solve the apparent infinite regress by computing both simultaneously.This term is frequently used in the compiler and binary translation community. By tracking a call graph, it may be possible to detect anomalies of program execution or code injection attacks.".
- Call_graph thumbnail A_Call_Graph_generated_by_pycallgraph.png?width=300.
- Call_graph wikiPageExternalLink 263700.264352.
- Call_graph wikiPageExternalLink cpu_profiler.html.
- Call_graph wikiPageExternalLink abs_all.jsp?isnumber=1950&arnumber=54302&count=13&index=12.
- Call_graph wikiPageExternalLink abs_all.jsp?isnumber=35910&arnumber=1702621&count=17&index=5.
- Call_graph wikiPageExternalLink kcachegrind.sourceforge.net.
- Call_graph wikiPageExternalLink gallery.
- Call_graph wikiPageExternalLink phpcallgraph.sourceforge.net.
- Call_graph wikiPageExternalLink pycallgraph.slowchop.com.
- Call_graph wikiPageExternalLink tceetree.
- Call_graph wikiPageExternalLink c-calltrees-in-bash-revisited.html.
- Call_graph wikiPageExternalLink www.codeprophet.co.uk.
- Call_graph wikiPageExternalLink codeviz.
- Call_graph wikiPageExternalLink egypt.
- Call_graph wikiPageExternalLink script.php?script_id=2368.
- Call_graph wikiPageExternalLink wiki.
- Call_graph wikiPageExternalLink gprof2dot.
- Call_graph wikiPageExternalLink code2flow.
- Call_graph wikiPageExternalLink Devel::NYTProf.
- Call_graph wikiPageID "3838181".
- Call_graph wikiPageLength "11253".
- Call_graph wikiPageOutDegree "50".
- Call_graph wikiPageRevisionID "693621719".
- Call_graph wikiPageWikiLink AMD_CodeAnalyst.
- Call_graph wikiPageWikiLink Advanced_Micro_Devices.
- Call_graph wikiPageWikiLink Alias_analysis.
- Call_graph wikiPageWikiLink Binary_translation.
- Call_graph wikiPageWikiLink C++.
- Call_graph wikiPageWikiLink Call_stack.
- Call_graph wikiPageWikiLink Calling_context_tree.
- Call_graph wikiPageWikiLink Category:Compiler_construction.
- Call_graph wikiPageWikiLink Category:Documentation_generators.
- Call_graph wikiPageWikiLink Category:Graph_data_structures.
- Call_graph wikiPageWikiLink Category:Static_program_analysis.
- Call_graph wikiPageWikiLink Compiler.
- Call_graph wikiPageWikiLink Computer_program.
- Call_graph wikiPageWikiLink Cscope.
- Call_graph wikiPageWikiLink DMS_Software_Reengineering_Toolkit.
- Call_graph wikiPageWikiLink Dependency_graph.
- Call_graph wikiPageWikiLink Directed_graph.
- Call_graph wikiPageWikiLink Doxygen.
- Call_graph wikiPageWikiLink Dynamic_dispatch.
- Call_graph wikiPageWikiLink Free_software.
- Call_graph wikiPageWikiLink GNU_Binutils.
- Call_graph wikiPageWikiLink GNU_Compiler_Collection.
- Call_graph wikiPageWikiLink GNU_cflow.
- Call_graph wikiPageWikiLink Gprof.
- Call_graph wikiPageWikiLink Graphviz.
- Call_graph wikiPageWikiLink Java_(programming_language).
- Call_graph wikiPageWikiLink Make_(software).
- Call_graph wikiPageWikiLink Multigraph.
- Call_graph wikiPageWikiLink OS_X.
- Call_graph wikiPageWikiLink Object-oriented_programming.
- Call_graph wikiPageWikiLink OpenPAT.
- Call_graph wikiPageWikiLink Perl.
- Call_graph wikiPageWikiLink Project_Analyzer.
- Call_graph wikiPageWikiLink Rooted_graph.
- Call_graph wikiPageWikiLink Subroutine.
- Call_graph wikiPageWikiLink Undecidable_problem.
- Call_graph wikiPageWikiLink VTune.
- Call_graph wikiPageWikiLink Valgrind.
- Call_graph wikiPageWikiLink Vim_(text_editor).
- Call_graph wikiPageWikiLink File:A_Call_Graph_generated_by_pycallgraph.png.
- Call_graph wikiPageWikiLinkText "Call graph".
- Call_graph wikiPageWikiLinkText "Program Dependency Graphs".
- Call_graph wikiPageWikiLinkText "call graph".
- Call_graph wikiPageWikiLinkText "flow graph generator".
- Call_graph wikiPageWikiLinkText "flow graphs".
- Call_graph wikiPageWikiLinkText "flowgraph generator".
- Call_graph wikiPageUsesTemplate Template:Citation_needed.
- Call_graph wikiPageUsesTemplate Template:Reflist.
- Call_graph subject Category:Compiler_construction.
- Call_graph subject Category:Documentation_generators.
- Call_graph subject Category:Graph_data_structures.
- Call_graph subject Category:Static_program_analysis.
- Call_graph hypernym Graph.
- Call_graph type MusicGenre.
- Call_graph type Software.
- Call_graph type Generator.
- Call_graph type Object.
- Call_graph type Structure.
- Call_graph type Tool.
- Call_graph type Generator.
- Call_graph comment "A call graph (also known as a call multigraph) is a directed graph (and more specifically a flow graph) that represents calling relationships between subroutines in a computer program. Specifically, each node represents a procedure and each edge (f, g) indicates that procedure f calls procedure g.".
- Call_graph label "Call graph".
- Call_graph sameAs Q2589940.
- Call_graph sameAs コールグラフ.
- Call_graph sameAs m.0b2m0j.
- Call_graph sameAs Граф_вызовов.
- Call_graph sameAs Q2589940.
- Call_graph wasDerivedFrom Call_graph?oldid=693621719.
- Call_graph depiction A_Call_Graph_generated_by_pycallgraph.png.
- Call_graph isPrimaryTopicOf Call_graph.