Sciweavers

1461 search results - page 126 / 293
» Analysis of Constraint Logic Programs
Sort
View
POPL
2009
ACM
16 years 2 months ago
Compositional shape analysis by means of bi-abduction
This paper describes a compositional shape analysis, where each procedure is analyzed independently of its callers. The analysis uses an abstract domain based on a restricted frag...
Cristiano Calcagno, Dino Distefano, Peter W. O'Hea...
PLDI
2004
ACM
15 years 7 months ago
Cloning-based context-sensitive pointer alias analysis using binary decision diagrams
This paper presents the first scalable context-sensitive, inclusionbased pointer alias analysis for Java programs. Our approach to context sensitivity is to create a clone of a m...
John Whaley, Monica S. Lam
SIGSOFT
2010
ACM
14 years 11 months ago
An effective dynamic analysis for detecting generalized deadlocks
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...
Pallavi Joshi, Mayur Naik, Koushik Sen, David Gay
SAIG
2000
Springer
15 years 5 months ago
Generating Data Analysis Programs from Statistical Models
Extracting information from data, often also called data analysis, is an important scienti c task. Statistical approaches, which use methods from probability theory and numerical a...
Bernd Fischer 0002, Johann Schumann, Thomas Pressb...
AAAI
2008
15 years 3 months ago
Credulous Resolution for Answer Set Programming
The paper presents a calculus based on resolution for credulous reasoning in Answer Set Programming. The new approach allows a top-down and goal directed resolution, in the same s...
Piero A. Bonatti, Enrico Pontelli, Tran Cao Son