Sciweavers

661 search results - page 42 / 133
» What Can We Expect from Program Verification
Sort
View
POPL
2003
ACM
14 years 9 months ago
Discovering affine equalities using random interpretation
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
Sumit Gulwani, George C. Necula
SIGMETRICS
1999
ACM
14 years 29 days ago
Availability and Utility of Idle Memory in Workstation Clusters
In this paper, we examine the availability and utility of idle memory in workstation clusters. We attempt to answer the following questions. First, how much of the total memory in...
Anurag Acharya, Sanjeev Setia
ACISICIS
2007
IEEE
14 years 3 months ago
Slicing Aided Design of Obfuscating Transforms
Abstract—An obfuscation aims to transform a program, without affecting its functionality, so that some secret information within the program can be hidden for as long as possible...
Stephen Drape, Anirban Majumdar, Clark D. Thombors...
FMICS
2010
Springer
13 years 8 months ago
Correctness of Sensor Network Applications by Software Bounded Model Checking
We investigate the application of the software bounded model checking tool CBMC to the domain of wireless sensor networks (WSNs). We automatically generate a software behavior mode...
Frank Werner, David Faragó
LION
2010
Springer
209views Optimization» more  LION 2010»
14 years 1 months ago
Feature Extraction from Optimization Data via DataModeler's Ensemble Symbolic Regression
We demonstrate a means of knowledge discovery through feature extraction that exploits the search history of an optimization run. We regress a symbolic model ensemble from optimiza...
Kalyan Veeramachaneni, Katya Vladislavleva, Una-Ma...