International Colloquium on Automata, Languages and Programming on Automata, languages and programming
A generalization of Owicki-Gries's Hoare logic for a concurrent while language
Theoretical Computer Science - Thirteenth International Colloquim on Automata, Languages and Programming, Renne
Parallel program design: a foundation
Parallel program design: a foundation
Proceedings of the 2nd international conference on Concurrency theory
CONCUR '91 Proceedings of the 2nd international conference on Concurrency theory
A calculus of mobile processes, I
Information and Computation
Accommodating interference in the formal design of concurrent object-based programs
Formal Methods in System Design
On transformations of concurrent-object programs
Theoretical Computer Science
Theory and Practice of Object Systems - Special issue on foundations of object-oriented languages
Data Refinement: Model-Oriented Proof Methods and Their Comparison
Data Refinement: Model-Oriented Proof Methods and Their Comparison
Action Systems and Action Refinement in the Development of Parallel Systems - An Algebraic Approach
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
MPC '00 Proceedings of the 5th International Conference on Mathematics of Program Construction
Axiomatic proof techniques for parallel programs.
Axiomatic proof techniques for parallel programs.
Resources, concurrency, and local reasoning
Theoretical Computer Science
Scalable Specification and Reasoning: Challenges for Program Logic
Verified Software: Theories, Tools, Experiments
Splitting Atoms with Rely/Guarantee Conditions Coupled with Data Reification
ABZ '08 Proceedings of the 1st international conference on Abstract State Machines, B and Z
Local rely-guarantee reasoning
Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Towards the Composition of Specifications in Event-B
Electronic Notes in Theoretical Computer Science (ENTCS)
Smallfoot: modular automatic assertion checking with separation logic
FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
Shared event composition/decomposition in event-b
FMCO'10 Proceedings of the 9th international conference on Formal Methods for Components and Objects
A marriage of rely/guarantee and separation logic
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Abstraction as a unifying link for formal approaches to concurrency
SEFM'12 Proceedings of the 10th international conference on Software Engineering and Formal Methods
| Hi-index | 0.00 |
A key property for a development method is compositionality, because it ensures that a method can scale up to cope with large applications. Unfortunately, the inherent interference makes it difficult to devise development methods for concurrent programs (or systems). There are a number of proposals such as rely/guarantee conditions but the overall search for a satisfactory compositional approach to concurrency is an open problem. This paper identifies some issues including granularity and the problems associated with ghost variables; it also discusses using atomicity as a design abstraction.