J. Corbett. Using shape analysis to reduce nite-state models of concurrentjava programs. In Proceedings of the International Symposium on Software Testing and Analysis, March 1998.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....site. All other nodes allocated at this site would be represented by a summary node. With this approach, the analysis would perform strong updates for all inside nodes, and weak updates only for summary nodes. Similar approaches have been proposed for intraprocedural shape analysis algorithms [24, 12]. 4.11 An Optimization for Static Class Variables In the absence of information about how parallel threads access static class variables, the extracted analysis information imposes no limit on the lifetimes or points to relationships of objects reachable from these variables. The implemented ....

....precise information about its points to relationships. It is important to realize that this is a key design decision that allows us to obtain good escape analysis results with what is essentially a local analysis. Corbett describes a shape analysis algorithm for multithreaded Java programs [12]. The algorithm can be used to nd objects that are accessible to a single thread or objects that are accessed by at most one thread at any given time. The goal is to use this information to reduce the size of the state space explored by a model checker. The algorithm is intraprocedural, and does ....

J. Corbett. Using shape analysis to reduce nite-state models of concurrent java programs. In Proceedings of the International Symposium on Software Testing and Analysis, March 1998.

....in Section 11. Our results fall into two categories: results in Sections 4 8 for systems known to satisfy MLD, and results in Section 9 for systems expected to satisfy MLD. Static analyses like Extended Static Checking [DLNS98] types for safe locking [FA99] and protected variable analysis [Cor00] can conservatively determine whether a system satis es MLD. For such systems, MLD constrains the set of objects that may be accessed by a transition (based on the set of locks held by the thread performing the transition) and this information can be used to constrain dependency between ....

....has more overhead than our bytecode rewriting approach. It incorporates partial order reductions, as in Spin [HP94] but does not exploit MLD, so in principle, every access to a shared variable needs to be intercepted 18 of 25 to check for dependencies. Corbett s protected variable reduction [Cor00] exploits MLD to make state space exploration more e cient. Corbett proposes a static analysis that conservatively checks whether objects are accessed in a way that satis es MLD. In [Cor00] Corbett does not provide results on checking MLD during state space exploration and does not consider ....

[Article contains additional citation context not shown here]

James C. Corbett. Using shape analysis to reduce nite-state models of concurrent Java programs. ACM Transactions on Software Engingeering and Methodology, 9(1):51-93, January 2000.

....for this lock based reduction, all of these reduction theorems assume that one knows statically (i.e. before state space exploration) that selected variables are protected by locks. Static analyses like Extended Static Checking [8] type based race detection [9] and protected variable analysis [6] can automatically provide an conservative approximation to this information. For general nite state systems, it might seem that the only way to automatically obtain exact information about whether selected variables are protected by locks 2 Scott D. Stoller: Model Checking Multi Threaded ....

....JVM, written in Java, that supports traditional selective search, as in Spin [13] Java PathFinder does not incorporate a locking discipline based reduction. Corbett proposes a static analysis that conservatively checks whether objects are accessed in a way that satis es a locking discipline [6]. The analysis results are used for his protected variable reduction [6] which is similar to the composition approach in Section 5. In [6] Corbett does not provide results on checking LD during statespace exploration and does not consider making release, notify, and notifyAll invisible (except ....

[Article contains additional citation context not shown here]

James C. Corbett. Using shape analysis to reduce nite-state models of concurrent Java programs. ACM Transactions on Software Engingeering and Methodology, 9(1):51-93, January 2000. Scott D. Stoller: Model-Checking Multi-Threaded Distributed Java Programs

No context found.

J. Corbett. Using shape analysis to reduce nite-state models of concurrentjava programs. In Proceedings of the International Symposium on Software Testing and Analysis, March 1998.

No context found.

James C. Corbett. Using shape analysis to reduce nite-state models of concurrent Java programs. ACM Transactions on Software Engineering and Methodology, 9(1):51-93, 2000.

No context found.

James C. Corbett. Using shape analysis to reduce nite-state models of concurrent java programs. Software Engineering and Methodology, 9(1):51-93, 2000.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC