3362 search results - page 523 / 673 » A definition of subjective possibility |
292
click to vote
POPL
2008
ACM
16 years 6 months ago
2008
ACM
Relevance heuristics allow us to tailor a program analysis to a particular property to be verified. This in turn makes it possible to improve the precision of the analysis where n...
296
click to vote
POPL
2008
ACM
16 years 6 months ago
2008
ACM
We present a framework for generating procedure summaries that are precise -- applying the summary in a given context yields the same result as re-analyzing the procedure in that ...
275
click to vote
POPL
2006
ACM
16 years 6 months ago
2006
ACM
We describe a novel method for verifying programs that manipulate linked lists, based on two new predicates that characterize reachability of heap cells. These predicates allow re...
288
click to vote
POPL
2005
ACM
16 years 6 months ago
2005
ACM
We introduce transactors, a fault-tolerant programming model for composing loosely-coupled distributed components running in an unreliable environment such as the internet into sy...
307
click to vote
POPL
2003
ACM
16 years 6 months ago
2003
ACM
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...