Logical Concurrency Control from Sequential Proofs
We are interested in identifying and enforcing the isolation requirements of a concurrent program, i.e., concurrency control that ensures that the program meets its specification. The thesis of this paper is that this can be done systematically starting from a sequential proof, i.e., a proof of corr...
שמור ב:
| Principais autores: | , , , |
|---|---|
| פורמט: | Artigo |
| שפה: | Inglês |
| יצא לאור: |
Logical Methods in Computer Science e.V.
2011-09-01
|
| סדרה: | Logical Methods in Computer Science |
| נושאים: | |
| גישה מקוונת: | https://lmcs.episciences.org/986/pdf |
| תגים: |
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|