Sciweavers

110 search results - page 2 / 22
» Generating Specialized Rules and Programs for Demand-Driven ...
Sort
View
PEPM
1993
ACM
13 years 11 months ago
Binding-Time Analysis and the Taming of C Pointers
The aim of binding-time analysis is to determine when variables, expressions, statements, etc. in a program can be evaluated by classifying these into static (compile-time) and dy...
Lars Ole Andersen
LOPSTR
1994
Springer
13 years 11 months ago
A Transformation System for Definite Programs Based on Termination Analysis
We present a goal replacement rule whose main applicability condition is based on termination properties of the resulting transformed program. The goal replacement rule together wi...
J. Cook, John P. Gallagher
KBSE
2005
IEEE
14 years 1 months ago
An analysis of rule coverage as a criterion in generating minimal test suites for grammar-based software
The term grammar-based software describes software whose input can be specified by a context-free grammar. This grammar may occur explicitly in the software, in the form of an in...
Mark Hennessy, James F. Power
AISS
2010
171views more  AISS 2010»
13 years 2 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...
ASPLOS
2012
ACM
12 years 3 months ago
A case for unlimited watchpoints
Numerous tools have been proposed to help developers fix software errors and inefficiencies. Widely-used techniques such as memory checking suffer from overheads that limit thei...
Joseph L. Greathouse, Hongyi Xin, Yixin Luo, Todd ...