590 search results - page 60 / 118 » Non-Failure Analysis for Logic Programs |
259
click to vote
POPL
2003
ACM
16 years 4 months ago
2003
ACM
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
189
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Graphs and graph transformation systems are a frequently used modelling technique for a wide range of different domains, covering areas as diverse as refactorings, network topolog...
105
Voted
FUZZIEEE
2007
IEEE
15 years 10 months ago
2007
IEEE
—This paper describes a Java-based graphical user interface to a large number of data analysis programs the first author has written in C over the years. In addition, this toolb...
112
click to vote
PVM
2004
Springer
15 years 9 months ago
2004
Springer
We introduce a refinement strategy to bring the parallel performance analysis closer to the user. The analysis starts with a simple high-level performance model. It is based on fir...
123
Voted
IWMM
2007
Springer
15 years 10 months ago
2007
Springer
This article presents a heap space analysis for (sequential) Java bytecode. The analysis generates heap space cost relations which define at compile-time the heap consumption of ...