Threads as Resource for Concurrency Verification

Le, Duy-Khanh; Chin, Wei-Ngan; Teo, Yong Meng

doi:10.1145/2678015.2682540

Cited by 5 publications

(4 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It also allows simple and restrictive forms of scaling permissions which can be applied uniformly over standard predicates. On the other hand, HIP/SLEEK [31] uses rationals to model "thread as resource" so that the ownership of a thread and its resources can be transferred. Chalice [36] has rational permissions to verify properties of multi-threaded, objected-based programs such as data races and dead-locks.…”

Section: Related Workmentioning

confidence: 99%

“…that there are no dangerous races. Many subsequent program logics [18,20,30,31,45] have introduced increasingly sophisticated notions of "resource disjointness" for the Parallel rule. Fractional permissions (also called "shares") are a relatively simple enhancement to separation logic's original notion of disjointness [4].…”

Section: Introductionmentioning

confidence: 99%

“…More modern logics allow for a variety of more flexible share policies [13,28,42], but our techniques still apply. Fractional permissions are less expressive than the "protocol-based" notions of disjointness used in program logics such as FCSL [38,44], Iris [30], and TaDa [16], but are well-suited for common concurrent programming patterns such as read sharing and so have been incorporated into many program logics and verification tools [19,26,28,31,36,41].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Logical Reasoning for Disjoint Permissions

Hobor

2018

Programming Languages and Systems

View full text Add to dashboard Cite

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.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Logical Reasoning for Disjoint Permissions

Hobor

2018

Programming Languages and Systems

View full text Add to dashboard Cite

show abstract

“…For example, a memory cell can be "fully owned" by a thread, permitting both reading and writing; "partially owned", permitting only reading; or "unowned", permitting nothing; the initial model of fractional shares [8] was rationals in [0, 1]. Since their introduction, many program logics have used a variety of flavors of fractional permissions to verify programs [8,7,33,18,3,37,2,24,38,15,26,14].…”

Section: Introductionmentioning

confidence: 99%

Complexity Analysis of Tree Share Structure

Hobor

Lin

2018

Programming Languages and Systems

View full text Add to dashboard Cite

The tree share structure proposed by Dockins et al. is an elegant model for tracking disjoint ownership in concurrent separation logic, but decision procedures for tree shares are hard to implement due to a lack of a systematic theoretical study. We show that the first-order theory of the full Boolean algebra of tree shares (that is, with all treeshare constants) is decidable and has the same complexity as of the firstorder theory of Countable Atomless Boolean Algebras. We prove that combining this additive structure with a constant-restricted unary multiplicative "relativization" operator has a non-elementary lower bound. We examine the consequences of this lower bound and prove that it comes from the combination of both theories by proving an upper bound on a generalization of the restricted multiplicative theory in isolation.

show abstract

A Certified Decision Procedure for Tree Shares

Nguyen

Chin

et al. 2017

Formal Methods and Software Engineering

View full text Add to dashboard Cite

Threads as Resource for Concurrency Verification

Cited by 5 publications

References 22 publications

Logical Reasoning for Disjoint Permissions

Logical Reasoning for Disjoint Permissions

Complexity Analysis of Tree Share Structure

A Certified Decision Procedure for Tree Shares

Contact Info

Product

Resources

About