-
2
-
-
17044438952
-
Permission accounting in separation logic
-
DOI 10.1145/1047659.1040327
-
Richard Bornat, Cristiano Calcagno, Peter W. O'Hearn, and Matthew J. Parkinson. Permission accounting in separation logic. In Proc. 32nd ACM Symp. on Principles of Prog. Lang. (POPL'05), pages 259-270. ACM Press, January 2005. (Pubitemid 40493983)
-
(2005)
ACM SIGPLAN Notices
, vol.40
, Issue.1
, pp. 259-270
-
-
Bornat, R.1
O'Hearn, P.2
Calcagno, C.3
Parkinson, M.4
-
3
-
-
34047176494
-
A semantics for concurrent separation logic
-
DOI 10.1016/j.tcs.2006.12.034, PII S0304397506009248
-
Stephen Brookes. A semantics for concurrent separation logic. Theor. Comput. Sci., 375(1-3):227-270, 2007. (Pubitemid 46528652)
-
(2007)
Theoretical Computer Science
, vol.375
, Issue.1-3
, pp. 227-270
-
-
Brookes, S.1
-
5
-
-
38149043440
-
Modular safety checking for fine-grained concurrency
-
Lecture Notes in Computer Science Springer, August
-
Cristiano Calcagno, Matthew J. Parkinson, and Viktor Vafeiadis. Modular safety checking for fine-grained concurrency. In Proc. 14th Int'l Symposium on Static Analysis (SAS'07), volume 4634 of Lecture Notes in Computer Science, pages 233-248. Springer, August 2007b.
-
(2007)
Proc. 14th Int'l Symposium on Static Analysis (SAS'07)
, vol.4634
, pp. 233-248
-
-
Calcagno, C.1
Parkinson, M.J.2
Vafeiadis, V.3
-
6
-
-
0003940516
-
-
Cambridge University Press
-
Willem-Paul de Roever, Frank de Boer, Ulrich Hanneman, Jozef Hooman, Yassine Lakhnech, Mannes Poel, and Job Zwiers. Concurrency verification: introduction to compositional and noncompositional methods. Cambridge University Press, 2001.
-
(2001)
Concurrency Verification: Introduction to Compositional and Noncompositional Methods
-
-
Roever, W.-P.D.1
Boer, F.D.2
Hanneman, U.3
Hooman, J.4
Lakhnech, Y.5
Poel, M.6
Zwiers, J.7
-
7
-
-
67649848904
-
Local rely-guarantee reasoning (extended version)
-
Toyota Technological Institute at Chicago, Chicago, IL, U.S.A., October
-
Xinyu Feng. Local rely-guarantee reasoning (extended version). Technical Report TTIC-TR-2008-2011, Toyota Technological Institute at Chicago, Chicago, IL, U.S.A., October 2008. http://www.tti-c.org/technical reports/ttic-tr-2008-1. pdf.
-
(2008)
Technical Report TTIC-TR-2008-2011
-
-
Feng, X.1
-
8
-
-
33745205349
-
Modular verification of concurrent assembly code with dynamic thread creation and termination
-
DOI 10.1145/1090189.1086399
-
Xinyu Feng and Zhong Shao. Modular verification of concurrent assembly code with dynamic thread creation and termination. In Proc. 2005 ACM Int'l Conf. on Functional Prog. (ICFP'05), pages 254-267. ACM Press, September 2005. (Pubitemid 43907051)
-
(2005)
ACM SIGPLAN Notices
, vol.40
, Issue.9
, pp. 254-267
-
-
Feng, X.1
Shao, Z.2
-
9
-
-
37149041108
-
On the relationship between concurrent separation logic and assume-guarantee reasoning
-
4421 LNCS Programming Languages and Systems - 16th European Symposium on Programming, ESOP 2007. Held as Part of the Joint European Conferences on Theory and Practics of Software, ETAPS 2007, Proceedings
-
Xinyu Feng, Rodrigo Ferreira, and Zhong Shao. On the relationship between concurrent separation logic and assume-guarantee reasoning. In Proc. 16th European Symp. on Prog. (ESOP'07), volume 4421 of Lecture Notes in Computer Science, pages 173-188. Springer, March 2007. (Pubitemid 350259491)
-
(2007)
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
, pp. 173-188
-
-
Feng, X.1
Ferreira, R.2
Shao, Z.3
-
10
-
-
18544387152
-
Modular verification of multithreaded programs
-
Cormac Flanagan, Stephen N. Freund, Shaz Qadeer, and Sanjit A. Seshia. Modular verification of multithreaded programs. Theor. Comput. Sci., 338(1-3):153-183, 2005.
-
(2005)
Theor. Comput. Sci.
, vol.338
, Issue.1-3
, pp. 153-183
-
-
Flanagan, C.1
Freund, S.N.2
Qadeer, S.3
Seshia, S.A.4
-
11
-
-
67649848390
-
Proving that non-blocking algorithms don't block
-
page to appear. ACM Press, January
-
Alexey Gotsman, Byron Cook, Matthew J. Parkinson, and Viktor Vafeiadis. Proving that non-blocking algorithms don't block. In Proc. 36th ACM Symp. on Principles of Prog. Lang. (POPL'09), page to appear. ACM Press, January 2009.
-
(2009)
Proc. 36th ACM Symp. on Principles of Prog. Lang. (POPL'09)
-
-
Gotsman, A.1
Cook, B.2
Parkinson, M.J.3
Vafeiadis, V.4
-
14
-
-
84976735431
-
Tentative steps toward a development method for interfering programs
-
Cliff B. Jones. Tentative steps toward a development method for interfering programs. ACM Trans. Program. Lang. Syst., 5(4):596-619, 1983.
-
(1983)
ACM Trans. Program. Lang. Syst.
, vol.5
, Issue.4
, pp. 596-619
-
-
Jones, C.B.1
-
15
-
-
0141747288
-
Wanted: A compositional approach to concurrency
-
Springer-Verlag
-
Cliff B. Jones. Wanted: a compositional approach to concurrency. In Programming Methodology, pages 5-15. Springer-Verlag, 2003.
-
(2003)
Programming Methodology
, pp. 5-15
-
-
Jones, C.B.1
-
17
-
-
3042671335
-
Hazard pointers: Safe memory reclamation for lockfree objects
-
Maged M. Michael. Hazard pointers: Safe memory reclamation for lockfree objects. IEEE Transactions on Parallel and Distributed Systems, 15 (6):491-504, 2004.
-
(2004)
IEEE Transactions on Parallel and Distributed Systems
, vol.15
, Issue.6
, pp. 491-504
-
-
Michael, M.M.1
-
18
-
-
34047114898
-
Resources, concurrency, and local reasoning
-
DOI 10.1016/j.tcs.2006.12.035, PII S030439750600925X
-
Peter W. O'Hearn. Resources, concurrency and local reasoning. Theor. Comput. Sci., 375(1-3):271-307, 2007. (Pubitemid 46528653)
-
(2007)
Theoretical Computer Science
, vol.375
, Issue.1-3
, pp. 271-307
-
-
O'Hearn, P.W.1
-
20
-
-
34547291013
-
Variables as resource in Hoare logics
-
DOI 10.1109/LICS.2006.52, 1691225, Proceedings - 21st Annual IEEE Symposium on Logic in Computer Science, LICS 2006
-
Matthew J. Parkinson, Richard Bornat, and Cristiano Calcagno. Variables as resource in hoare logics. In Proc. 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06), pages 137-146. IEEE Computer Society, August 2006. (Pubitemid 47130360)
-
(2006)
Proceedings - Symposium on Logic in Computer Science
, pp. 137-146
-
-
Parkinson, M.1
Bornat, R.2
Calcagno, C.3
-
21
-
-
34548227364
-
Modular verification of a non-blocking stack
-
Matthew J. Parkinson, Richard Bornat, and Peter W. O'Hearn. Modular verification of a non-blocking stack. In Proc. 34th ACM Symp. on Principles of Prog. Lang. (POPL'07), pages 297-302. ACM Press, January 2007. (Pubitemid 46160776)
-
(2007)
ACM SIGPLAN Notices
, vol.42
, Issue.1
, pp. 297-302
-
-
Parkinson, M.1
Bornat, R.2
O'Hearn, P.3
-
22
-
-
0036051192
-
Separation logic: A logic for shared mutable data structures
-
John C. Reynolds. Separation logic: A logic for shared mutable data structures. In Proc. 17th Annual IEEE Symposium on Logic in Computer Science (LICS'02), pages 55-74. IEEE Computer Society, July 2002. (Pubitemid 34911797)
-
(2002)
Proceedings - Symposium on Logic in Computer Science
, pp. 55-74
-
-
Reynolds, J.C.1
-
24
-
-
38149033563
-
A marriage of rely/guarantee and separation logic
-
of Lecture Notes in Computer Science September
-
Viktor Vafeiadis and Matthew J. Parkinson. A marriage of rely/guarantee and separation logic. In Proc. 18th Int'l Conf. on Concurrency Theory (CONCUR'07), volume 4703 of Lecture Notes in Computer Science, pages 256-271, September 2007.
-
(2007)
Proc. 18th Int'l Conf. on Concurrency Theory (CONCUR'07)
, vol.4703
, pp. 256-271
-
-
Vafeiadis, V.1
Parkinson, M.J.2
-
25
-
-
34047152892
-
Relational separation logic
-
DOI 10.1016/j.tcs.2006.12.036, PII S0304397506009261
-
Hongseok Yang. Relational separation logic. Theor. Comput. Sci., 375(1-3): 308-334, 2007. (Pubitemid 46528654)
-
(2007)
Theoretical Computer Science
, vol.375
, Issue.1-3
, pp. 308-334
-
-
Yang, H.1
|