Sciweavers

153 search results - page 9 / 31
» Independence and Concurrent Separation Logic
Sort
View
CSL
1992
Springer
15 years 1 months ago
Communicating Evolving Algebras
We develop the rst steps of a theory of concurrency within the framework of evolving algebras of Gurevich, with the aim of investigating its suitability for the role of a general f...
Paola Glavan, Dean Rosenzweig
POPL
2007
ACM
15 years 9 months ago
Modular verification of a non-blocking stack
This paper contributes to the development of techniques for the modular proof of programs that include concurrent algorithms. We present a proof of a non-blocking concurrent algor...
Matthew J. Parkinson, Richard Bornat, Peter W. O'H...
UML
2005
Springer
15 years 2 months ago
UML Model Mappings for Platform Independent User Interface Design
While model based design of platform independent application logic has already shown significant success, the design of platform independent user interfaces still needs further in...
Tim Schattkowsky, Marc Lohmann
ICALP
2005
Springer
15 years 2 months ago
Spatial Logics for Bigraphs
Bigraphs are emerging as a (meta-)model for concurrent calculi, like CCS, ambients, πcalculus, and Petri nets. They are built orthogonally on two structures: a hierarchical place...
Giovanni Conforti, Damiano Macedonio, Vladimiro Sa...
TPHOL
2008
IEEE
15 years 3 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