88 search results - page 8 / 18 » Reasoning about the unknown in static analysis |
101
click to vote
SAS
2009
Springer
16 years 2 months ago
2009
Springer
Abstract. The capability calculus is a framework for statically reasoning about program resources such as deallocatable memory regions. Fractional capabilities, originally proposed...
KBSE
2007
IEEE
15 years 8 months ago
2007
IEEE
A number of researchers have proposed the use of Boolean satisfiability solvers for verifying C programs. They encode correctness checks as Boolean formulas using finitization: ...
114
click to vote
SIGSOFT
1994
ACM
15 years 6 months ago
1994
ACM
In this paper we present an approach, based on data ow analysis, that can provide cost-e ective analysis of concurrent programs with respect to explicitly stated correctness prope...
104
Voted
CC
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. To reason about programs, dynamic optimizers and analysis tools use sampling to collect a dynamic call graph (DCG). However, sampling has not achieved high accuracy with ...
98
Voted
SAC
2008
ACM
15 years 1 months ago
2008
ACM
se a new abstraction for pointer analysis that represents reads and writes to memory instead of traditional points-to relations. Compared to points-to graphs, our Assign-Fetch Gra...