Sciweavers

66 search results - page 1 / 14
» Lightweight Separation
Sort
View
TPHOL
2008
IEEE
13 years 10 months ago
Lightweight Separation
Abstract. Lightweight separation is a novel approach to automatic reasoning about memory updates in pointer programs. It replaces the spatial formulae of separation logic, which co...
Holger Gast
CORR
2010
Springer
77views Education» more  CORR 2010»
13 years 2 months ago
LinBox founding scope allocation, parallel building blocks, and separate compilation
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...
Jean-Guillaume Dumas, Thierry Gautier, Clém...
FMCO
2005
Springer
153views Formal Methods» more  FMCO 2005»
13 years 9 months ago
Smallfoot: Modular Automatic Assertion Checking with Separation Logic
Abstract. Separation logic is a program logic for reasoning about programs that manipulate pointer data structures. We describe Smallfoot, a tool for checking certain lightweight s...
Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn
ICCSA
2005
Springer
13 years 9 months ago
Data Protection Based on Physical Separation: Concepts and Application Scenarios
Data protection is an increasingly important issue in today’s communication networks. Traditional solutions for protecting data when transferred over a network are almost exclusi...
Stefan Lindskog, Karl-Johan Grinnemo, Anna Brunstr...
GPCE
2008
Springer
13 years 4 months ago
Lightweight dependent classes
Extensive research efforts have been devoted to implement a group of type-safe mutually recursive classes; recently, proposals for separating each member of the group as a reusabl...
Tetsuo Kamina, Tetsuo Tamai