Sciweavers

71 search results - page 8 / 15
» Parameterized Memory Models and Concurrent Separation Logic
Sort
View
SP
2009
IEEE
155views Security Privacy» more  SP 2009»
14 years 2 months ago
A Logic of Secure Systems and its Application to Trusted Computing
We present a logic for reasoning about properties of secure systems. The logic is built around a concurrent programming language with constructs for modeling machines with shared ...
Anupam Datta, Jason Franklin, Deepak Garg, Dilsun ...
TLDI
2003
ACM
14 years 26 days ago
The logical approach to stack typing
We develop a logic for reasoning about adjacency and separation of memory blocks, as well as aliasing of pointers. We provide a memory model for our logic and present a sound set ...
Amal J. Ahmed, David Walker
ICTAC
2010
Springer
13 years 5 months ago
Mechanized Verification with Sharing
We consider software verification of imperative programs by theorem proving in higher-order separation logic. Of particular interest are the difficulties of encoding and reasoning ...
J. Gregory Malecha, Greg Morrisett
VEE
2010
ACM
218views Virtualization» more  VEE 2010»
14 years 2 months ago
Improving compiler-runtime separation with XIR
Intense research on virtual machines has highlighted the need for flexible software architectures that allow quick evaluation of new design and implementation techniques. The inte...
Ben Titzer, Thomas Würthinger, Doug Simon, Ma...
POPL
2009
ACM
14 years 8 months ago
Relaxed memory models: an operational approach
Memory models define an interface between programs written in some language and their implementation, determining which behaviour the memory (and thus a program) is allowed to hav...
Gérard Boudol, Gustavo Petri