Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,455,452 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
1 relation
Data structure
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
A Language-based Serverless Function Accelerator
Emily A. Herbert
,
Arjun Guha
arXiv.org
2019
Corpus ID: 207820717
Serverless computing is an approach to cloud computing that allows programmers to run serverless functions in response to short…
Expand
2014
2014
A Multi-objective Framework for Characterization of Software Specifications
Muhammad Rashid
,
B. Pottier
2014
Corpus ID: 57473327
The complexity of embedded systems is exploding into two interrelated but independently growing directions: architecture…
Expand
2010
2010
T Trunk Trace Anchor Guard Branch Trace Guard Side Exit
Michael Bebenita
,
Mason Chang
,
+6 authors
M. Franz
2010
Corpus ID: 14602316
Trace based compilation is a technique used in managed language runtimes to detect and compile frequently executed program paths…
Expand
2010
2010
Passive IP traceback: capturing the origin of anonymous traffic through network telescopes
Guang Yao
,
J. Bi
,
Zijian Zhou
Conference on Applications, Technologies…
2010
Corpus ID: 17898589
IP traceback can be used to find the origin of anonymous traffic; however, Internet-scale IP traceback systems have not been…
Expand
2010
2010
Detection of Transactional Memory anomalies using static analysis
Bruno C. Teixeira
,
João M. Lourenço
,
E. Farchi
,
Ricardo J. Dias
,
Diogo Sousa
Parallel and Distributed Systems: Testing…
2010
Corpus ID: 4442177
Transactional Memory allows programmers to reduce the number of synchronization errors introduced in concurrent programs, but…
Expand
2009
2009
Phase detection using trace compilation
Christian Wimmer
,
M. Cintra
,
Michael Bebenita
,
Mason Chang
,
A. Gal
,
M. Franz
Principles and Practice of Programming in Java
2009
Corpus ID: 18529034
Dynamic compilers can optimize application code specifically for observed code behavior. Such behavior does not have to be stable…
Expand
2009
2009
Compact Trace Trees in Dynamic Binary Translators
João Paulo Porto
,
G. Araújo
,
Youfeng Wu
,
E. Borin
,
Cheng Wang
2009
Corpus ID: 5743414
Trace Tree (TT) is a technique to collect program execution traces, which is commonly used in JIT environments. Its main features…
Expand
2007
2007
An EFSM-Based Passive Fault Detection Approach
H. Ural
,
Zhi Xu
TestCom/FATES
2007
Corpus ID: 5884394
Extended Finite State Machine (EFSM)-based passive fault detection involves modeling the system under test (SUT) as an EFSM M…
Expand
2006
2006
Incremental Dynamic Code Generation with Trace Trees
A. Gal
,
M. Franz
2006
Corpus ID: 9352256
The unit of compilation for traditional just-in-time compilers is the method. We have explored trace-based compilation, in which…
Expand
2000
2000
New Missing Solution Method for Trace Trees
G. Kókai
Workshop Logische Programmierung
2000
Corpus ID: 31989545
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
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE
or Only Accept Required