146 search results - page 24 / 30 » Local Reasoning about Programs that Alter Data Structures |
82
Voted
POPL
2010
ACM
15 years 7 months ago
2010
ACM
The automated inference of quantified invariants is considered one of the next challenges in software verification. The question of the right precision-efficiency tradeoff for the...
184
Voted
POPL
2009
ACM
15 years 10 months ago
2009
ACM
This work develops an integrated approach to the verification of behaviourally rich programs, founded directly on operational semantics. The power of the approach is demonstrated ...
167
click to vote
POPL
2006
ACM
15 years 10 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...
PPOPP
2012
ACM
13 years 5 months ago
2012
ACM
The virtues of deterministic parallelism have been argued for decades and many forms of deterministic parallelism have been described and analyzed. Here we are concerned with one ...
101
click to vote
ESANN
2004
14 years 11 months ago
2004
When we talk about using neural networks for data mining we have in mind the original data mining scope and challenge. How did neural networks meet this challenge? Can we run neura...