Sciweavers

76 search results - page 5 / 16
» Redundancy in Instruction Sequences of Computer Programs
Sort
View
RTCSA
2000
IEEE
13 years 12 months ago
Extracting safe and precise control flow from binaries
As a starting point for static program analysis a control flow graph (CFG) is needed. If only the binary executable is available, this CFG has to be reconstructed from sequences ...
Henrik Theiling
ICPP
1999
IEEE
13 years 11 months ago
Trace-Level Reuse
Trace-level reuse is based on the observation that some traces (dynamic sequences of instructions) are frequently repeated during the execution of a program, and in many cases, th...
Antonio González, Jordi Tubella, Carlos Mol...
BMCBI
2010
151views more  BMCBI 2010»
13 years 7 months ago
Classification of G-protein coupled receptors based on support vector machine with maximum relevance minimum redundancy and gene
Background: Because a priori knowledge about function of G protein-coupled receptors (GPCRs) can provide useful information to pharmaceutical research, the determination of their ...
Zhanchao Li, Xuan Zhou, Zong Dai, Xiaoyong Zou
CORR
2008
Springer
77views Education» more  CORR 2008»
13 years 7 months ago
Programming an interpreter using molecular dynamics
PGA (ProGram Algebra) is an algebra of programs which concerns programs in their simplest form: sequences of instructions. Molecular dynamics is a simple model of computation deve...
Jan A. Bergstra, C. A. Middelburg
AAAI
2008
13 years 9 months ago
Learning to Analyze Binary Computer Code
We present a novel application of structured classification: identifying function entry points (FEPs, the starting byte of each function) in program binaries. Such identification ...
Nathan E. Rosenblum, Xiaojin Zhu, Barton P. Miller...