Sciweavers

45 search results - page 4 / 9
» Reasoning about Optimistic Concurrency Using a Program Logic...
Sort
View
ESOP
2010
Springer
14 years 4 months ago
Parameterized Memory Models and Concurrent Separation Logic
Formal reasoning about concurrent programs is usually done with the assumption that the underlying memory model is sequentially consistent, i.e. the execution outcome is equivalen...
Rodrigo Ferreira, Xinyu Feng and Zhong Shao
LOGCOM
2007
126views more  LOGCOM 2007»
13 years 6 months ago
A Structural Proof of the Soundness of Rely/guarantee Rules
Various forms of rely/guarantee conditions have been used to record and reason about interference in ways that provide compositional development methods for concurrent programs. Th...
Joey W. Coleman, Cliff B. Jones
CAV
2010
Springer
239views Hardware» more  CAV 2010»
13 years 10 months ago
Model Checking of Linearizability of Concurrent List Implementations
Abstract. Concurrent data structures with fine-grained synchronization are notoriously difficult to implement correctly. The difficulty of reasoning about these implementations do...
Pavol Cerný, Arjun Radhakrishna, Damien Zuf...
CONCUR
2007
Springer
14 years 23 days ago
A Marriage of Rely/Guarantee and Separation Logic
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...
Viktor Vafeiadis, Matthew J. Parkinson
IJCAI
2003
13 years 8 months ago
The Concurrent, Continuous FLUX
FLUX belongs to the high-level programming languages for cognitive agents that have been developed in recent years. Based on the established, general action representation formali...
Yves Martins