Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Optimization techniques play a significant role in improving description logic reasoners covering the Web Ontology Language (OWL… 
2010
2010
IP traceback can be used to find the origin of anonymous traffic; however, Internet-scale IP traceback systems have not been… 
2010
2010
Trace based compilation is a technique used in managed language runtimes to detect and compile frequently executed program paths… 
2009
2009
Trace Tree (TT) is a technique to collect program execution traces, which is commonly used in JIT environments. Its main features… 
2009
2009
Dynamic compilers can optimize application code specifically for observed code behavior. Such behavior does not have to be stable… 
2007
2007
Extended Finite State Machine (EFSM)-based passive fault detection involves modeling the system under test (SUT) as an EFSM M… 
2007
2007
2006
2006
The unit of compilation for traditional just-in-time compilers is the method. We have explored trace-based compilation, in which… 
2001
2001
Compositional proofs about systems of many components require circular reasoning principles in which properties of other… 
2000
2000
Shapiro developed an algorithm to diagnose the error in PROLOG programs where output is missing. The original algorithm can…