Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Call_graph> ?p ?o. }
Showing items 1 to 51 of
51
with 100 items per page.
- Call_graph abstract "A call graph (also known as a call multigraph) is a directed 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 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[citation needed].".
- Call_graph thumbnail A_Call_Graph_generated_by_pycallgraph.png?width=300.
- Call_graph wikiPageExternalLink google-gprof2dot.
- Call_graph wikiPageExternalLink Gprof2Dot.
- 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 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 code2flow.
- Call_graph wikiPageExternalLink Devel::NYTProf.
- Call_graph wikiPageID "3838181".
- Call_graph wikiPageRevisionID "594888950".
- Call_graph hasPhotoCollection Call_graph.
- 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 type Apparatus102727825.
- Call_graph type Artifact100021939.
- Call_graph type DocumentationGenerators.
- Call_graph type Equipment103294048.
- Call_graph type Generator103434188.
- Call_graph type Instrumentality103575240.
- Call_graph type Object100002684.
- Call_graph type PhysicalEntity100001930.
- Call_graph type Whole100003553.
- Call_graph type Genre.
- Call_graph type MusicGenre.
- Call_graph type TopicalConcept.
- Call_graph type Concept.
- Call_graph comment "A call graph (also known as a call multigraph) is a directed 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_graph label "Call graph".
- Call_graph label "Граф вызовов".
- Call_graph label "コールグラフ".
- Call_graph sameAs コールグラフ.
- Call_graph sameAs m.0b2m0j.
- Call_graph sameAs Q2589940.
- Call_graph sameAs Q2589940.
- Call_graph sameAs Call_graph.
- Call_graph wasDerivedFrom Call_graph?oldid=594888950.
- Call_graph depiction A_Call_Graph_generated_by_pycallgraph.png.
- Call_graph isPrimaryTopicOf Call_graph.
