Sciweavers

681 search results - page 50 / 137
» Superblock formation using static program analysis
Sort
View
TACAS
2007
Springer
125views Algorithms» more  TACAS 2007»
14 years 3 months ago
Type-Dependence Analysis and Program Transformation for Symbolic Execution
Symbolic execution can be problematic when applied to real applications. This paper addresses two of these problems: (1) the constraints generated during symbolic execution may be ...
Saswat Anand, Alessandro Orso, Mary Jean Harrold
ICLP
2007
Springer
14 years 28 days ago
User-Definable Resource Bounds Analysis for Logic Programs
We present a static analysis that infers both upper and lower bounds on the usage that a logic program makes of a set of user-definable resources. The inferred bounds will in gener...
Jorge Navas, Edison Mera, Pedro López-Garc&...
PLDI
2012
ACM
11 years 11 months ago
Automated error diagnosis using abductive inference
When program verification tools fail to verify a program, either the program is buggy or the report is a false alarm. In this situation, the burden is on the user to manually cla...
Isil Dillig, Thomas Dillig, Alex Aiken
ACSC
2009
IEEE
14 years 3 months ago
Evaluating the dynamic behaviour of Python applications
The Python programming language is typical among dynamic languages in that programs written in it are not susceptible to static analysis. This makes efficient static program compi...
Alex Holkner, James Harland
IPPS
2008
IEEE
14 years 3 months ago
Supporting high performance bioinformatics flat-file data processing using indices
As an essential part of in vitro analysis, biological database query has become more and more important in the research process. A few challenges that are specific to bioinformat...
Xuan Zhang, Gagan Agrawal