Iron: managing obligations in higher-order concurrent separation logic
Precise management of resources and the obligations they impose, such as the need to dispose of memory, close locks, and release file handles, is hard---especially in the presence of concurrency, when some resources are shared, and different threads operate on them concurrently. We present Iron, a n...
Gespeichert in:
| Veröffentlicht in: | Proceedings of ACM on programming languages Jg. 3; H. POPL; S. 1 - 30 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
New York, NY, USA
ACM
02.01.2019
|
| Schlagworte: | |
| ISSN: | 2475-1421, 2475-1421 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | Precise management of resources and the obligations they impose, such as the need to dispose of memory, close locks, and release file handles, is hard---especially in the presence of concurrency, when some resources are shared, and different threads operate on them concurrently. We present Iron, a novel higher-order concurrent separation logic that allows for precise reasoning about resources that are transferable among dynamically allocated threads. In particular, Iron can be used to show the correctness of challenging examples, where the reclamation of memory is delegated to a forked-off thread. We show soundness of Iron by means of a model of Iron, defined on top of the Iris base logic, and we use this model to prove that memory resources are accounted for precisely and not leaked. We have formalized all of the developments in the Coq proof assistant. |
|---|---|
| AbstractList | Precise management of resources and the obligations they impose, such as the need to dispose of memory, close locks, and release file handles, is hard---especially in the presence of concurrency, when some resources are shared, and different threads operate on them concurrently. We present Iron, a novel higher-order concurrent separation logic that allows for precise reasoning about resources that are transferable among dynamically allocated threads. In particular, Iron can be used to show the correctness of challenging examples, where the reclamation of memory is delegated to a forked-off thread. We show soundness of Iron by means of a model of Iron, defined on top of the Iris base logic, and we use this model to prove that memory resources are accounted for precisely and not leaked. We have formalized all of the developments in the Coq proof assistant. |
| ArticleNumber | 65 |
| Author | Birkedal, Lars Gratzer, Daniel Krebbers, Robbert Bizjak, Aleš |
| Author_xml | – sequence: 1 givenname: Aleš surname: Bizjak fullname: Bizjak, Aleš email: abizjak@cs.au.dk organization: Aarhus University, Denmark – sequence: 2 givenname: Daniel surname: Gratzer fullname: Gratzer, Daniel email: gratzer@cs.au.dk organization: Aarhus University, Denmark – sequence: 3 givenname: Robbert surname: Krebbers fullname: Krebbers, Robbert email: mail@robbertkrebbers.nl organization: Delft University of Technology, Netherlands – sequence: 4 givenname: Lars surname: Birkedal fullname: Birkedal, Lars email: birkedal@cs.au.dk organization: Aarhus University, Denmark |
| BookMark | eNpt0E1LAzEQBuAgFay1ePeUm6dovjbJepNia6HgRc_LbDa7jewmJVkP_nu1rSLiaQbm4WV4z9EkxOAQumT0hjFZ3ApeUqHNCZpyqQvCJGeTX_sZmuf8SillpZBGlFO0XKcY7vAAATofOhzr3ncw-hgy9gFvfbd1icTUuIRtDPYtJRdGnN0O0p7hPnbeXqDTFvrs5sc5Qy_Lh-fFI9k8rdaL-w0BrvVIeGsaTW3bFE5pC7UUDWO1AiVsTY1Q1rZAQWrFWyEaKKhiShhnSmsUV8qJGSKHXJtizsm1lfXj_o8xge8rRquvHqpjD5_--o_fJT9Aev9HXh0k2OEHfR8_AKa6Znw |
| CitedBy_id | crossref_primary_10_1145_3689755 crossref_primary_10_1145_3434299 crossref_primary_10_1145_3632889 crossref_primary_10_1145_3689732 crossref_primary_10_1145_3632848 crossref_primary_10_1145_3477082 crossref_primary_10_1145_3371115 crossref_primary_10_1145_3408998 crossref_primary_10_1145_3434286 |
| Cites_doi | 10.1007/978-3-642-37036-6_11 10.1007/978-3-662-44202-9_9 10.1145/3236772 10.1016/j.tcs.2006.12.035 10.1007/978-3-642-14107-2_24 10.1007/3-540-44898-5_4 10.1145/2676726.2676980 10.1007/978-3-662-54434-1_26 10.1145/373243.375719 10.1145/1480881.1480922 10.1007/978-3-642-54833-8_9 10.1007/978-3-662-54434-1_34 10.1145/1217935.1217953 10.1145/2951913.2951943 10.1145/2500365.2500600 10.1145/3133911 10.1007/978-3-540-71316-6_13 10.1145/3009837.3009855 10.1007/978-3-642-54833-8_16 |
| ContentType | Journal Article |
| Copyright | Owner/Author |
| Copyright_xml | – notice: Owner/Author |
| DBID | AAYXX CITATION |
| DOI | 10.1145/3290378 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | CrossRef |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 2475-1421 |
| EndPage | 30 |
| ExternalDocumentID | 10_1145_3290378 3290378 |
| GrantInformation_xml | – fundername: Natur og Univers, Det Frie Forskningsråd funderid: http://dx.doi.org/10.13039/100008394 |
| GroupedDBID | AAKMM AAYFX ACM ADPZR AIKLT ALMA_UNASSIGNED_HOLDINGS EBS GUFHI LHSKQ M~E OK1 ROL AAYXX AEFXT AEJOY AKRVB CITATION |
| ID | FETCH-LOGICAL-a277t-2f8d70cfd5e67cab43d11b6a63cb0836ccfa0a4762f33da5061638e89c86266e3 |
| ISICitedReferencesCount | 12 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000678450300065&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:02:26 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 | resource management Separation logic concurrency |
| Language | English |
| License | This work is licensed under a Creative Commons Attribution International 4.0 License. |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-a277t-2f8d70cfd5e67cab43d11b6a63cb0836ccfa0a4762f33da5061638e89c86266e3 |
| OpenAccessLink | https://dl.acm.org/doi/10.1145/3290378 |
| PageCount | 30 |
| ParticipantIDs | crossref_citationtrail_10_1145_3290378 crossref_primary_10_1145_3290378 acm_primary_3290378 |
| 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 | Manuel Fähndrich, Mark Aiken, Chris Hawblitzel, Orion Hodson, Galen Hunt, James R. Larus, and Steven Levi. 2006. Language support for fast and reliable message-based communication in singularity os. In EuroSys. Alexey Gotsman, Josh Berdine, Byron Cook, Noam Rinetzky, and Mooly Sagiv. 2007. Local reasoning about storable locks and threads. In APLAS. Thomas Dinsdale-Young, Mike Dodds, Philippa Gardner, Matthew J. Parkinson, and Viktor Vafeiadis. 2010. Concurrent abstract predicates. In ECOOP. Aquinas Hobor, Andrew W. Appel, and Francesco Zappa Nardelli. 2008. Oracle semantics for concurrent separation logic. In ESOP. 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. 10.1007/978-3-642-54833-8_16 Ralf Jung, Robbert Krebbers, Lars Birkedal, and Derek Dreyer. 2016. Higher-order ghost state. In ICFP. 10.1145/2951913.2951943 Kasper Svendsen and Lars Birkedal. 2014. Impredicative concurrent abstract predicates. In ESOP. 10.1007/978-3-642-54833-8_9 Ming Fu, Yong Li, Xinyu Feng, Zhong Shao, and Yu Zhang. 2010. Reasoning about optimistic concurrency using a program logic for history. In CONCUR. Xinyu Feng, Rodrigo Ferreira, and Zhong Shao. 2007. On the relationship between concurrent separation logic and assume-guarantee reasoning. In ESOP. William Mansky, Andrew W. Appel, and Aleksey Nogin. 2017. A verified messaging system. In OOPSLA. 10.1145/3133911 Pedro da Rocha Pinto, Thomas Dinsdale-Young, and Philippa Gardner. 2014. TaDA: A logic for time and data abstraction. In ECOOP. 10.1007/978-3-662-44202-9_9 Viktor Vafeiadis and Matthew Parkinson. 2007. A marriage of rely/guarantee and separation logic. In CONCUR. Aaron Turon, Derek Dreyer, and Lars Birkedal. 2013. Unifying refinement and Hoare-style reasoning in a logic for higher-order concurrency. In ICFP. 10.1145/2500365.2500600 Peter W. O’Hearn. 2007. Resources, concurrency, and local reasoning. TCS (2007). 10.1016/j.tcs.2006.12.035 Qinxiang Cao, Santiago Cuellar, and Andrew W. Appel. 2017. Bringing order to the separation logic jungle. In APLAS. Robbert Krebbers, Amin Timany, and Lars Birkedal. 2017b. Interactive proofs in higher-order concurrent separation logic. In POPL. 10.1145/3009837.3009855 Kasper Svendsen, Lars Birkedal, and Matthew J. Parkinson. 2013. Modular reasoning about separation of concurrent data structures. In ESOP. 169–188. 10.1007/978-3-642-37036-6_11 Joseph Tassarotti, Ralf Jung, and Robert Harper. 2017. A higher-order logic for concurrent termination-preserving refinement. In ESOP. 10.1007/978-3-662-54434-1_34 John C. Reynolds. 2000. Intuitionistic reasoning about shared mutable data structure. In Millennial Perspectives in Computer Science. 303–321. John C. Reynolds. 2002. Separation logic: A logic for shared mutable data structures. In LICS. Robbert Krebbers, Jacques-Henri Jourdan, Ralf Jung, Joseph Tassarotti, Jan-Oliver Kaiser, Amin Timany, Arthur Charguéraud, and Derek Dreyer. 2018. MoSeL: A general, extensible modal framework for interactive proofs in separation logic. ICFP (2018). 10.1145/3236772 Xinyu Feng. 2009. Local rely-guarantee reasoning. In POPL. 10.1145/1480881.1480922 Samin S. Ishtiaq and Peter W. O’Hearn. 2001. BI as an assertion language for mutable data structures. ACM SIGPLAN Notices (2001). 10.1145/373243.375719 John Boyland. 2003. Checking interference with fractional permissions. In SAS. Robbert Krebbers, Ralf Jung, Aleš Bizjak, Jacques-Henri Jourdan, Derek Dreyer, and Lars Birkedal. 2017a. The essence of higher-order concurrent separation logic. In ESOP. 10.1007/978-3-662-54434-1_26 Lars Birkedal and Aleš Bizjak. 2017. Lecture Notes on Iris: Higher-Order Concurrent Separation Logic. http://iris- project. org/tutorial- pdfs/iris- lecture- notes.pdf . Ralf Jung, Robbert Krebbers, Jacques-Henri Jourdan, Aleš Bizjak, Lars Birkedal, and Derek Dreyer. 2018. Iris from the ground up: A modular foundation for higher-order concurrent separation logic. JFP (2018). To Appear. 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. 10.1145/2676726.2676980 e_1_2_2_4_1 e_1_2_2_25_1 e_1_2_2_5_1 e_1_2_2_24_1 e_1_2_2_6_1 e_1_2_2_23_1 e_1_2_2_7_1 e_1_2_2_22_1 e_1_2_2_21_1 e_1_2_2_1_1 e_1_2_2_20_1 e_1_2_2_2_1 e_1_2_2_9_1 e_1_2_2_8_1 e_1_2_2_28_1 e_1_2_2_27_1 e_1_2_2_26_1 e_1_2_2_13_1 e_1_2_2_12_1 e_1_2_2_11_1 e_1_2_2_10_1 Jung Ralf (e_1_2_2_14_1) 2018 e_1_2_2_19_1 e_1_2_2_18_1 e_1_2_2_17_1 e_1_2_2_16_1 e_1_2_2_15_1 Cao Qinxiang (e_1_2_2_3_1) 2017 |
| References_xml | – reference: Peter W. O’Hearn. 2007. Resources, concurrency, and local reasoning. TCS (2007). 10.1016/j.tcs.2006.12.035 – reference: Xinyu Feng, Rodrigo Ferreira, and Zhong Shao. 2007. On the relationship between concurrent separation logic and assume-guarantee reasoning. In ESOP. – 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. – reference: Viktor Vafeiadis and Matthew Parkinson. 2007. A marriage of rely/guarantee and separation logic. In CONCUR. – reference: Samin S. Ishtiaq and Peter W. O’Hearn. 2001. BI as an assertion language for mutable data structures. ACM SIGPLAN Notices (2001). 10.1145/373243.375719 – 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. 10.1145/2676726.2676980 – reference: Robbert Krebbers, Amin Timany, and Lars Birkedal. 2017b. Interactive proofs in higher-order concurrent separation logic. In POPL. 10.1145/3009837.3009855 – reference: Joseph Tassarotti, Ralf Jung, and Robert Harper. 2017. A higher-order logic for concurrent termination-preserving refinement. In ESOP. 10.1007/978-3-662-54434-1_34 – reference: Ralf Jung, Robbert Krebbers, Lars Birkedal, and Derek Dreyer. 2016. Higher-order ghost state. In ICFP. 10.1145/2951913.2951943 – reference: Robbert Krebbers, Ralf Jung, Aleš Bizjak, Jacques-Henri Jourdan, Derek Dreyer, and Lars Birkedal. 2017a. The essence of higher-order concurrent separation logic. In ESOP. 10.1007/978-3-662-54434-1_26 – 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. 10.1007/978-3-642-54833-8_16 – reference: John C. Reynolds. 2000. Intuitionistic reasoning about shared mutable data structure. In Millennial Perspectives in Computer Science. 303–321. – reference: Alexey Gotsman, Josh Berdine, Byron Cook, Noam Rinetzky, and Mooly Sagiv. 2007. Local reasoning about storable locks and threads. In APLAS. – reference: Aquinas Hobor, Andrew W. Appel, and Francesco Zappa Nardelli. 2008. Oracle semantics for concurrent separation logic. In ESOP. – reference: Pedro da Rocha Pinto, Thomas Dinsdale-Young, and Philippa Gardner. 2014. TaDA: A logic for time and data abstraction. In ECOOP. 10.1007/978-3-662-44202-9_9 – reference: Thomas Dinsdale-Young, Mike Dodds, Philippa Gardner, Matthew J. Parkinson, and Viktor Vafeiadis. 2010. Concurrent abstract predicates. In ECOOP. – reference: William Mansky, Andrew W. Appel, and Aleksey Nogin. 2017. A verified messaging system. In OOPSLA. 10.1145/3133911 – reference: John Boyland. 2003. Checking interference with fractional permissions. In SAS. – reference: Kasper Svendsen and Lars Birkedal. 2014. Impredicative concurrent abstract predicates. In ESOP. 10.1007/978-3-642-54833-8_9 – reference: Qinxiang Cao, Santiago Cuellar, and Andrew W. Appel. 2017. Bringing order to the separation logic jungle. In APLAS. – reference: John C. Reynolds. 2002. Separation logic: A logic for shared mutable data structures. In LICS. – reference: Robbert Krebbers, Jacques-Henri Jourdan, Ralf Jung, Joseph Tassarotti, Jan-Oliver Kaiser, Amin Timany, Arthur Charguéraud, and Derek Dreyer. 2018. MoSeL: A general, extensible modal framework for interactive proofs in separation logic. ICFP (2018). 10.1145/3236772 – reference: Aaron Turon, Derek Dreyer, and Lars Birkedal. 2013. Unifying refinement and Hoare-style reasoning in a logic for higher-order concurrency. In ICFP. 10.1145/2500365.2500600 – reference: Kasper Svendsen, Lars Birkedal, and Matthew J. Parkinson. 2013. Modular reasoning about separation of concurrent data structures. In ESOP. 169–188. 10.1007/978-3-642-37036-6_11 – reference: Manuel Fähndrich, Mark Aiken, Chris Hawblitzel, Orion Hodson, Galen Hunt, James R. Larus, and Steven Levi. 2006. Language support for fast and reliable message-based communication in singularity os. In EuroSys. – reference: Xinyu Feng. 2009. Local rely-guarantee reasoning. In POPL. 10.1145/1480881.1480922 – reference: Lars Birkedal and Aleš Bizjak. 2017. Lecture Notes on Iris: Higher-Order Concurrent Separation Logic. http://iris- project. org/tutorial- pdfs/iris- lecture- notes.pdf . – reference: Ralf Jung, Robbert Krebbers, Jacques-Henri Jourdan, Aleš Bizjak, Lars Birkedal, and Derek Dreyer. 2018. Iris from the ground up: A modular foundation for higher-order concurrent separation logic. JFP (2018). To Appear. – ident: e_1_2_2_25_1 doi: 10.1007/978-3-642-37036-6_11 – volume-title: Iris from the ground up: A modular foundation for higher-order concurrent separation logic. JFP year: 2018 ident: e_1_2_2_14_1 – ident: e_1_2_2_1_1 – ident: e_1_2_2_4_1 doi: 10.1007/978-3-662-44202-9_9 – ident: e_1_2_2_16_1 doi: 10.1145/3236772 – ident: e_1_2_2_21_1 doi: 10.1016/j.tcs.2006.12.035 – ident: e_1_2_2_5_1 doi: 10.1007/978-3-642-14107-2_24 – ident: e_1_2_2_2_1 doi: 10.1007/3-540-44898-5_4 – ident: e_1_2_2_15_1 doi: 10.1145/2676726.2676980 – ident: e_1_2_2_17_1 doi: 10.1007/978-3-662-54434-1_26 – ident: e_1_2_2_23_1 – ident: e_1_2_2_12_1 doi: 10.1145/373243.375719 – ident: e_1_2_2_7_1 doi: 10.1145/1480881.1480922 – ident: e_1_2_2_24_1 doi: 10.1007/978-3-642-54833-8_9 – ident: e_1_2_2_26_1 doi: 10.1007/978-3-662-54434-1_34 – ident: e_1_2_2_6_1 doi: 10.1145/1217935.1217953 – ident: e_1_2_2_13_1 doi: 10.1145/2951913.2951943 – ident: e_1_2_2_28_1 – ident: e_1_2_2_11_1 – volume-title: Appel year: 2017 ident: e_1_2_2_3_1 – ident: e_1_2_2_27_1 doi: 10.1145/2500365.2500600 – ident: e_1_2_2_19_1 doi: 10.1145/3133911 – ident: e_1_2_2_8_1 doi: 10.1007/978-3-540-71316-6_13 – ident: e_1_2_2_22_1 – ident: e_1_2_2_18_1 doi: 10.1145/3009837.3009855 – ident: e_1_2_2_20_1 doi: 10.1007/978-3-642-54833-8_16 – ident: e_1_2_2_9_1 – ident: e_1_2_2_10_1 |
| SSID | ssj0001934839 |
| Score | 2.1910474 |
| Snippet | Precise management of resources and the obligations they impose, such as the need to dispose of memory, close locks, and release file handles, is... |
| SourceID | crossref acm |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 1 |
| SubjectTerms | Logic Operational semantics Program reasoning Program semantics Program verification Programming logic Semantics and reasoning Separation logic Theory of computation |
| SubjectTermsDisplay | Theory of computation -- Logic -- Programming logic Theory of computation -- Logic -- Separation logic Theory of computation -- Semantics and reasoning -- Program reasoning -- Program verification Theory of computation -- Semantics and reasoning -- Program semantics -- Operational semantics |
| Title | Iron: managing obligations in higher-order concurrent separation logic |
| URI | https://dl.acm.org/doi/10.1145/3290378 |
| Volume | 3 |
| WOSCitedRecordID | wos000678450300065&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/eLvHCXMwtV1Nb9QwELWWwoELHwXEQlv5QLkgQ2I7ccJttaIFaVtWqEi9rWzHEaW7aZUuVdUD_4L_i8d2su6CBBy4RJFlO5HnaTwez7xB6EViNWMNxxLJUkYg7oKUpq6IyimvhCoUl47EdSIOD4vj43I6GPzocmEu56Jpiqur8vy_itq2WWFD6uw_iLuf1DbYdyt0-7Rit8-_EvyH1kdrLPoKRGrueDRCzPgXF9lBHOcmBJ3rwNB0YTwNuIWD04ex2TrttzkX-TEaH8AlQ4jtWsBHOr9n5HW__ipPQw7N7jjbHfXC3befufZQ8RnuvdZvjVKhaNunM3hdrqZrT03lqhO8msj2hrcCEqRSkkQOTMpFRlLus6Jfm9-0Ba3MIvBNP04nkZJNo93aX-r8ug9woMxgtEyYrxB0k2l7bQfs4xJ9lnY2CwNvodtUZCUoy4PvkeuuZLxwNer6P_fp2DD2TRgL1o5eRNZOZLYcPUD3wnkDjzxOHqKBaTbR_a6WBw6q_RHaA9i8xR1ocAQafNLgGDR4BRq8Ag12oHmMPu-9Oxq_J6HGBpFUiCWhdVGJRNdVZnKhpeKsSlOVy5xpBcTlWtcykdxumTVjlcys-Wc1tilKDUfh3LAnaKM5a8xThOGoayhNagFmqlQypybhQmlhjUhp6BBt2hWZnXsWlW6Nh-hlt0IzHWjpoTrKfLYmjCHCfcdujrUuz_7c5Tm6u4LlFtpYtt_MNrqjL5cnF-2Ok_NPVkZ5yQ |
| 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=Iron%3A+managing+obligations+in+higher-order+concurrent+separation+logic&rft.jtitle=Proceedings+of+ACM+on+programming+languages&rft.au=Bizjak%2C+Ale%C5%A1&rft.au=Gratzer%2C+Daniel&rft.au=Krebbers%2C+Robbert&rft.au=Birkedal%2C+Lars&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%2F3290378&rft.externalDBID=n%2Fa&rft.externalDocID=10_1145_3290378 |
| 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 |