336 search results - page 14 / 68 » Relevance heuristics for program analysis |
SIGSOFT
2008
ACM
15 years 10 months ago
2008
ACM
Many testing and analysis techniques have been developed for inhouse use. Although they are effective at discovering defects before a program is deployed, these techniques are oft...
116
click to vote
SAS
1992
Springer
15 years 1 months ago
1992
Springer
Abstract Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar model-theoretic, fixpoint and operational semantics [9]. Sinc...
109
click to vote
EUROPAR
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. Today’s parallel computers with SMP nodes provide both multithreading and message passing as their modes of parallel execution. As a consequence, performance analysis a...
95
Voted
ICLP
1997
Springer
15 years 1 months ago
1997
Springer
Abstract This paper describes a general framework for automatic termination analysis of logic programs, where we understand by termination" the niteness of the LD-tree constru...
117
click to vote
SIGSOFT
2010
ACM
14 years 7 months ago
2010
ACM
We present an effective dynamic analysis for finding a broad class of deadlocks, including the well-studied lock-only deadlocks as well as the less-studied, but no less widespread...