Sciweavers

413 search results - page 46 / 83
» An abstract Monte-Carlo method for the analysis of probabili...
Sort
View
CSR
2011
Springer
13 years 6 days ago
Improving the Space-Bounded Version of Muchnik's Conditional Complexity Theorem via "Naive" Derandomization
Abstract. Many theorems about Kolmogorov complexity rely on existence of combinatorial objects with specific properties. Usually the probabilistic method gives such objects with b...
Daniil Musatov
WCRE
1993
IEEE
14 years 24 days ago
A Practical Program Transformation System for Reverse Engineering
Program transformation systems provide one means of formally deriving a program from its speci cation. The main advantage of this development method is that the executable program...
M. Ward, K. Bennett
SAS
2004
Springer
140views Formal Methods» more  SAS 2004»
14 years 2 months ago
Path-Sensitive Analysis for Linear Arithmetic and Uninterpreted Functions
We describe data structures and algorithms for performing a path-sensitive program analysis to discover equivalences of expressions involving linear arithmetic or uninterpreted fun...
Sumit Gulwani, George C. Necula
INFSOF
2010
173views more  INFSOF 2010»
13 years 6 months ago
Filtering false alarms of buffer overflow analysis using SMT solvers
Buffer overflow detection using static analysis can provide a powerful tool for software ers to find difficult bugs in C programs. Sound static analysis based on abstract interpre...
Youil Kim, Jooyong Lee, Hwansoo Han, Kwang-Moo Cho...
ICA
2007
Springer
14 years 2 months ago
Sparse Component Analysis in Presence of Noise Using an Iterative EM-MAP Algorithm
Abstract. In this paper, a new algorithm for source recovery in underdetermined Sparse Component Analysis (SCA) or atomic decomposition on over-complete dictionaries is presented i...
Hadi Zayyani, Massoud Babaie-Zadeh, G. Hosein Mohi...