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

Dwyer, Matthew B.; Hatcliff, John; Robby, .; Ranganath, Venkatesh-Prasad

doi:10.1023/b:form.0000040028.49845.67

Cited by 65 publications

(67 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

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%

“…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%

“…3. The approach of [5] provides limited benefit on this benchmark because it does not contain much thread-local or lock-protected data.…”

Section: Fig 1 Two Threads Implementing Robotsmentioning

confidence: 99%

“…A number of recent techniques have considered various kinds of exclusive access predicates for shared variables that specify synchronization disciplines such as "this variable is only accessed when holding its protecting lock" or "this variable is local to this thread" [15,16,5,7]. These exclusive access predicates can be leveraged to dynamically infer persistent transitions, and so reduce the search space.…”

Section: Related Workmentioning

confidence: 99%

“…At the same time, exclusive access predicates can be verified or inferred during reduced state-space exploration. These techniques of [5,16] in particular have demonstrated significant performance improvements for the common cases of thread-local and lock-protected data. However, these techniques are less effective when the synchronization discipline changes during program execution, such as when an object is protected by different variables at different stages during the program's execution.…”

Section: Related Workmentioning

confidence: 99%

See 4 more Smart Citations

Cartesian Partial-Order Reduction

Gueta

Flanagan

Yahav³

et al.

Model Checking Software

View full text Add to dashboard Cite

Abstract. Verifying concurrent programs is challenging since the number of thread interleavings that need to be explored can be huge even for moderate programs. We present a cartesian semantics that reduces the amount of nondeterminism in concurrent programs by delaying unnecessary context switches. Using this semantics, we construct a novel dynamic partial-order reduction algorithm. We have implemented our algorithm and evaluate it on a small set of benchmarks. Our preliminary experimental results show a significant potential saving in the number of explored states and transitions.

show abstract

Section: Partial Order Reductionmentioning

confidence: 99%

Section: Partial Order Reductionmentioning

confidence: 99%

“…3. The approach of [5] provides limited benefit on this benchmark because it does not contain much thread-local or lock-protected data.…”

Section: Fig 1 Two Threads Implementing Robotsmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 3 more Smart Citations

Cartesian Partial-Order Reduction

Gueta

Flanagan

Yahav³

et al.

Model Checking Software

View full text Add to dashboard Cite

show abstract

Building Your Own Software Model Checker Using the Bogor Extensible Model Checking Framework

Dwyer

Hatcliff

Hoosier

et al. 2005

Computer Aided Verification

Self Cite

View full text Add to dashboard Cite

Model checking has proven to be an effective technology for verification and debugging in hardware and more recently in software domains. We believe that recent trends in both the requirements for software systems and the processes by which systems are developed suggest that domain-specific model checking engines may be more effective than general purpose model checking tools. To overcome limitations of existing tools which tend to be monolithic and non-extensible, we have developed an extensible and customizable model checking framework called Bogor. In this tool paper, we summarize (a) Bogor's direct support for modeling object-oriented designs and implementations, (b) its facilities for extending and customizing its modeling language and algorithms to create domain-specific model checking engines, and (c) pedagogical materials that we have developed to describe the construction of model checking tools built on top of the Bogor infrastructure.

show abstract

Extending JML for Modular Specification and Verification of Multi-threaded Programs

Rodríguez

Dwyer

Flanagan

et al. 2005

ECOOP 2005 - Object-Oriented Programming

Self Cite

View full text Add to dashboard Cite

Abstract. The Java Modeling Language (JML) is a formal specification language for Java that allows developers to specify rich software contracts for interfaces and classes, using pre-and postconditions and invariants. Although JML has been widely studied and has robust tool support based on a variety of automated verification technologies, it shares a problem with many similar object-oriented specification languages-it currently only deals with sequential programs. In this paper, we extend JML to allow for effective specification of multi-threaded Java programs. The new constructs rely on the non-interference notion of method atomicity, and allow developers to specify locking and other non-interference properties of methods. Atomicity enables effective specification of method pre-and postconditions and supports Hoare-style modular reasoning about methods. Thus the new constructs mesh well with JML's existing features. We validate the specification language design by specifying the behavior of a number of complex Java classes designed for use in multi-threaded programs. We also demonstrate that it is amenable to automated verification using model checking technology.

show abstract

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

Cited by 65 publications

References 28 publications

Cartesian Partial-Order Reduction

Cartesian Partial-Order Reduction

Building Your Own Software Model Checker Using the Bogor Extensible Model Checking Framework

Extending JML for Modular Specification and Verification of Multi-threaded Programs

Contact Info

Product

Resources

About