-
1
-
-
85035115896
-
-
(organization)
-
The DAO. https://en.wikipedia.org/wiki/The DAO (organization)
-
-
-
-
2
-
-
85035109484
-
-
BlockKing contract (2016). https://etherscan.io/address/0x3ad14db4e5a658d8d20 f8836deabe9d5286f79e1
-
(2016)
-
-
-
3
-
-
0024144406
-
The existence of refinement mappings
-
IEEE Computer Society
-
Abadi, M., Lamport, L.: The existence of refinement mappings. In: LICS, pp. 165–175. IEEE Computer Society (1988)
-
(1988)
LICS
, pp. 165-175
-
-
Abadi, M.1
Lamport, L.2
-
5
-
-
84998854579
-
Formal verification of smart contracts: Short paper
-
ACM
-
Bhargavan, K., Delignat-Lavaud, A., Fournet, C., Gollamudi, A., Gonthier, G., Kobeissi, N., Kulatova, N., Rastogi, A., Sibut-Pinote, T., Swamy, N., Zanella-Béguelin, S.: Formal verification of smart contracts: short paper. In: PLAS, pp. 91–96. ACM (2016)
-
(2016)
PLAS
, pp. 91-96
-
-
Bhargavan, K.1
Delignat-Lavaud, A.2
Fournet, C.3
Gollamudi, A.4
Gonthier, G.5
Kobeissi, N.6
Kulatova, N.7
Rastogi, A.8
Sibut-Pinote, T.9
Swamy, N.10
Zanella-Béguelin, S.11
-
6
-
-
17044438952
-
Permission accounting in separation logic
-
ACM
-
Bornat, R., Calcagno, C., O’Hearn, P.W., Parkinson, M.J.: Permission accounting in separation logic. In: POPL, pp. 259–270. ACM (2005)
-
(2005)
POPL
, pp. 259-270
-
-
Bornat, R.1
Calcagno, C.2
O’Hearn, P.W.3
Parkinson, M.J.4
-
7
-
-
84888795964
-
Programming and reasoning with algebraic effects and dependent types
-
ACM
-
Brady, E.: Programming and reasoning with algebraic effects and dependent types. In: ICFP, pp. 133–144. ACM (2013)
-
(2013)
ICFP
, pp. 133-144
-
-
Brady, E.1
-
8
-
-
85030626067
-
Concurrent separation logic
-
Brookes, S., O’Hearn, P.W.: Concurrent separation logic. ACM SIGLOG News 3(3), 47–65 (2016)
-
(2016)
ACM SIGLOG News
, vol.3
, Issue.3
, pp. 47-65
-
-
Brookes, S.1
O’Hearn, P.W.2
-
10
-
-
77954772483
-
Understanding and effectively preventing the ABA problem in descriptor-based lock-free designs
-
IEEE Computer Society
-
Dechev, D., Pirkelbauer, P., Stroustrup, B.: Understanding and effectively preventing the ABA problem in descriptor-based lock-free designs. In: ISORC, pp. 185–192. IEEE Computer Society (2010)
-
(2010)
ISORC
, pp. 185-192
-
-
Dechev, D.1
Pirkelbauer, P.2
Stroustrup, B.3
-
12
-
-
77955014696
-
Concurrent abstract predicates
-
D’Hondt, T. (ed.), Springer, Heidelberg
-
Dinsdale-Young, T., Dodds, M., Gardner, P., Parkinson, M.J., Vafeiadis, V.: Concurrent abstract predicates. In: D’Hondt, T. (ed.) ECOOP 2010. LNCS, vol. 6183, pp. 504–528. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-14107-2 24
-
(2010)
ECOOP 2010. LNCS
, vol.6183
, pp. 504-528
-
-
Dinsdale-Young, T.1
Dodds, M.2
Gardner, P.3
Parkinson, M.J.4
Vafeiadis, V.5
-
13
-
-
84965017489
-
Symbolic abstract data type inference
-
ACM
-
Emmi, M., Enea, C.: Symbolic abstract data type inference. In: POPL, pp. 513–525. ACM (2016)
-
(2016)
POPL
, pp. 513-525
-
-
Emmi, M.1
Enea, C.2
-
16
-
-
84874424869
-
Why3—where programs meet provers
-
Felleisen, M., Gardner, P. (eds.), Springer, Heidelberg
-
Filliâtre, J.-C., Paskevich, A.: Why3—where programs meet provers. In: Felleisen, M., Gardner, P. (eds.) ESOP 2013. LNCS, vol. 7792, pp. 125–128. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-37036-6 8
-
(2013)
ESOP 2013. LNCS
, vol.7792
, pp. 125-128
-
-
Filliâtre, J.-C.1
Paskevich, A.2
-
17
-
-
37549051827
-
-
Addison-Wesley, Boston
-
Goetz, B., Peierls, T., Bloch, J., Bowbeer, J., Holmes, D., Lea, D.: Java Concurrency in Practice. Addison-Wesley, Boston (2006)
-
(2006)
Java Concurrency in Practice
-
-
Goetz, B.1
Peierls, T.2
Bloch, J.3
Bowbeer, J.4
Holmes, D.5
Lea, D.6
-
18
-
-
70350337070
-
Proving that non-blocking algorithms don’t block
-
ACM
-
Gotsman, A., Cook, B., Parkinson, M.J., Vafeiadis, V.: Proving that non-blocking algorithms don’t block. In: POPL, pp. 16–28. ACM (2009)
-
(2009)
POPL
, pp. 16-28
-
-
Gotsman, A.1
Cook, B.2
Parkinson, M.J.3
Vafeiadis, V.4
-
19
-
-
77954891944
-
Flat combining and the synchronization-parallelism tradeoff
-
Hendler, D., Incze, I., Shavit, N., Tzafrir, M.: Flat combining and the synchronization-parallelism tradeoff. In: SPAA, pp. 355–364 (2010)
-
(2010)
SPAA
, pp. 355-364
-
-
Hendler, D.1
Incze, I.2
Shavit, N.3
Tzafrir, M.4
-
21
-
-
0025460579
-
Linearizability: A correctness condition for concurrent objects
-
Herlihy, M., Wing, J.M.: Linearizability: a correctness condition for concurrent objects. ACM Trans. Prog. Lang. Syst. 12(3), 463–492 (1990)
-
(1990)
ACM Trans. Prog. Lang. Syst.
, vol.12
, Issue.3
, pp. 463-492
-
-
Herlihy, M.1
Wing, J.M.2
-
23
-
-
85035109487
-
-
Jentzsch, C.: The DAO (2016). https://etherscan.io/address/0xffbd72d37d4e7 f64939e70b2988aa8924fde48e3
-
(2016)
The DAO
-
-
Jentzsch, C.1
-
25
-
-
84962596708
-
A program logic for concurrent objects under fair scheduling
-
ACM
-
Liang, H., Feng, X.: A program logic for concurrent objects under fair scheduling. In: POPL, pp. 385–399. ACM (2016)
-
(2016)
POPL
, pp. 385-399
-
-
Liang, H.1
Feng, X.2
-
26
-
-
84883405203
-
CHECK-THEN-ACT misuse of java concurrent collections
-
IEEE Computer Society
-
Lin, Y., Dig, D.: CHECK-THEN-ACT misuse of java concurrent collections. In: ICST, pp. 164–173. IEEE Computer Society (2013)
-
(2013)
ICST
, pp. 164-173
-
-
Lin, Y.1
Dig, D.2
-
27
-
-
84995404927
-
Making smart contracts smarter
-
ACM
-
Luu, L., Chu, D., Olickel, H., Saxena, P., Hobor, A.: Making smart contracts smarter. In: CCS, pp. 254–269. ACM (2016)
-
(2016)
CCS
, pp. 254-269
-
-
Luu, L.1
Chu, D.2
Olickel, H.3
Saxena, P.4
Hobor, A.5
-
28
-
-
84950108510
-
Lem: Reusable engineering of real-world semantics
-
ACM
-
Mulligan, D.P., Owens, S., Gray, K.E., Ridge, T., Sewell, P.: Lem: reusable engineering of real-world semantics. In: ICFP, pp. 175–188. ACM (2014)
-
(2014)
ICFP
, pp. 175-188
-
-
Mulligan, D.P.1
Owens, S.2
Gray, K.E.3
Ridge, T.4
Sewell, P.5
-
29
-
-
84900536731
-
Communicating state transition systems for fine-grained concurrent resources
-
Shao, Z. (ed.), Springer, Heidelberg
-
Nanevski, A., Ley-Wild, R., Sergey, I., Delbianco, G.A.: Communicating state transition systems for fine-grained concurrent resources. In: Shao, Z. (ed.) ESOP 2014. LNCS, vol. 8410, pp. 290–310. Springer, Heidelberg (2014). https://doi.org/10. 1007/978-3-642-54833-8 16
-
(2014)
ESOP 2014. LNCS
, vol.8410
, pp. 290-310
-
-
Nanevski, A.1
Ley-Wild, R.2
Sergey, I.3
Delbianco, G.A.4
-
30
-
-
34047114898
-
Resources, concurrency, and local reasoning
-
O’Hearn, P.W.: Resources, concurrency, and local reasoning. Theor. Comp. Sci. 375(1–3), 271–307 (2007)
-
(2007)
Theor. Comp. Sci.
, vol.375
, Issue.13
, pp. 271-307
-
-
O’Hearn, P.W.1
-
31
-
-
85025116047
-
-
Master’s thesis, Chalmers University of Technology, Department of Computer Science and Engineering, Sweden
-
Pettersson, J., Edström, R.: Safer smart contracts through type-driven development. Master’s thesis, Chalmers University of Technology, Department of Computer Science and Engineering, Sweden (2016)
-
(2016)
Safer Smart Contracts through Type-Driven Development
-
-
Pettersson, J.1
Edström, R.2
-
33
-
-
84951102691
-
Mechanized verification of fine-grained concurrent programs
-
ACM
-
Sergey, I., Nanevski, A., Banerjee, A.: Mechanized verification of fine-grained concurrent programs. In: PLDI, pp. 77–87. ACM (2015)
-
(2015)
PLDI
, pp. 77-87
-
-
Sergey, I.1
Nanevski, A.2
Banerjee, A.3
-
34
-
-
84874441201
-
Modular reasoning about separation of concurrent data structures
-
Felleisen, M., Gardner, P. (eds.), Springer, Heidelberg
-
Svendsen, K., Birkedal, L., Parkinson, M.: Modular reasoning about separation of concurrent data structures. In: Felleisen, M., Gardner, P. (eds.) ESOP 2013. LNCS, vol. 7792, pp. 169–188. Springer, Heidelberg (2013). https://doi.org/10. 1007/978-3-642-37036-6 11
-
(2013)
ESOP 2013. LNCS
, vol.7792
, pp. 169-188
-
-
Svendsen, K.1
Birkedal, L.2
Parkinson, M.3
-
35
-
-
80053344480
-
Secure distributed programming with value-dependent types
-
ACM
-
Swamy, N., Chen, J., Fournet, C., Strub, P., Bhargavan, K., Yang, J.: Secure distributed programming with value-dependent types. In: ICFP, pp. 266–278. ACM (2011)
-
(2011)
ICFP
, pp. 266-278
-
-
Swamy, N.1
Chen, J.2
Fournet, C.3
Strub, P.4
Bhargavan, K.5
Yang, J.6
-
36
-
-
84965057562
-
Dependent types and multi-monadic effects in F
-
ACM
-
∗. In: POPL, pp. 256–270. ACM (2016)
-
(2016)
POPL
, pp. 256-270
-
-
Swamy, N.1
Hritcu, C.2
Keller, C.3
Rastogi, A.4
Delignat-Lavaud, A.5
Forest, S.6
Bhargavan, K.7
Fournet, C.8
Strub, P.9
Kohlweiss, M.10
Zinzindohoue, J.K.11
Béguelin, S.Z.12
-
37
-
-
84888774947
-
Unifying refinement and hoare-style reasoning in a logic for higher-order concurrency
-
ACM
-
Turon, A., Dreyer, D., Birkedal, L.: Unifying refinement and hoare-style reasoning in a logic for higher-order concurrency. In: ICFP, pp. 377–390. ACM (2013)
-
(2013)
ICFP
, pp. 377-390
-
-
Turon, A.1
Dreyer, D.2
Birkedal, L.3
|