This HTML5 document contains 41 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

Prefix	IRI
dct	http://purl.org/dc/terms/
dbo	http://dbpedia.org/ontology/
foaf	http://xmlns.com/foaf/0.1/
dbt	http://dbpedia.org/resource/Template:
rdfs	http://www.w3.org/2000/01/rdf-schema#
freebase	http://rdf.freebase.com/ns/
rdf	http://www.w3.org/1999/02/22-rdf-syntax-ns#
owl	http://www.w3.org/2002/07/owl#
n11	http://en.wikipedia.org/wiki/
dbp	http://dbpedia.org/property/
dbc	http://dbpedia.org/resource/Category:
prov	http://www.w3.org/ns/prov#
xsdh	http://www.w3.org/2001/XMLSchema#
dbr	http://dbpedia.org/resource/

Statements

Subject Item

dbr:Escape_analysis

rdfs:label

Escape analysis

rdfs:comment

In compiler optimization, escape analysis is a method for determining the dynamic scope of pointers – where in the program a pointer can be accessed. It is related to pointer analysis and shape analysis. If a subroutine allocates an object and returns a pointer to it, the object can be accessed from undetermined places in the program – the pointer has "escaped". Pointers can also escape if they are stored in global variables or other data structures that, in turn, escape the current procedure.

owl:sameAs

freebase:m.0cwgkt

dbp:wikiPageUsesTemplate

dbt:Compiler_optimizations dbt:Unreferenced_section dbt:Refimprove dbt:Snd

dct:subject

dbc:Static_program_analysis dbc:Articles_with_example_Java_code

prov:wasDerivedFrom

n11:Escape_analysis?oldid=1073607766&ns=0

dbo:wikiPageID

4945443

dbo:wikiPageLength

7967

dbo:wikiPageRevisionID

1073607766

dbo:wikiPageWikiLink

dbr:Object-oriented_programming dbr:Continuation dbc:Articles_with_example_Java_code dbr:Just-in-time_compilation dbr:Shape_analysis_(program_analysis) dbr:Subroutine dbr:OpenJ9 dbr:Functional_programming dbr:Pointer_analysis dbr:Call_stack dbr:Dynamic_compilation dbr:Tail_call dbr:Alias_analysis dbr:Standard_ML_of_New_Jersey dbr:Thread_(computing) dbr:Pointer_(computer_programming) dbr:Java_(programming_language) dbr:Stack-based_memory_allocation dbc:Static_program_analysis dbr:Static_library dbr:Method_overriding dbr:Java_performance dbr:HotSpot_(virtual_machine) dbr:Memory_management dbr:Optimizing_compiler dbr:Scheme_(programming_language)

dbo:abstract

In compiler optimization, escape analysis is a method for determining the dynamic scope of pointers – where in the program a pointer can be accessed. It is related to pointer analysis and shape analysis. When a variable (or an object) is allocated in a subroutine, a pointer to the variable can escape to other threads of execution, or to calling subroutines. If an implementation uses tail call optimization (usually required for functional languages), objects may also be seen as escaping to called subroutines. If a language supports first-class continuations (as do Scheme and Standard ML of New Jersey), portions of the call stack may also escape. If a subroutine allocates an object and returns a pointer to it, the object can be accessed from undetermined places in the program – the pointer has "escaped". Pointers can also escape if they are stored in global variables or other data structures that, in turn, escape the current procedure. Escape analysis determines all the places where a pointer can be stored and whether the lifetime of the pointer can be proven to be restricted only to the current procedure and/or thread.

foaf:isPrimaryTopicOf

n11:Escape_analysis