Sciweavers

4469 search results - page 344 / 894
» Dynamic Program Slicing
Sort
View
INFOVIS
2003
IEEE
15 years 7 months ago
Compound Brushing
This paper proposes a conceptual model called compound brushing for modeling the brushing techniques used in dynamic data visualization. In this approach brushing techniques are m...
Hong Chen
103
Voted
SERP
2007
15 years 3 months ago
Runtime Support of Speculative Optimization for Offline Escape Analysis
Escape analysis can improve the speed and memory efficiency of garbage collected languages by allocating objects to the call stack, but an offline analysis will potentially interf...
Kevin Cleereman, Michelle Cheatham, Krishnaprasad ...
144
Voted
DAC
2003
ACM
16 years 3 months ago
Behavioral consistency of C and verilog programs using bounded model checking
We present an algorithm that checks behavioral consistency between an ANSI-C program and a circuit given in Verilog using Bounded Model Checking. Both the circuit and the program ...
Edmund M. Clarke, Daniel Kroening, Karen Yorav
OOPSLA
2004
Springer
15 years 7 months ago
The garbage collection advantage: improving program locality
As improvements in processor speed continue to outpace improvements in cache and memory speed, poor locality increasingly degrades performance. Because copying garbage collectors ...
Xianglong Huang, Stephen M. Blackburn, Kathryn S. ...
PPSN
1994
Springer
15 years 6 months ago
Genetic L-System Programming
We present the Genetic L-System Programming (GLP) paradigm for evolutionary creation and development of parallel rewrite systems (Lsystems, Lindenmayer-systems) which provide a com...
Christian Jacob