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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2014

The complexity of embedded systems is exploding into two interrelated but independently growing directions: architecture…

2014

Query is a functional language for querying XML data. In network environment, queries are generated dynamically and executed in…

2012

Total program correctness includes partial program correctness and program termination. These two subproblems are undecidable for…

2010

Trace based compilation is a technique used in managed language runtimes to detect and compile frequently executed program paths…

2010

IP traceback can be used to find the origin of anonymous traffic; however, Internet-scale IP traceback systems have not been…

2010

Transactional Memory allows programmers to reduce the number of synchronization errors introduced in concurrent programs, but…

2009

Dynamic compilers can optimize application code specifically for observed code behavior. Such behavior does not have to be stable…

2009

Trace Tree (TT) is a technique to collect program execution traces, which is commonly used in JIT environments. Its main features…

2006

The unit of compilation for traditional just-in-time compilers is the method. We have explored trace-based compilation, in which…

2000

Shapiro developed an algorithm to diagnose the error in PROLOG programs where output is missing. The original algorithm can…