Sciweavers

146 search results - page 3 / 30
» Local Reasoning about Programs that Alter Data Structures
Sort
View
ICTAC
2010
Springer
13 years 4 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
VMCAI
2010
Springer
14 years 3 months ago
Temporal Reasoning for Procedural Programs
While temporal verification of programs is a topic with a long history, its traditional basis--semantics based on word languages--is illsuited for modular reasoning about procedura...
Rajeev Alur, Swarat Chaudhuri
LICS
2002
IEEE
13 years 11 months ago
Separation Logic: A Logic for Shared Mutable Data Structures
In joint work with Peter O’Hearn and others, based on early ideas of Burstall, we have developed an extension of Hoare logic that permits reasoning about low-level imperative pr...
John C. Reynolds
CANS
2006
Springer
136views Cryptology» more  CANS 2006»
13 years 10 months ago
Watermarking Essential Data Structures for Copyright Protection
Software watermarking is a new research area that aims at providing copyright protection for commercial software. It minimizes software piracy by hiding copyright signatures inside...
Qutaiba Albluwi, Ibrahim Kamel
CC
2010
Springer
172views System Software» more  CC 2010»
14 years 1 months ago
Verifying Local Transformations on Relaxed Memory Models
The problem of locally transforming or translating programs without altering their semantics is central to the construction of correct compilers. For concurrent shared-memory progr...
Sebastian Burckhardt, Madanlal Musuvathi, Vasu Sin...