Sciweavers

180 search results - page 16 / 36
» Precise interprocedural analysis using random interpretation
Sort
View
ACMSE
2007
ACM
15 years 1 months ago
Exploring the duality between skip lists and binary search trees
Although skip lists were introduced as an alternative to balanced binary search trees (BSTs), we show that the skip list can be interpreted as a type of randomly-balanced BST whos...
Brian C. Dean, Zachary H. Jones
82
Voted
BMCBI
2008
95views more  BMCBI 2008»
14 years 9 months ago
Unsupervised reduction of random noise in complex data by a row-specific, sorted principal component-guided method
Background: Large biological data sets, such as expression profiles, benefit from reduction of random noise. Principal component (PC) analysis has been used for this purpose, but ...
Joseph W. Foley, Fumiaki Katagiri
CAV
2007
Springer
114views Hardware» more  CAV 2007»
15 years 1 months ago
Configurable Software Verification: Concretizing the Convergence of Model Checking and Program Analysis
In automatic software verification, we have observed a theoretical convergence of model checking and program analysis. In practice, however, model checkers are still mostly concern...
Dirk Beyer, Thomas A. Henzinger, Grégory Th...
SAS
2004
Springer
103views Formal Methods» more  SAS 2004»
15 years 3 months ago
Information Flow Analysis in Logical Form
Abstract. We specify an information flow analysis for a simple imperative language, using a Hoare-like logic. The logic facilitates static checking of a larger class of programs t...
Torben Amtoft, Anindya Banerjee
72
Voted
JIFS
2002
60views more  JIFS 2002»
14 years 9 months ago
Turing's analysis of computation and artificial neural networks
A novel way to simulate Turing Machines (TMs) by Artificial Neural Networks (ANNs) is proposed. We claim that the proposed simulation is in agreement with the correct interpretatio...
Wilson Rosa de Oliveira, Marcílio Carlos Pe...