A separation logic for concurrent randomized programs
We present Polaris, a concurrent separation logic with support for probabilistic reasoning. As part of our logic, we extend the idea of coupling, which underlies recent work on probabilistic relational logics, to the setting of programs with both probabilistic and non-deterministic choice. To demons...
Saved in:
| Published in: | Proceedings of ACM on programming languages Vol. 3; no. POPL; pp. 1 - 30 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
New York, NY, USA
ACM
02.01.2019
|
| Subjects: | |
| ISSN: | 2475-1421, 2475-1421 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | We present Polaris, a concurrent separation logic with support for probabilistic reasoning. As part of our logic, we extend the idea of coupling, which underlies recent work on probabilistic relational logics, to the setting of programs with both probabilistic and non-deterministic choice. To demonstrate Polaris, we verify a variant of a randomized concurrent counter algorithm and a two-level concurrent skip list. All of our results have been mechanized in Coq. |
|---|---|
| AbstractList | We present Polaris, a concurrent separation logic with support for probabilistic reasoning. As part of our logic, we extend the idea of coupling, which underlies recent work on probabilistic relational logics, to the setting of programs with both probabilistic and non-deterministic choice. To demonstrate Polaris, we verify a variant of a randomized concurrent counter algorithm and a two-level concurrent skip list. All of our results have been mechanized in Coq. |
| ArticleNumber | 64 |
| Author | Tassarotti, Joseph Harper, Robert |
| Author_xml | – sequence: 1 givenname: Joseph surname: Tassarotti fullname: Tassarotti, Joseph email: jtassaro@andrew.cmu.edu organization: Carnegie Mellon University, USA – sequence: 2 givenname: Robert surname: Harper fullname: Harper, Robert email: rwh@cs.cmu.edu organization: Carnegie Mellon University, USA |
| BookMark | eNptj01Lw0AQhhepYK3Fu6e9eYruV7LJsRS_oOBFz2GyH2Ul2S2z8aC_3miriHiaYd6Hl3lOySym6Ag55-yKc1VeS9EwqfURmQuly4IrwWe_9hOyzPmFMcYbqWrZzEm5otntAGEMKdI-bYOhPiE1KZpXRBdHihBtGsK7s3SHaYsw5DNy7KHPbnmYC_J8e_O0vi82j3cP69WmAKnkWJSN9HXntbNWCFNx5zW3HmrPlRfeQC21EZ0X2thq-hy8qyW3TQWdYc10kQtyue81mHJG59sdhgHwreWs_RRuD8ITWfwhTRi_pEaE0P_DX-x5MMNP6Xf4ARUGYOw |
| CitedBy_id | crossref_primary_10_1017_S0956796821000137 crossref_primary_10_1145_3747514 crossref_primary_10_1145_3571195 crossref_primary_10_1145_3473598 crossref_primary_10_1145_3689753 crossref_primary_10_1145_3498719 crossref_primary_10_1016_j_tcs_2022_09_015 crossref_primary_10_1145_3632851 crossref_primary_10_1145_3674635 crossref_primary_10_1145_3674632 crossref_primary_10_1145_3408992 crossref_primary_10_1145_3591226 crossref_primary_10_1145_3586045 crossref_primary_10_1145_3632868 crossref_primary_10_1145_3704894 crossref_primary_10_1145_3704876 crossref_primary_10_1145_3649839 crossref_primary_10_1145_3704855 crossref_primary_10_1145_3434286 crossref_primary_10_1145_3571259 crossref_primary_10_1145_3290347 crossref_primary_10_1145_3649821 crossref_primary_10_1016_j_tcs_2021_12_018 |
| Cites_doi | 10.1016/j.jlamp.2014.09.003 10.1145/1480881.1480922 10.1145/360933.360975 10.1145/1993636.1993687 10.1007/978-3-662-54434-1_26 10.1007/978-3-642-31113-0_1 10.1145/359619.359627 10.1145/69575.69577 10.1007/978-3-662-54434-1_34 10.1007/978-3-642-15375-4_27 10.1145/964001.964003 10.1145/2951913.2951943 10.1145/2429069.2429104 10.1017/S0960129505005074 10.1007/978-3-642-02444-3_16 10.1007/978-3-319-89884-1_8 10.1145/2983990.2983999 10.1017/S0956796808006953 10.1145/3009837.3009896 10.1007/978-3-642-54833-8_16 10.1145/2486159.2486182 10.1145/78973.78977 10.1016/j.entcs.2005.12.113 10.1007/978-3-642-14107-2_24 10.1007/978-3-540-74407-8_18 10.1145/2500365.2500600 10.1145/2676726.2676980 10.1145/3209108.3209174 10.1145/78969.78972 10.1016/j.tcs.2006.12.035 10.1145/229542.229547 10.1007/BF01934993 10.1145/2034773.2034777 10.1007/978-3-662-49498-1_15 10.1007/978-3-540-71316-6_13 10.1016/0022-0000(81)90036-2 10.1145/3009837.3009877 10.1016/j.tcs.2016.01.016 10.1007/978-3-662-46666-7_4 10.1007/978-3-662-44202-9_9 10.1007/978-3-662-46678-0_18 10.1016/j.entcs.2009.01.002 10.1007/978-3-642-03359-9_30 10.1016/j.scico.2007.09.002 10.1007/978-3-662-48899-7_27 |
| ContentType | Journal Article |
| Copyright | Owner/Author |
| Copyright_xml | – notice: Owner/Author |
| DBID | AAYXX CITATION |
| DOI | 10.1145/3290377 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | CrossRef |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 2475-1421 |
| EndPage | 30 |
| ExternalDocumentID | 10_1145_3290377 3290377 |
| GroupedDBID | AAKMM AAYFX ACM ADPZR AIKLT ALMA_UNASSIGNED_HOLDINGS EBS GUFHI LHSKQ M~E OK1 ROL AAYXX AEFXT AEJOY AKRVB CITATION |
| ID | FETCH-LOGICAL-a343t-593f8bf7edd22c61ef71dfa8f14f2fca837c2bf27cd6329afe831d96abc096323 |
| ISICitedReferencesCount | 35 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000678450300064&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 2475-1421 |
| IngestDate | Tue Nov 18 21:46:25 EST 2025 Sat Nov 29 07:45:46 EST 2025 Mon Feb 24 21:14:27 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | POPL |
| Keywords | probability separation logic concurrency |
| Language | English |
| License | This work is licensed under a Creative Commons Attribution International 4.0 License. |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-a343t-593f8bf7edd22c61ef71dfa8f14f2fca837c2bf27cd6329afe831d96abc096323 |
| OpenAccessLink | https://dl.acm.org/doi/10.1145/3290377 |
| PageCount | 30 |
| ParticipantIDs | crossref_primary_10_1145_3290377 crossref_citationtrail_10_1145_3290377 acm_primary_3290377 |
| PublicationCentury | 2000 |
| PublicationDate | 2019-01-02 |
| PublicationDateYYYYMMDD | 2019-01-02 |
| PublicationDate_xml | – month: 01 year: 2019 text: 2019-01-02 day: 02 |
| PublicationDecade | 2010 |
| PublicationPlace | New York, NY, USA |
| PublicationPlace_xml | – name: New York, NY, USA |
| PublicationTitle | Proceedings of ACM on programming languages |
| PublicationTitleAbbrev | ACM PACMPL |
| PublicationYear | 2019 |
| Publisher | ACM |
| Publisher_xml | – name: ACM |
| References | Dexter Kozen. 1981. Semantics of Probabilistic Programs. J. Comput. Syst. Sci. 22, 3 (1981), 328–350. Morten Krogh-Jespersen, Kasper Svendsen, and Lars Birkedal. 2017. A Relational Model of Types-and-Effects in Higher-Order Concurrent Separation Logic. In POPL. 218–231. 10.1145/3009837.3009877 C. B. Jones. 1983. Tentative steps toward a development method for interfering programs. TOPLAS 5, 4 (1983), 596–619. 10.1145/69575.69577 Wojciech M. Golab, Lisa Higham, and Philipp Woelfel. 2011. Linearizable implementations do not suffice for randomized distributed computation. In Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, San Jose, CA, USA, 6-8 June 2011. 373–382. 10.1145/1993636.1993687 Jean Goubault-Larrecq. 2007. Continuous Previsions. In Computer Science Logic, 21st International Workshop, CSL 2007, 16th Annual Conference of the EACSL, Lausanne, Switzerland, September 11-15, 2007, Proceedings. 542–557. Philippe Audebaud and Christine Paulin-Mohring. 2009. Proofs of randomized algorithms in Coq. Sci. Comput. Program. 74, 8 (2009), 568–589. 10.1016/j.scico.2007.09.002 Claire Jones. 1990. Probabilistic non-determinism. Ph.D. Dissertation. University of Edinburgh, UK. http://hdl.handle.net/ 1842/413 Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, and Thomas Noll. 2018. Quantitative Separation Logic. CoRR abs/1802.10467 (2018). arXiv: 1802.10467 http://arxiv.org/abs/1802.10467 Thomas Dinsdale-Young, Lars Birkedal, Philippa Gardner, Matthew J. Parkinson, and Hongseok Yang. 2013. Views: Compositional reasoning for concurrent programs. In POPL. 10.1145/2429069.2429104 Gilles Barthe, Marco Gaboardi, Benjamin Grégoire, Justin Hsu, and Pierre-Yves Strub. 2016. A Program Logic for Union Bounds. In ICALP. 107:1–107:15. Nick Benton. 2004. Simple Relational Correctness Proofs for Static Analyses and Program Transformations. In POPL. 10.1145/964001.964003 J. Hsu. 2017. Probabilistic Couplings for Probabilistic Reasoning. ArXiv e-prints (Oct. 2017). arXiv: cs.LO/1710.09951 Ming Fu, Yong Li, Xinyu Feng, Zhong Shao, and Yu Zhang. 2010. Reasoning about optimistic concurrency using a program logic for history. In CONCUR. 388–402. Robbert Krebbers, Ralf Jung, Ales Bizjak, Jacques-Henri Jourdan, Derek Dreyer, and Lars Birkedal. 2017. The Essence of Higher-Order Concurrent Separation Logic. In ESOP. 696–723. 10.1007/978-3-662-54434-1_26 Silas Boyd-Wickizer, Austin T. Clements, Yandong Mao, Aleksey Pesterev, M. Frans Kaashoek, Robert Tappan Morris, and Nickolai Zeldovich. 2010. An Analysis of Linux Scalability to Many Cores. In 9th USENIX Symposium on Operating Systems Design and Implementation, OSDI 2010, October 4-6, 2010, Vancouver, BC, Canada, Proceedings. 1–16. V. Vafeiadis and M. Parkinson. 2007. A marriage of rely/guarantee and separation logic. In CONCUR. 256–271. John C. Reynolds. 2002. Separation logic: A logic for shared mutable data structures. In LICS. Ales Bizjak and Lars Birkedal. 2015. Step-Indexed Logical Relations for Probability. In Foundations of Software Science and Computation Structures - 18th International Conference, FoSSaCS 2015, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015, London, UK, April 11-18, 2015. Proceedings. 279–294. T. Dinsdale-Young, M. Dodds, P. Gardner, M. Parkinson, and V. Vafeiadis. 2010. Concurrent abstract predicates. In ECOOP. 504–528. John Boyland. 2003. Checking Interference with Fractional Permissions. In Static Analysis, 10th International Symposium, SAS 2003, San Diego, CA, USA, June 11-13, 2003, Proceedings. 55–72. Iris Team. 2017. Iris 3.0 Documentation. http://plv.mpi- sws.org/iris/appendix- 3.0.pdf Ralf Jung, David Swasey, Filip Sieczkowski, Kasper Svendsen, Aaron Turon, Lars Birkedal, and Derek Dreyer. 2015. Iris: Monoids and Invariants as an Orthogonal Basis for Concurrent Reasoning. In POPL. 637–650. 10.1145/2676726.2676980 Xinyu Feng, Rodrigo Ferreira, and Zhong Shao. 2007. On the relationship between concurrent separation logic and assume-guarantee reasoning. In ESOP. 173–188. P.W. O’Hearn. 2007. Resources, concurrency, and local reasoning. TCS 375, 1 (2007), 271–307. 10.1016/j.tcs.2006.12.035 Aaron Turon, Derek Dreyer, and Lars Birkedal. 2013. Unifying refinement and Hoare-style reasoning in a logic for higher-order concurrency. In ICFP. 377–390. 10.1145/2500365.2500600 Gilles Barthe, Benjamin Grégoire, Justin Hsu, and Pierre-Yves Strub. 2017c. Coupling proofs are probabilistic product programs. In POPL. 161–174. 10.1145/3009837.3009896 Ilya Sergey, Aleksandar Nanevski, Anindya Banerjee, and Germán Andrés Delbianco. 2016. Hoare-style specifications as correctness conditions for non-linearizable concurrent objects. In OOPSLA. 92–110. 10.1145/2983990.2983999 Carroll Morgan, Annabelle McIver, and Karen Seidel. 1996. Probabilistic Predicate Transformers. ACM Trans. Program. Lang. Syst. 18, 3 (1996), 325–353. 10.1145/229542.229547 Viktor Vafeiadis. 2007. Modular fine-grained concurrency verification. Ph.D. Dissertation. University of Cambridge. Andrew W. Appel. 2014. Program Logics - for Certified Compilers. Cambridge University Press. Dan Frumin, Robbert Krebbers, and Lars Birkedal. 2018. ReLoC: A Mechanised Relational Logic for Fine-Grained Concurrency. In Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018, Oxford, UK, July 09-12, 2018. 442–451. 10.1145/3209108.3209174 Dave Dice, Yossi Lev, and Mark Moir. 2013. Scalable statistics counters. In SPAA. 43–52. 10.1145/2486159.2486182 Philippe Flajolet. 1985. Approximate Counting: A Detailed Analysis. BIT 25, 1 (1985), 113–134. 10.1007/BF01934993 Jean Goubault-Larrecq. 2015. Full abstraction for non-deterministic and probabilistic extensions of PCF I: The angelic cases. J. Log. Algebr. Meth. Program. 84, 1 (2015), 155–184. Robert Morris. 1978. Counting Large Numbers of Events in Small Registers. Commun. ACM 21, 10 (1978), 840–842. 10.1145/359619.359627 Maurice P. Herlihy and Jeannette M. Wing. 1990. Linearizability: a correctness condition for concurrent objects. TOPLAS 12, 3 (1990), 463–492. 10.1145/78969.78972 Lyle Harold Ramshaw. 1979. Formalizing the Analysis of Algorithms. Ph.D. Dissertation. Stanford University. Gilles Barthe, Thomas Espitau, Justin Hsu, Tetsuya Sato, and Pierre-Yves Strub. 2017b. *-Liftings for Differential Privacy. In 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland. 102:1–102:12. Michael W. Mislove. 2006. On Combining Probability and Nondeterminism. Electr. Notes Theor. Comput. Sci. 162 (2006), 261–265. Joseph Tassarotti, Ralf Jung, and Robert Harper. 2017. A Higher-Order Logic for Concurrent Termination-Preserving Refinement. In ESOP. 909–936. 10.1007/978-3-662-54434-1_34 Ralf Jung, Robbert Krebbers, Lars Birkedal, and Derek Dreyer. 2016. Higher-Order Ghost State. In ICFP. 10.1145/2951913.2951943 Aleksandar Nanevski, J. Gregory Morrisett, and Lars Birkedal. 2008. Hoare type theory, polymorphism and separation. J. Funct. Program. 18, 5-6 (2008), 865–911. 10.1017/S0956796808006953 Jon Beck. 1969. Distributive laws. In Seminar on Triples and Categorical Homology Theory, B. Eckmann (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 119–140. Annabelle McIver, Tahiry M. Rabehaja, and Georg Struth. 2016. Probabilistic rely-guarantee calculus. Theor. Comput. Sci. 655 (2016), 120–134. 10.1016/j.tcs.2016.01.016 Aleksandar Nanevski, Ruy Ley-Wild, Ilya Sergey, and Germán Andrés Delbianco. 2014. Communicating State Transition Systems for Fine-Grained Concurrent Resources. In ESOP. 290–310. 10.1007/978-3-642-54833-8_16 William Pugh. 1990. Skip Lists: A Probabilistic Alternative to Balanced Trees. Commun. ACM 33, 6 (1990), 668–676. 10.1145/78973.78977 Gilles Barthe, Benjamin Grégoire, and Santiago Zanella Béguelin. 2012. Probabilistic Relational Hoare Logics for ComputerAided Security Proofs. In Mathematics of Program Construction - 11th International Conference, MPC 2012, Madrid, Spain, June 25-27, 2012. Proceedings. 1–6. 10.1007/978-3-642-31113-0_1 Pedro da Rocha Pinto, Thomas Dinsdale-Young, and Philippa Gardner. 2014. TaDA: A Logic for Time and Data Abstraction. In ECOOP. 207–231. 10.1007/978-3-662-44202-9_9 Edsger W. Dijkstra. 1975. Guarded Commands, Nondeterminacy and Formal Derivation of Programs. Commun. ACM 18, 8 (1975), 453–457. 10.1145/360933.360975 Eelis van der Weegen and James McKinna. 2008. A Machine-Checked Proof of the Average-Case Complexity of Quicksort in Coq. In TYPES. 256–271. Michael W. Mislove. 2000. Nondeterminism and Probabilistic Choice: Obeying the Laws. In CONCUR 2000 - Concurrency Theory, 11th International Conference, University Park, PA, USA, August 22-25, 2000, Proceedings. 350–364. Keir Fraser. 2004. Practical lock-freedom. Ph.D. Dissertation. University of Cambridge. Maurice Herlihy, Yossi Lev, Victor Luchangco, and Nir Shavit. 2006. A Provably Correct Scalable Concurrent Skip List (Brief Announcement). In OPODIS. Alejandro Aguirre, Gilles Barthe, Lars Birkedal, Ales Bizjak, Marco Gaboardi, and Deepak Garg. 2018. Relational Reasoning for Markov Chains in a Probabilistic Guarded Lambda Calculus. In ESOP. 214–241. Adam Petcher and Greg Morrisett. 2015. The Foundational Cryptography Framework. In POST. 53–72. 10.1007/978-3-662-46666-7_4 Jean-Baptiste Tristan, Joseph Tassarotti, and Guy L. Steele Jr. 2015. Efficient Training of LDA on a GP U by Mean-for-Mode Estimation. In Proceedings of the 32nd International Conference on Machine Learning, ICML 2015, Lille, France, 6-11 July 2015. 59–68. Xinyu Feng. 2009. Local rely-guarantee reasoning. In POPL. 315–327. 10.1145/1480881.1480922 Gilles Barthe, Thomas Espitau, Benjamin Grégoire, Justin Hsu, and Pierre-Yves Strub. 2017a. Proving uniformity and independence by self-composition and coupling. In LPAR. Jeremy Gibbons and Ralf Hinze. 2011. Just do it: simple monadic equational reasoning. In ICFP. 2–14. 10.1145/2034773.2034777 Daniele Varacca. 2002. The Powerdomain of Indexed Valuations. In 17t e_1_2_2_4_1 e_1_2_2_24_1 e_1_2_2_49_1 Mislove Michael W. (e_1_2_2_45_1) 2000 e_1_2_2_22_1 e_1_2_2_20_1 e_1_2_2_41_1 e_1_2_2_62_1 e_1_2_2_64_1 e_1_2_2_8_1 e_1_2_2_28_1 e_1_2_2_26_1 e_1_2_2_47_1 Appel Andrew W. (e_1_2_2_2_1) Beck Jon (e_1_2_2_11_1) Boyd-Wickizer Silas (e_1_2_2_14_1) 2010 Chlipala Adam (e_1_2_2_16_1) Tristan Jean-Baptiste (e_1_2_2_61_1) 2015 e_1_2_2_60_1 Goubault-Larrecq Jean (e_1_2_2_30_1) 2007 e_1_2_2_13_1 e_1_2_2_38_1 e_1_2_2_59_1 e_1_2_2_51_1 e_1_2_2_19_1 e_1_2_2_32_1 e_1_2_2_53_1 e_1_2_2_17_1 Lindvall T. (e_1_2_2_43_1) e_1_2_2_55_1 e_1_2_2_36_1 e_1_2_2_57_1 Barthe Gilles (e_1_2_2_7_1) 2016; 107 e_1_2_2_48_1 e_1_2_2_5_1 e_1_2_2_23_1 e_1_2_2_21_1 e_1_2_2_1_1 e_1_2_2_3_1 e_1_2_2_40_1 e_1_2_2_42_1 e_1_2_2_65_1 e_1_2_2_9_1 e_1_2_2_29_1 e_1_2_2_44_1 e_1_2_2_67_1 e_1_2_2_27_1 e_1_2_2_46_1 Hsu J. (e_1_2_2_34_1) 2017 Batz Kevin (e_1_2_2_10_1) 2018 e_1_2_2_37_1 e_1_2_2_12_1 e_1_2_2_39_1 e_1_2_2_52_1 e_1_2_2_31_1 Varacca Daniele (e_1_2_2_66_1) 2002 Boyland John (e_1_2_2_15_1) 2003 e_1_2_2_18_1 e_1_2_2_33_1 e_1_2_2_56_1 e_1_2_2_58_1 Barthe Gilles (e_1_2_2_6_1) 2017 e_1_2_2_50_1 |
| References_xml | – reference: Ralf Jung, David Swasey, Filip Sieczkowski, Kasper Svendsen, Aaron Turon, Lars Birkedal, and Derek Dreyer. 2015. Iris: Monoids and Invariants as an Orthogonal Basis for Concurrent Reasoning. In POPL. 637–650. 10.1145/2676726.2676980 – reference: Carroll Morgan, Annabelle McIver, and Karen Seidel. 1996. Probabilistic Predicate Transformers. ACM Trans. Program. Lang. Syst. 18, 3 (1996), 325–353. 10.1145/229542.229547 – reference: Joseph Tassarotti, Ralf Jung, and Robert Harper. 2017. A Higher-Order Logic for Concurrent Termination-Preserving Refinement. In ESOP. 909–936. 10.1007/978-3-662-54434-1_34 – reference: Dan Frumin, Robbert Krebbers, and Lars Birkedal. 2018. ReLoC: A Mechanised Relational Logic for Fine-Grained Concurrency. In Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018, Oxford, UK, July 09-12, 2018. 442–451. 10.1145/3209108.3209174 – reference: Maurice P. Herlihy and Jeannette M. Wing. 1990. Linearizability: a correctness condition for concurrent objects. TOPLAS 12, 3 (1990), 463–492. 10.1145/78969.78972 – reference: Adam Petcher and Greg Morrisett. 2015. The Foundational Cryptography Framework. In POST. 53–72. 10.1007/978-3-662-46666-7_4 – reference: Thomas Dinsdale-Young, Lars Birkedal, Philippa Gardner, Matthew J. Parkinson, and Hongseok Yang. 2013. Views: Compositional reasoning for concurrent programs. In POPL. 10.1145/2429069.2429104 – reference: Eelis van der Weegen and James McKinna. 2008. A Machine-Checked Proof of the Average-Case Complexity of Quicksort in Coq. In TYPES. 256–271. – reference: Xinyu Feng, Rodrigo Ferreira, and Zhong Shao. 2007. On the relationship between concurrent separation logic and assume-guarantee reasoning. In ESOP. 173–188. – reference: Claire Jones. 1990. Probabilistic non-determinism. Ph.D. Dissertation. University of Edinburgh, UK. http://hdl.handle.net/ 1842/413 – reference: Adam Chlipala. 2013. Certified Programming with Dependent Types - A Pragmatic Introduction to the Coq Proof Assistant. MIT Press. http://mitpress.mit.edu/books/certified- programming- dependent- types – reference: Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, and Federico Olmedo. 2016. Weakest Precondition Reasoning for Expected Run-Times of Probabilistic Programs. In ESOP. 364–389. 10.1007/978-3-662-49498-1_15 – reference: V. Vafeiadis and M. Parkinson. 2007. A marriage of rely/guarantee and separation logic. In CONCUR. 256–271. – reference: Daniele Varacca and Glynn Winskel. 2006. Distributing probability over non-determinism. Mathematical Structures in Computer Science 16, 1 (2006), 87–113. 10.1017/S0960129505005074 – reference: Ales Bizjak and Lars Birkedal. 2015. Step-Indexed Logical Relations for Probability. In Foundations of Software Science and Computation Structures - 18th International Conference, FoSSaCS 2015, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015, London, UK, April 11-18, 2015. Proceedings. 279–294. – reference: Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, and Thomas Noll. 2018. Quantitative Separation Logic. CoRR abs/1802.10467 (2018). arXiv: 1802.10467 http://arxiv.org/abs/1802.10467 – reference: Robbert Krebbers, Ralf Jung, Ales Bizjak, Jacques-Henri Jourdan, Derek Dreyer, and Lars Birkedal. 2017. The Essence of Higher-Order Concurrent Separation Logic. In ESOP. 696–723. 10.1007/978-3-662-54434-1_26 – reference: Regina Tix, Klaus Keimel, and Gordon D. Plotkin. 2009. Semantic Domains for Combining Probability and Non-Determinism. Electr. Notes Theor. Comput. Sci. 222 (2009), 3–99. 10.1016/j.entcs.2009.01.002 – reference: Gilles Barthe, Thomas Espitau, Benjamin Grégoire, Justin Hsu, and Pierre-Yves Strub. 2017a. Proving uniformity and independence by self-composition and coupling. In LPAR. – reference: Edsger W. Dijkstra. 1975. Guarded Commands, Nondeterminacy and Formal Derivation of Programs. Commun. ACM 18, 8 (1975), 453–457. 10.1145/360933.360975 – reference: T. Dinsdale-Young, M. Dodds, P. Gardner, M. Parkinson, and V. Vafeiadis. 2010. Concurrent abstract predicates. In ECOOP. 504–528. – reference: Michael W. Mislove. 2000. Nondeterminism and Probabilistic Choice: Obeying the Laws. In CONCUR 2000 - Concurrency Theory, 11th International Conference, University Park, PA, USA, August 22-25, 2000, Proceedings. 350–364. – reference: Viktor Vafeiadis. 2007. Modular fine-grained concurrency verification. Ph.D. Dissertation. University of Cambridge. – reference: Jeremy Gibbons and Ralf Hinze. 2011. Just do it: simple monadic equational reasoning. In ICFP. 2–14. 10.1145/2034773.2034777 – reference: J. Hsu. 2017. Probabilistic Couplings for Probabilistic Reasoning. ArXiv e-prints (Oct. 2017). arXiv: cs.LO/1710.09951 – reference: Michael W. Mislove. 2006. On Combining Probability and Nondeterminism. Electr. Notes Theor. Comput. Sci. 162 (2006), 261–265. – reference: Annabelle McIver, Tahiry M. Rabehaja, and Georg Struth. 2016. Probabilistic rely-guarantee calculus. Theor. Comput. Sci. 655 (2016), 120–134. 10.1016/j.tcs.2016.01.016 – reference: P.W. O’Hearn. 2007. Resources, concurrency, and local reasoning. TCS 375, 1 (2007), 271–307. 10.1016/j.tcs.2006.12.035 – reference: Wouter Swierstra. 2009. A Hoare Logic for the State Monad. In TPHOLs. 440–451. 10.1007/978-3-642-03359-9_30 – reference: John Boyland. 2003. Checking Interference with Fractional Permissions. In Static Analysis, 10th International Symposium, SAS 2003, San Diego, CA, USA, June 11-13, 2003, Proceedings. 55–72. – reference: Philippe Flajolet. 1985. Approximate Counting: A Detailed Analysis. BIT 25, 1 (1985), 113–134. 10.1007/BF01934993 – reference: Ming Fu, Yong Li, Xinyu Feng, Zhong Shao, and Yu Zhang. 2010. Reasoning about optimistic concurrency using a program logic for history. In CONCUR. 388–402. – reference: Daniele Varacca. 2002. The Powerdomain of Indexed Valuations. In 17th IEEE Symposium on Logic in Computer Science (LICS 2002), 22-25 July 2002, Copenhagen, Denmark, Proceedings. 299. – reference: Jean Goubault-Larrecq. 2007. Continuous Previsions. In Computer Science Logic, 21st International Workshop, CSL 2007, 16th Annual Conference of the EACSL, Lausanne, Switzerland, September 11-15, 2007, Proceedings. 542–557. – reference: Jean Goubault-Larrecq. 2015. Full abstraction for non-deterministic and probabilistic extensions of PCF I: The angelic cases. J. Log. Algebr. Meth. Program. 84, 1 (2015), 155–184. – reference: Gilles Barthe, Benjamin Grégoire, and Santiago Zanella Béguelin. 2012. Probabilistic Relational Hoare Logics for ComputerAided Security Proofs. In Mathematics of Program Construction - 11th International Conference, MPC 2012, Madrid, Spain, June 25-27, 2012. Proceedings. 1–6. 10.1007/978-3-642-31113-0_1 – reference: Gilles Barthe, Thomas Espitau, Benjamin Grégoire, Justin Hsu, Léo Stefanesco, and Pierre-Yves Strub. 2015. Relational Reasoning via Probabilistic Coupling. In Logic for Programming, Artificial Intelligence, and Reasoning - 20th International Conference, LPAR-20 2015, Suva, Fiji, November 24-28, 2015, Proceedings. 387–401. 10.1007/978-3-662-48899-7_27 – reference: C. B. Jones. 1983. Tentative steps toward a development method for interfering programs. TOPLAS 5, 4 (1983), 596–619. 10.1145/69575.69577 – reference: Robert Morris. 1978. Counting Large Numbers of Events in Small Registers. Commun. ACM 21, 10 (1978), 840–842. 10.1145/359619.359627 – reference: Jon Beck. 1969. Distributive laws. In Seminar on Triples and Categorical Homology Theory, B. Eckmann (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 119–140. – reference: Wojciech M. Golab, Lisa Higham, and Philipp Woelfel. 2011. Linearizable implementations do not suffice for randomized distributed computation. In Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, San Jose, CA, USA, 6-8 June 2011. 373–382. 10.1145/1993636.1993687 – reference: Xinyu Feng. 2009. Local rely-guarantee reasoning. In POPL. 315–327. 10.1145/1480881.1480922 – reference: Ralf Jung, Robbert Krebbers, Lars Birkedal, and Derek Dreyer. 2016. Higher-Order Ghost State. In ICFP. 10.1145/2951913.2951943 – reference: Aleksandar Nanevski, J. Gregory Morrisett, and Lars Birkedal. 2008. Hoare type theory, polymorphism and separation. J. Funct. Program. 18, 5-6 (2008), 865–911. 10.1017/S0956796808006953 – reference: Philippe Audebaud and Christine Paulin-Mohring. 2009. Proofs of randomized algorithms in Coq. Sci. Comput. Program. 74, 8 (2009), 568–589. 10.1016/j.scico.2007.09.002 – reference: Nick Benton. 2004. Simple Relational Correctness Proofs for Static Analyses and Program Transformations. In POPL. 10.1145/964001.964003 – reference: Keir Fraser. 2004. Practical lock-freedom. Ph.D. Dissertation. University of Cambridge. – reference: William Pugh. 1990. Skip Lists: A Probabilistic Alternative to Balanced Trees. Commun. ACM 33, 6 (1990), 668–676. 10.1145/78973.78977 – reference: Aaron Turon, Derek Dreyer, and Lars Birkedal. 2013. Unifying refinement and Hoare-style reasoning in a logic for higher-order concurrency. In ICFP. 377–390. 10.1145/2500365.2500600 – reference: Maurice Herlihy, Yossi Lev, Victor Luchangco, and Nir Shavit. 2006. A Provably Correct Scalable Concurrent Skip List (Brief Announcement). In OPODIS. – reference: Ilya Sergey, Aleksandar Nanevski, Anindya Banerjee, and Germán Andrés Delbianco. 2016. Hoare-style specifications as correctness conditions for non-linearizable concurrent objects. In OOPSLA. 92–110. 10.1145/2983990.2983999 – reference: Alejandro Aguirre, Gilles Barthe, Lars Birkedal, Ales Bizjak, Marco Gaboardi, and Deepak Garg. 2018. Relational Reasoning for Markov Chains in a Probabilistic Guarded Lambda Calculus. In ESOP. 214–241. – reference: Gilles Barthe, Marco Gaboardi, Benjamin Grégoire, Justin Hsu, and Pierre-Yves Strub. 2016. A Program Logic for Union Bounds. In ICALP. 107:1–107:15. – reference: Jean-Baptiste Tristan, Joseph Tassarotti, and Guy L. Steele Jr. 2015. Efficient Training of LDA on a GP U by Mean-for-Mode Estimation. In Proceedings of the 32nd International Conference on Machine Learning, ICML 2015, Lille, France, 6-11 July 2015. 59–68. – reference: Morten Krogh-Jespersen, Kasper Svendsen, and Lars Birkedal. 2017. A Relational Model of Types-and-Effects in Higher-Order Concurrent Separation Logic. In POPL. 218–231. 10.1145/3009837.3009877 – reference: T. Lindvall. 2002. Lectures on the Coupling Method. Dover Publications, Incorporated. – reference: Aleksandar Nanevski, Ruy Ley-Wild, Ilya Sergey, and Germán Andrés Delbianco. 2014. Communicating State Transition Systems for Fine-Grained Concurrent Resources. In ESOP. 290–310. 10.1007/978-3-642-54833-8_16 – reference: Pedro da Rocha Pinto, Thomas Dinsdale-Young, and Philippa Gardner. 2014. TaDA: A Logic for Time and Data Abstraction. In ECOOP. 207–231. 10.1007/978-3-662-44202-9_9 – reference: John C. Reynolds. 2002. Separation logic: A logic for shared mutable data structures. In LICS. – reference: Gilles Barthe, Thomas Espitau, Justin Hsu, Tetsuya Sato, and Pierre-Yves Strub. 2017b. *-Liftings for Differential Privacy. In 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland. 102:1–102:12. – reference: Lyle Harold Ramshaw. 1979. Formalizing the Analysis of Algorithms. Ph.D. Dissertation. Stanford University. – reference: Silas Boyd-Wickizer, Austin T. Clements, Yandong Mao, Aleksey Pesterev, M. Frans Kaashoek, Robert Tappan Morris, and Nickolai Zeldovich. 2010. An Analysis of Linux Scalability to Many Cores. In 9th USENIX Symposium on Operating Systems Design and Implementation, OSDI 2010, October 4-6, 2010, Vancouver, BC, Canada, Proceedings. 1–16. – reference: Dexter Kozen. 1981. Semantics of Probabilistic Programs. J. Comput. Syst. Sci. 22, 3 (1981), 328–350. – reference: Gilles Barthe, Benjamin Grégoire, Justin Hsu, and Pierre-Yves Strub. 2017c. Coupling proofs are probabilistic product programs. In POPL. 161–174. 10.1145/3009837.3009896 – reference: Andrew W. Appel. 2014. Program Logics - for Certified Compilers. Cambridge University Press. – reference: Dave Dice, Yossi Lev, and Mark Moir. 2013. Scalable statistics counters. In SPAA. 43–52. 10.1145/2486159.2486182 – reference: Iris Team. 2017. Iris 3.0 Documentation. http://plv.mpi- sws.org/iris/appendix- 3.0.pdf – ident: e_1_2_2_31_1 doi: 10.1016/j.jlamp.2014.09.003 – ident: e_1_2_2_22_1 doi: 10.1145/1480881.1480922 – ident: e_1_2_2_32_1 – ident: e_1_2_2_19_1 doi: 10.1145/360933.360975 – ident: e_1_2_2_29_1 doi: 10.1145/1993636.1993687 – ident: e_1_2_2_41_1 doi: 10.1007/978-3-662-54434-1_26 – volume-title: Lectures on the Coupling Method ident: e_1_2_2_43_1 – ident: e_1_2_2_8_1 doi: 10.1007/978-3-642-31113-0_1 – ident: e_1_2_2_48_1 doi: 10.1145/359619.359627 – ident: e_1_2_2_36_1 doi: 10.1145/69575.69577 – ident: e_1_2_2_58_1 doi: 10.1007/978-3-662-54434-1_34 – ident: e_1_2_2_27_1 doi: 10.1007/978-3-642-15375-4_27 – ident: e_1_2_2_12_1 doi: 10.1145/964001.964003 – ident: e_1_2_2_37_1 doi: 10.1145/2951913.2951943 – ident: e_1_2_2_20_1 doi: 10.1145/2429069.2429104 – ident: e_1_2_2_67_1 doi: 10.1017/S0960129505005074 – ident: e_1_2_2_65_1 doi: 10.1007/978-3-642-02444-3_16 – volume-title: The Powerdomain of Indexed Valuations. In 17th IEEE Symposium on Logic in Computer Science (LICS 2002), 22-25 July 2002, Copenhagen, Denmark, Proceedings. 299 year: 2002 ident: e_1_2_2_66_1 – ident: e_1_2_2_1_1 doi: 10.1007/978-3-319-89884-1_8 – volume-title: Certified Programming with Dependent Types - A Pragmatic Introduction to the Coq Proof Assistant ident: e_1_2_2_16_1 – ident: e_1_2_2_56_1 doi: 10.1145/2983990.2983999 – volume-title: Seminar on Triples and Categorical Homology Theory ident: e_1_2_2_11_1 – ident: e_1_2_2_50_1 doi: 10.1017/S0956796808006953 – ident: e_1_2_2_9_1 doi: 10.1145/3009837.3009896 – ident: e_1_2_2_49_1 doi: 10.1007/978-3-642-54833-8_16 – ident: e_1_2_2_18_1 doi: 10.1145/2486159.2486182 – ident: e_1_2_2_55_1 – ident: e_1_2_2_53_1 doi: 10.1145/78973.78977 – ident: e_1_2_2_46_1 doi: 10.1016/j.entcs.2005.12.113 – ident: e_1_2_2_21_1 doi: 10.1007/978-3-642-14107-2_24 – ident: e_1_2_2_64_1 doi: 10.1007/978-3-540-74407-8_18 – volume-title: 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017 year: 2017 ident: e_1_2_2_6_1 – volume: 107 start-page: 1 year: 2016 ident: e_1_2_2_7_1 article-title: A Program Logic for Union Bounds publication-title: ICALP. – ident: e_1_2_2_62_1 doi: 10.1145/2500365.2500600 – volume-title: 10th International Symposium, SAS 2003, San Diego, CA, USA, June 11-13, 2003, Proceedings. 55–72 year: 2003 ident: e_1_2_2_15_1 – ident: e_1_2_2_38_1 doi: 10.1145/2676726.2676980 – ident: e_1_2_2_26_1 doi: 10.1145/3209108.3209174 – ident: e_1_2_2_33_1 doi: 10.1145/78969.78972 – ident: e_1_2_2_51_1 doi: 10.1016/j.tcs.2006.12.035 – ident: e_1_2_2_47_1 doi: 10.1145/229542.229547 – ident: e_1_2_2_24_1 doi: 10.1007/BF01934993 – volume-title: Probabilistic Couplings for Probabilistic Reasoning. ArXiv e-prints (Oct year: 2017 ident: e_1_2_2_34_1 – ident: e_1_2_2_28_1 doi: 10.1145/2034773.2034777 – ident: e_1_2_2_39_1 doi: 10.1007/978-3-662-49498-1_15 – ident: e_1_2_2_23_1 doi: 10.1007/978-3-540-71316-6_13 – ident: e_1_2_2_40_1 doi: 10.1016/0022-0000(81)90036-2 – volume-title: Joost-Pieter Katoen, Christoph Matheja, and Thomas Noll. year: 2018 ident: e_1_2_2_10_1 – volume-title: Nondeterminism and Probabilistic Choice: Obeying the Laws. In CONCUR 2000 - Concurrency Theory, 11th International Conference, University Park, PA, USA, August 22-25, 2000, Proceedings. 350–364 year: 2000 ident: e_1_2_2_45_1 – volume-title: Program Logics - for Certified Compilers ident: e_1_2_2_2_1 – volume-title: Proceedings of the 32nd International Conference on Machine Learning, ICML 2015 year: 2015 ident: e_1_2_2_61_1 – ident: e_1_2_2_42_1 doi: 10.1145/3009837.3009877 – ident: e_1_2_2_44_1 doi: 10.1016/j.tcs.2016.01.016 – ident: e_1_2_2_52_1 doi: 10.1007/978-3-662-46666-7_4 – volume-title: 21st International Workshop, CSL 2007, 16th Annual Conference of the EACSL, Lausanne, Switzerland, September 11-15, 2007, Proceedings. 542–557 year: 2007 ident: e_1_2_2_30_1 – ident: e_1_2_2_17_1 doi: 10.1007/978-3-662-44202-9_9 – ident: e_1_2_2_59_1 – ident: e_1_2_2_13_1 doi: 10.1007/978-3-662-46678-0_18 – ident: e_1_2_2_60_1 doi: 10.1016/j.entcs.2009.01.002 – ident: e_1_2_2_5_1 – ident: e_1_2_2_57_1 doi: 10.1007/978-3-642-03359-9_30 – ident: e_1_2_2_3_1 doi: 10.1016/j.scico.2007.09.002 – volume-title: 9th USENIX Symposium on Operating Systems Design and Implementation, OSDI 2010, October 4-6, 2010, Vancouver, BC, Canada, Proceedings. 1–16 year: 2010 ident: e_1_2_2_14_1 – ident: e_1_2_2_4_1 doi: 10.1007/978-3-662-48899-7_27 |
| SSID | ssj0001934839 |
| Score | 2.3315082 |
| Snippet | We present Polaris, a concurrent separation logic with support for probabilistic reasoning. As part of our logic, we extend the idea of coupling, which... |
| SourceID | crossref acm |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 1 |
| SubjectTerms | Logic Program reasoning Program verification Semantics and reasoning Separation logic Theory of computation |
| SubjectTermsDisplay | Theory of computation -- Logic -- Separation logic Theory of computation -- Semantics and reasoning -- Program reasoning -- Program verification |
| Title | A separation logic for concurrent randomized programs |
| URI | https://dl.acm.org/doi/10.1145/3290377 |
| Volume | 3 |
| WOSCitedRecordID | wos000678450300064&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 2475-1421 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001934839 issn: 2475-1421 databaseCode: M~E dateStart: 20170101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3Nb9MwFLegcOCywQDRbSAfEBdkiD8S28dqGuLARg9F6q1yHFuqRNOqLVO1w_72PSdOagoScOBiRdazlfjnvPf8_D4QeltY6nIuJSlL54jQVJDSFwUR0OmUkyByfVNsQl5fq-lUj2NV1E1TTkDWtdrt9Oq_Qg19AHYInf0HuPtJoQOeAXRoAXZo_wr40fuNaxN6A7ANZ2tcCeHca2MuJhBP1XIxv3VV5561SXXUcS_TGjeP0cVVuFGIlItgWuiMnL0-PgEV3KyX29Y3IN4q9LxtvXKJF3dqZwihTZRkiemRCZkTKtp45g_uN32Rn_Jk24y_jr8k7JEmcra9jvmVg4uQ7IIznfFY3-WnHNkHsqv3KGzjq_NZHPgQPWIy14HNXd0lRjfNhWqqy_Vv3gZSh7Ef49igp9hFoqckCsfkKTqKJwU8ahF-hh64-gQdd1U4cGTKz1E-wnvAcQM4BsDxHnC8Bxx3gL9A3z5dTi4-k1gMgxgu-JbkmntVeumqijFbUOclrbxRngrPvDWKS8tKz6StCvgQ453itNKFKS2cUjnjL9GgXtbuFcJGZqC1m6wwmRKca6OV9aYERRb-Z6bFEJ3AAsxWbbqTbkmH6F23IDMb88eHMibfZwdrP0S4J-zmOCA5_TPJGXqy34XnaLBd_3Cv0WN7s51v1m8aWO8BSTxd1Q |
| linkProvider | ISSN International Centre |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+separation+logic+for+concurrent+randomized+programs&rft.jtitle=Proceedings+of+ACM+on+programming+languages&rft.au=Tassarotti%2C+Joseph&rft.au=Harper%2C+Robert&rft.date=2019-01-02&rft.issn=2475-1421&rft.eissn=2475-1421&rft.volume=3&rft.issue=POPL&rft.spage=1&rft.epage=30&rft_id=info:doi/10.1145%2F3290377&rft.externalDBID=n%2Fa&rft.externalDocID=10_1145_3290377 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2475-1421&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2475-1421&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2475-1421&client=summon |