Sciweavers

1452 search results - page 46 / 291
» Algorithmic Analysis of Array-Accessing Programs
Sort
View
STOC
2003
ACM
164views Algorithms» more  STOC 2003»
14 years 10 months ago
Approximate counting by dynamic programming
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
Martin E. Dyer
APLAS
2008
ACM
13 years 12 months ago
Sound and Complete Type Inference for a Systems Programming Language
This paper introduces a new type system designed for safe systems programming. The type system features a new mutability model that combines unboxed types with a consistent typing ...
Swaroop Sridhar, Jonathan S. Shapiro, Scott F. Smi...
AISS
2010
171views more  AISS 2010»
13 years 5 months ago
An Investigation into Influence Factor of Student Programming Grade Using Association Rule Mining
Computer programming is one of the most essential skills which each graduate has to acquire. However, there are reports that they are unable to write a program well. Researches in...
Mohamad Farhan Mohamad Mohsin, Mohd Helmy Abd Waha...
POPL
2009
ACM
14 years 10 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...
SAS
2007
Springer
103views Formal Methods» more  SAS 2007»
14 years 4 months ago
Footprint Analysis: A Shape Analysis That Discovers Preconditions
Existing shape analysis algorithms infer descriptions of data structures at program points, starting from a given precondition. We describe an analysis that does not require any pr...
Cristiano Calcagno, Dino Distefano, Peter W. O'Hea...