Sciweavers

2947 search results - page 391 / 590
» Analyzing Program Analyses
Sort
View
137
Voted
KDD
2007
ACM
151views Data Mining» more  KDD 2007»
16 years 3 months ago
Efficient mining of iterative patterns for software specification discovery
Studies have shown that program comprehension takes up to 45% of software development costs. Such high costs are caused by the lack-of documented specification and further aggrava...
Chao Liu 0001, David Lo, Siau-Cheng Khoo
233
Voted
POPL
2008
ACM
16 years 2 months ago
Relational inductive shape analysis
alyses are concerned with precise abstractions of the heap to capture detailed structural properties. To do so, they need to build and decompose summaries of disjoint memory regio...
Bor-Yuh Evan Chang, Xavier Rival
116
Voted
POPL
2010
ACM
15 years 9 months ago
Compress-and-conquer for optimal multicore computing
We propose a programming paradigm called compress-and-conquer (CC) that leads to optimal performance on multicore platforms. Given a multicore system of p cores and a problem of s...
Zhijing G. Mou, Hai Liu, Paul Hudak
132
Voted
PLDI
2009
ACM
15 years 9 months ago
Snugglebug: a powerful approach to weakest preconditions
Symbolic analysis shows promise as a foundation for bug-finding, specification inference, verification, and test generation. This paper addresses demand-driven symbolic analysi...
Satish Chandra, Stephen J. Fink, Manu Sridharan
133
Voted
IISWC
2009
IEEE
15 years 9 months ago
On the (dis)similarity of transactional memory workloads
— Programming to exploit the resources in a multicore system remains a major obstacle for both computer and software engineers. Transactional memory offers an attractive alternat...
Clay Hughes, James Poe, Amer Qouneh, Tao Li