Sciweavers

707 search results - page 24 / 142
» Some Comments on the Coding of Programs
Sort
View
CGO
2010
IEEE
15 years 4 months ago
Level by level: making flow- and context-sensitive pointer analysis scalable for millions of lines of code
We present a practical and scalable method for flow- and contextsensitive (FSCS) pointer analysis for C programs. Our method analyzes the pointers in a program level by level in ...
Hongtao Yu, Jingling Xue, Wei Huo, Xiaobing Feng 0...
GECCO
2008
Springer
126views Optimization» more  GECCO 2008»
14 years 10 months ago
The impact of population size on code growth in GP: analysis and empirical validation
The crossover bias theory for bloat [18] is a recent result which predicts that bloat is caused by the sampling of short, unfit programs. This theory is clear and simple, but it ...
Riccardo Poli, Nicholas Freitag McPhee, Leonardo V...
DFT
1999
IEEE
139views VLSI» more  DFT 1999»
15 years 1 months ago
Soft-Error Detection through Software Fault-Tolerance Techniques
The paper describes a systematic approach for automatically introducing data and code redundancy into an existing program written using a high-level language. The transformations ...
Maurizio Rebaudengo, Matteo Sonza Reorda, Marco To...

Book
278views
16 years 5 months ago
Servlet Essentials
"This document explains the concepts of Java Servlets and provides a step-by-step tutorial for writing HTTP Servlets with complete source code for the example Servlets. The tu...
Stefan Zeiger
TIT
2002
78views more  TIT 2002»
14 years 9 months ago
Improved upper bounds on sizes of codes
Let ( ) denote the maximum possible number of codewords in a binary code of length and minimum Hamming distance . For large values of , the best known upper bound, for fixed , is t...
Beniamin Mounits, Tuvi Etzion, Simon Litsyn