Sciweavers

824 search results - page 6 / 165
» Constructing Functional Programs for Grammar Analysis Proble...
Sort
View
TAPSOFT
1997
Springer
13 years 11 months ago
On the Complexity of Function Pointer May-Alias Analysis
This paper considers the complexity of interprocedural function pointer may-alias analysis, i.e., determining the set of functions that a function pointer (in a language such as C...
Robert Muth, Saumya K. Debray
LCPC
1999
Springer
13 years 11 months ago
An Empirical Study of Function Pointers Using SPEC Benchmarks
Since the C language imposes little restriction on the use of function pointers, the task of call graph construction for a C program is far more di cult than what the algorithms d...
Ben-Chung Cheng, Wen-mei W. Hwu
ESOP
2007
Springer
14 years 1 months ago
Computing Procedure Summaries for Interprocedural Analysis
Abstract. We describe a new technique for computing procedure summaries for performing an interprocedural analysis on programs. Procedure summaries are computed by performing a bac...
Sumit Gulwani, Ashish Tiwari
BMCBI
2004
133views more  BMCBI 2004»
13 years 7 months ago
Evaluation of several lightweight stochastic context-free grammars for RNA secondary structure prediction
Background: RNA secondary structure prediction methods based on probabilistic modeling can be developed using stochastic context-free grammars (SCFGs). Such methods can readily co...
Robin D. Dowell, Sean R. Eddy
CEC
2010
IEEE
13 years 8 months ago
Evolving programs with parameters and loops
At the current state of the art, genetic programs do not contain two constructs that commonly occur in programs written by humans, that is, loops and functions with parameters. In ...
Gayan Wijesinghe, Victor Ciesielski