277 search results - page 14 / 56 » Precise reasoning for programs using containers |
157
Voted
CC
2005
Springer
15 years 11 months ago
2005
Springer
We introduce a new approach, called completeness analysis, to computing points-to sets for incomplete Java programs such as library modules or applications in the presence of dynam...
168
click to vote
ICLP
1995
Springer
15 years 9 months ago
1995
Springer
The semantics of constraint logic programming languages with coroutining facilities (\freeze," suspension, residuation, etc.) cannot be fully declarative; thus, an operationa...
132
click to vote
SAC
2008
ACM
15 years 5 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...
164
click to vote
LICS
2006
IEEE
15 years 12 months ago
2006
IEEE
Hoare logic is bedevilled by complex but coarse side conditions on the use of variables. We define a logic, free of side conditions, which permits more precise statements of a pr...
172
click to vote
TCS
2008
15 years 5 months ago
2008
Type systems and program logics are often conceived to be at opposing ends of the spectrum of formal software analyses. In this paper we show that a flow-sensitive type system ensu...