forked from gakalaba/multidispatch-paper
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathreferences.bib
44 lines (42 loc) · 2.31 KB
/
references.bib
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
@Book{arpachiDusseau18:osbook,
author = {Arpaci-Dusseau, Remzi H. and Arpaci-Dusseau Andrea C.},
title = {Operating Systems: Three Easy Pieces},
publisher = {Arpaci-Dusseau Books, LLC},
year = 2015,
edition = {1.00},
note = {\url{http://pages.cs.wisc.edu/~remzi/OSTEP/}}
}
@InProceedings{waldspurger02,
author = {Waldspurger, Carl A.},
title = {Memory resource management in {VMware ESX} server},
booktitle = {USENIX Symposium on Operating System Design and
Implementation (OSDI)},
year = 2002,
pages = {181--194},
note = {\url{https://www.usenix.org/legacy/event/osdi02/tech/waldspurger/waldspurger.pdf}}}
@misc{code22,
title = {Multi-dispatch Linearizability},
year = {2022},
publisher = {GitHub},
journal = {GitHub repository},
howpublished = {\url{https://github.com/gakalaba/MDLin/tree/scripts}},
commit = {c5acd7b1bee5397cd761b2d2b6033c33a1f27f84}
}
@article{herlihy,
author = {Herlihy, Maurice P. and Wing, Jeannette M.},
title = {Linearizability: A Correctness Condition for Concurrent Objects},
year = {1990},
issue_date = {July 1990},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
volume = {12},
number = {3},
issn = {0164-0925},
url = {https://doi.org/10.1145/78969.78972},
doi = {10.1145/78969.78972},
abstract = {A concurrent object is a data object shared by concurrent processes. Linearizability is a correctness condition for concurrent objects that exploits the semantics of abstract data types. It permits a high degree of concurrency, yet it permits programmers to specify and reason about concurrent objects using known techniques from the sequential domain. Linearizability provides the illusion that each operation applied by concurrent processes takes effect instantaneously at some point between its invocation and its response, implying that the meaning of a concurrent object's operations can be given by pre- and post-conditions. This paper defines linearizability, compares it to other correctness conditions, presents and demonstrates a method for proving the correctness of implementations, and shows how to reason about concurrent objects, given they are linearizable.},
journal = {ACM Trans. Program. Lang. Syst.},
month = {jul},
pages = {463–492},
numpages = {30}
}