146 search results - page 24 / 30 » Local Reasoning about Programs that Alter Data Structures |
145
Voted
POPL
2010
ACM
16 years 2 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...
283
Voted
POPL
2009
ACM
16 years 5 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 ...
251
Voted
POPL
2006
ACM
16 years 5 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...
156
click to vote
PPOPP
2012
ACM
14 years 25 days 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 ...
163
Voted
ESANN
2004
15 years 6 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...