Sciweavers

1016 search results - page 33 / 204
» Automatic Analysis of Programming Assignments
Sort
View
POPL
2006
ACM
14 years 7 months ago
Modular set-based analysis from contracts
In PLT Scheme, programs consist of modules with contracts. The latter describe the inputs and outputs of functions and objects via predicates. A run-time system enforces these pre...
Philippe Meunier, Robert Bruce Findler, Matthias F...
PPOPP
1999
ACM
13 years 11 months ago
Automatic Parallelization of Divide and Conquer Algorithms
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...
Radu Rugina, Martin C. Rinard
SIGIR
2009
ACM
14 years 1 months ago
Automatic video tagging using content redundancy
The analysis of the leading social video sharing platform YouTube reveals a high amount of redundancy, in the form of videos with overlapping or duplicated content. In this paper,...
Stefan Siersdorfer, José San Pedro, Mark Sa...
ASAP
1996
IEEE
90views Hardware» more  ASAP 1996»
13 years 11 months ago
Hierarchical Static Analysis Of Structured Systems Of Affine Recurrence Equations
The Alpha language, based on systems of affine recurrence equations over polyhedral domains, allows the expression of complex algorithms as hierarchical, parameterized structures ...
Florent de Dinechin, Sophie Robert
ADAEUROPE
2003
Springer
13 years 11 months ago
Quasar: A New Tool for Concurrent Ada Programs Analysis
Concurrency introduces a high degree of combinatory which may be the source of subtle mistakes. We present a new tool, Quasar, which is based on ASIS and which uses fully the conce...
Sami Evangelista, Claude Kaiser, Jean-Franç...