Please use this identifier to cite or link to this item:
|Title:||Logical reasoning for disjoint permissions||Authors:||Le X.-B.
|Issue Date:||2018||Publisher:||Springer Verlag||Citation:||Le X.-B., Hobor A. (2018). Logical reasoning for disjoint permissions. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 10801 LNCS : 385-414. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-319-89884-1_14||Abstract:||Resource sharing is a fundamental phenomenon in concurrent programming where several threads have permissions to access a common resource. Logics for verification need to capture the notion of permission ownership and transfer. One typical practice is the use of rational numbers in (0, 1] as permissions in which 1 is the full permission and the rest are fractional permissions. Rational permissions are not a good fit for separation logic because they remove the essential “disjointness” feature of the logic itself. We propose a general logic framework that supports permission reasoning in separation logic while preserving disjointness. Our framework is applicable to sophisticated verification tasks such as doing induction over the finiteness of the heap within the object logic or carrying out biabductive inference. We can also prove precision of recursive predicates within the object logic. We developed the ShareInfer tool to benchmark our techniques. We introduce “scaling separation algebras,” a compositional extension of separation algebras, to model our logic, and use them to construct a concrete model. © The Author(s) 2018.||Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)||URI:||https://scholarbank.nus.edu.sg/handle/10635/175138||ISSN:||0302-9743||DOI:||10.1007/978-3-319-89884-1_14|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
|10_1007_978-3-319-89884-1_14.pdf||1.03 MB||Adobe PDF|
checked on Sep 27, 2022
checked on Sep 22, 2022
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.