Sciweavers

1016 search results - page 26 / 204
» Automatic Analysis of Programming Assignments
Sort
View
POPL
2005
ACM
14 years 7 months ago
From sequential programs to multi-tier applications by program transformation
Modern applications are designed in multiple tiers to separate concerns. Since each tier may run at a separate location, middleware is required to mediate access between tiers. Ho...
Matthias Neubauer, Peter Thiemann
ICS
2007
Tsinghua U.
14 years 1 months ago
Sensitivity analysis for automatic parallelization on multi-cores
Sensitivity Analysis (SA) is a novel compiler technique that complements, and integrates with, static automatic parallelization analysis for the cases when relevant program behavi...
Silvius Rus, Maikel Pennings, Lawrence Rauchwerger
WCET
2008
13 years 8 months ago
Computing time as a program variable: a way around infeasible paths
Conditional branches connect the values of program variables with the execution paths and thus with the execution times, including the worstcase execution time (WCET). Flow analys...
Niklas Holsti
IWMM
2009
Springer
122views Hardware» more  IWMM 2009»
14 years 1 months ago
Parametric heap usage analysis for functional programs
This paper presents an analysis that derives a formula describing the worst-case live heap space usage of programs in a functional language with automated memory management (garba...
Leena Unnikrishnan, Scott D. Stoller
ICLP
2005
Springer
14 years 27 days ago
Polynomial Interpretations as a Basis for Termination Analysis of Logic Programs
Our goal is to study the feasibility of porting termination analysis techniques developed for one programming paradigm to another paradigm. In this paper, we show how to adapt ter...
Manh Thang Nguyen, Danny De Schreye