Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Trace tree

Known as: Trace trees 
A trace tree is a data structure that is used in the runtime compilation of programming code. Trace trees are used in a type of 'just in time… Expand
Wikipedia

Related topics

Related topics

1 relation
Data structure

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Optimizing Heuristics for Tableau-based OWL Reasoners
Optimization techniques play a significant role in improving description logic reasoners covering the Web Ontology Language (OWL… Expand
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
2015
2015
On tree amplitudes of supersymmetric Einstein-Yang-Mills theory
A bstractWe present a new formula for all single trace tree amplitudes in four dimensional super Yang-Mills coupled to Einstein… Expand
2010
2010
Passive IP traceback
IP traceback can be used to find the origin of anonymous traffic; however, Internet-scale IP traceback systems have not been… Expand
2010
2010
T Trunk 
 Trace Anchor Guard Branch 
 Trace Guard Side 
 Exit
Trace based compilation is a technique used in managed language runtimes to detect and compile frequently executed program paths… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
2009
2009
Compact Trace Trees in Dynamic Binary Translators
Trace Tree (TT) is a technique to collect program execution traces, which is commonly used in JIT environments. Its main features… Expand
  • figure 3
  • table 3
  • table 1
  • table 2
  • figure 4
2009
2009
Phase detection using trace compilation
Dynamic compilers can optimize application code specifically for observed code behavior. Such behavior does not have to be stable… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
2007
2007
An EFSM-Based Passive Fault Detection Approach
Extended Finite State Machine (EFSM)-based passive fault detection involves modeling the system under test (SUT) as an EFSM M… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
2007
2007
Making the Compilation “ Pipeline ” Explicit : Dynamic Compilation Using Trace Tree Serialization
Trace-based compilers operate by dynamically discovering loop headers and then recording and compiling all paths through a loop… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 6
2006
2006
Incremental Dynamic Code Generation with Trace Trees
The unit of compilation for traditional just-in-time compilers is the method. We have explored trace-based compilation, in which… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
2000
2000
New Missing Solution Method for Trace Trees
Shapiro developed an algorithm to diagnose the error in PROLOG programs where output is missing. The original algorithm can… Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE