174 search results - page 3 / 35 » Automatic Parallelization with Separation Logic |
CONCUR
2011
Springer
12 years 6 months ago
2011
Springer
Abstract. In 2004, Berdine, Calcagno and O’Hearn introduced a fragment of separation logic that allows for reasoning about programs with pointers and linked lists. They showed th...
POPL
2012
ACM
12 years 2 months ago
2012
ACM
Separation Logic has witnessed tremendous success in recent years in reasoning about programs that deal with heap storage. Its success owes to the fundamental principle that one s...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
To maximize efficiency in time and space, allocations and deallocations, in the exact linear algebra library LinBox, must always occur in the founding scope. This provides a simpl...
CONCUR
2007
Springer
14 years 17 days ago
2007
Springer
Abstract. In the quest for tractable methods for reasoning about concurrent algorithms both rely/guarantee logic and separation logic have made great advances. They both seek to ta...
ECOOP
2009
Springer
14 years 7 months ago
2009
Springer
The dynamic frames approach has proven to be a powerful formalism for specifying and verifying object-oriented programs. However, it requires writing and checking many frame annota...