Sciweavers

1016 search results - page 98 / 204
» Automatic Analysis of Programming Assignments
Sort
View
122
Voted
BMCBI
2005
120views more  BMCBI 2005»
15 years 3 months ago
Harshlight: a "corrective make-up" program for microarray chips
Background: Microscopists are familiar with many blemishes that fluorescence images can have due to dust and debris, glass flaws, uneven distribution of fluids or surface coatings...
Mayte Suárez-Fariñas, Maurizio Pelle...
122
Voted
PPDP
2009
Springer
15 years 10 months ago
Model-checking higher-order functions
We propose a novel type-based model checking algorithm for higher-order recursion schemes. As shown by Kobayashi, verification problems of higher-order functional programs can ea...
Naoki Kobayashi
232
Voted
POPL
2003
ACM
16 years 3 months ago
Bitwidth aware global register allocation
Multimedia and network processing applications make extensive use of subword data. Since registers are capable of holding a full data word, when a subword variable is assigned a r...
Sriraman Tallam, Rajiv Gupta
141
Voted
TSE
2010
148views more  TSE 2010»
15 years 1 months ago
Program Behavior Discovery and Verification: A Graph Grammar Approach
—Discovering program behaviors and functionalities can ease program comprehension and verification. Existing program analysis approaches have used text mining algorithms to infer...
Chunying Zhao, Jun Kong, Kang Zhang
122
Voted
ADAEUROPE
2004
Springer
15 years 9 months ago
On the Tree Width of Ada Programs
The tree width of a graph G measures how close G is to being a tree or a series-parallel graph. Many well-known problems that are otherwise NP-complete can be solved efficiently if...
Bernd Burgstaller, Johann Blieberger, Bernhard Sch...