Sciweavers

1016 search results - page 53 / 204
» Automatic Analysis of Programming Assignments
Sort
View
SAC
2008
ACM
15 years 9 days ago
Flexible pointer analysis using assign-fetch graphs
se a new abstraction for pointer analysis that represents reads and writes to memory instead of traditional points-to relations. Compared to points-to graphs, our Assign-Fetch Gra...
Marcio Buss, Daniel Brand, Vugranam C. Sreedhar, S...
105
Voted
CORR
2010
Springer
127views Education» more  CORR 2010»
14 years 7 months ago
Complexity of Data Dependence problems for Program Schemas with Concurrency
am analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of te...
Sebastian Danicic, Robert M. Hierons, Michael R. L...
181
Voted
POPL
2009
ACM
16 years 1 months ago
Static contract checking for Haskell
Program errors are hard to detect and are costly both to programmers who spend significant efforts in debugging, and for systems that are guarded by runtime checks. Static verific...
Dana N. Xu, Simon L. Peyton Jones, Koen Claessen
CP
2003
Springer
15 years 6 months ago
Semi-automatic Modeling by Constraint Acquisition
Constraint programming is a technology which is now widely used to solve combinatorial problems in industrial applications. However, using it requires considerable knowledge and e...
Remi Coletta, Christian Bessière, Barry O'S...
CVPR
2010
IEEE
15 years 3 months ago
Co-clustering of Image Segments Using Convex Optimization Applied to EM Neuronal Reconstruction
This paper addresses the problem of jointly clustering two segmentations of closely correlated images. We focus in particular on the application of reconstructing neuronal structu...
Shiv Vitaladevuni, Ronen Basri