Sciweavers

590 search results - page 60 / 118
» Non-Failure Analysis for Logic Programs
Sort
View
POPL
2003
ACM
14 years 9 months ago
Discovering affine equalities using random interpretation
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...
Sumit Gulwani, George C. Necula
CORR
2010
Springer
178views Education» more  CORR 2010»
13 years 7 months ago
Towards A Shape Analysis for Graph Transformation Systems
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...
Dominik Steenken, Heike Wehrheim, Daniel Wonisch
FUZZIEEE
2007
IEEE
14 years 3 months ago
FrIDA - A Free Intelligent Data Analysis Toolbox
—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...
Christian Borgelt, Gil Gonzáles-Rodrí...
PVM
2004
Springer
14 years 2 months ago
A Refinement Strategy for a User-Oriented Performance Analysis
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...
Jan Lemeire, Andy Crijns, John Crijns, Erik F. Dir...
IWMM
2007
Springer
116views Hardware» more  IWMM 2007»
14 years 3 months ago
Heap space analysis for java bytecode
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 ...
Elvira Albert, Samir Genaim, Miguel Gómez-Z...