2004
DOI: 10.1023/b:form.0000040028.49845.67
|View full text |Cite
|
Sign up to set email alerts
|

Exploiting Object Escape and Locking Information in Partial-Order Reductions for Concurrent Object-Oriented Programs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
67
0

Year Published

2005
2005
2006
2006

Publication Types

Select...
6

Relationship

3
3

Authors

Journals

citations
Cited by 65 publications
(67 citation statements)
references
References 28 publications
0
67
0
Order By: Relevance
“…75] and "persistent sets" [8, pp. transition is established as persistent by checking for its potential collisions with an infinite future of another thread. Such collisions are traditionally detected via static analysis (e.g., [5]), which may yield coarse results for complicated or pointer-rich code. Alternatively, dynamic partial order reduction [6] infers persistent sets dynamically as part of a stateless search, but is applicable only to cycle-free systems.…”
Section: Partial Order Reductionmentioning
confidence: 99%
See 4 more Smart Citations
“…75] and "persistent sets" [8, pp. transition is established as persistent by checking for its potential collisions with an infinite future of another thread. Such collisions are traditionally detected via static analysis (e.g., [5]), which may yield coarse results for complicated or pointer-rich code. Alternatively, dynamic partial order reduction [6] infers persistent sets dynamically as part of a stateless search, but is applicable only to cycle-free systems.…”
Section: Partial Order Reductionmentioning
confidence: 99%
“…Alternatively, dynamic partial order reduction [6] infers persistent sets dynamically as part of a stateless search, but is applicable only to cycle-free systems. The algorithm of [5] also infers persistent sets dynamically, but only for thread-local and lock-protected data.…”
Section: Partial Order Reductionmentioning
confidence: 99%
See 3 more Smart Citations