1594 search results - page 143 / 319 » Visualizing Program Executions on Large Data Sets |
170
click to vote
SPIN
2000
Springer
15 years 10 months ago
2000
Springer
This paper describes how two runtime analysis algorithms, an existing data race detection algorithm and a new deadlock detection algorithm, have been implemented to analyze Java pr...
173
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
The aim of process mining is to identify and extract process patterns from data logs to reconstruct an overall process flowchart. As business processes become more and more comple...
161
click to vote
ICLP
2007
Springer
15 years 10 months ago
2007
Springer
We present a static analysis that infers both upper and lower bounds on the usage that a logic program makes of a set of user-definable resources. The inferred bounds will in gener...
154
click to vote
VL
2003
IEEE
15 years 11 months ago
2003
IEEE
One of the reputed advantages of end-user programming languages is that they support a given problem doh a set of programming abstractions that are “just right” for the end-us...
185
click to vote
SIGMOD
2012
ACM
13 years 8 months ago
2012
ACM
A relational database often yields a large set of tuples as the result of a query. Users browse this result set to find the information they require. If the result set is large, ...