Filters








6,123 Hits in 5.5 sec

May-Happen-in-Parallel Based Deadlock Analysis for Concurrent Objects [chapter]

Antonio E. Flores-Montoya, Elvira Albert, Samir Genaim
2013 Lecture Notes in Computer Science  
We present a novel deadlock analysis for concurrent objects based on the results inferred by a points-to analysis and a may-happenin-parallel (MHP) analysis.  ...  We argue that our analysis is more precise and/or efficient than previous proposals for deadlock analysis of concurrent objects.  ...  The crux of our analysis is the use of a precise may-happen-in-parallel (MHP) analysis [2] .  ... 
doi:10.1007/978-3-642-38592-6_19 fatcat:uy7jquzwijbohlsp3htm7nn53a

SACO: Static Analyzer for Concurrent Objects [chapter]

Elvira Albert, Puri Arenas, Antonio Flores-Montoya, Samir Genaim, Miguel Gómez-Zamalloa, Enrique Martin-Martin, German Puebla, Guillermo Román-Díez
2014 Lecture Notes in Computer Science  
The system integrates auxiliary analyses such as points-to and may-happen-in-parallel, which are essential for increasing the accuracy of the aforementioned more complex properties.  ...  Interestingly, SACO is able to infer both liveness (namely termination and resource boundedness) and safety properties (namely deadlock freedom) of programs based on concurrent objects.  ...  May-Happen-in-Parallel.  ... 
doi:10.1007/978-3-642-54862-8_46 fatcat:cnvgwwkkjrgs3ffqa7qwqnwcgy

Finding synchronization defects in java programs

Frank Otto, Thomas Moschny
2008 Proceedings of the 1st international workshop on Multicore software engineering - IWMSE '08  
Our approach uses static analysis techniques combined with points-to and may-happen-in-parallel (MHP) information to reduce the number of false positives.  ...  Well-known examples for synchronization defects are deadlocks and race conditions. Detecting such errors is known to be difficult.  ...  POINTS-TO AND MHP ANALYSIS To increase the accuracy of our analysis, we use pointsto and may-happen-in-parallel (MHP) analysis.  ... 
doi:10.1145/1370082.1370093 fatcat:xxacazgchjgwjfgb4tf4x2xw3y

A Uniform Classification of Common Concurrency Errors [chapter]

Jan Fiedor, Bohuslav Křena, Zdeněk Letko, Tomáš Vojnar
2012 Lecture Notes in Computer Science  
To help understanding the errors and developing techniques for detecting them, this report strives to provide a uniform taxonomy of concurrency errors common in current programs, with a stress on those  ...  written in Java, together with a brief overview of techniques so far proposed for detecting such errors.  ...  The first four represent results of reachability, alias, escape, and approximated may-happen-in-parallel analyses.  ... 
doi:10.1007/978-3-642-27549-4_67 fatcat:vuaplujznrehzitazwrovjbus4

Component-Based Lock Allocation

Richard L. Halpert, Christopher J.F. Pickett, Clark Verbrugge
2007 Parallel Architecture and Compilation Techniques (PACT), Proceedings of the International Conference on  
Our allocator depends on a thread-based side effect analysis, and benefits from precise points-to and may happen in parallel information.  ...  The allocation of lock objects to critical sections in concurrent programs affects both performance and correctness.  ...  We would like to thank the anonymous reviewers for their comments, and IBM for their 8-way hardware.  ... 
doi:10.1109/pact.2007.4336225 fatcat:64tzjzjoanc2zgfq57jrehtyna

Checkmate: A Generic Static Analyzer of Java Multithreaded Programs

Pietro Ferrara
2009 2009 Seventh IEEE International Conference on Software Engineering and Formal Methods  
In this paper we present ¼heckmate, a generic static analyzer of Java multithreaded programs based on the abstract interpretation theory.  ...  It turns out that the analysis is particularly accurate and we are in position to analyze programs composed by some thousands of statements and a potentially infinite number of threads.  ...  If we print concurrently these two documents, this may cause a deadlock. For instance the first thread may start the execution of printAll and acquire the monitor of d1.  ... 
doi:10.1109/sefm.2009.20 dblp:conf/sefm/Ferrara09 fatcat:lrom3vbnwvdutckzu5ys73g7oe

Profile directed systematic testing of concurrent programs

Yan Hu, Jun Yan, Jian Zhang, He Jiang
2013 2013 8th International Workshop on Automation of Software Test (AST)  
In this paper, we proposed a Profile directed Event driven Dynamic AnaLysis (PEDAL) to effectively detect concurrency bugs.  ...  The reduced preemption set is then used to direct the search for erroneous schedules.  ...  ACKNOWLEDGMENT We thank anonymous reviewers for their detailed comments. We also thank Xiangyu Zhang for sharing valuable experiences in concurrency testing.  ... 
doi:10.1109/iwast.2013.6595790 dblp:conf/icse/HuYZJ13 fatcat:osyphwdtunccdoh2rvvmt2vysa

A generic static analyzer for multithreaded Java programs

P. Ferrara
2012 Software, Practice & Experience  
In particular, they specify which values written in parallel may be read from the shared memory. The Java memory model [38] is quite complex, especially from the point of view of static analysis.  ...  Figure 12 reports the time taken by the analysis (in msec) to build up the abstraction of the § The source code of these examples can be downloaded at A GENERIC STATIC ANALYZER FOR MULTITHREADED JAVA PROGRAMS  ...  If we print these two documents concurrently, this may cause a deadlock.  ... 
doi:10.1002/spe.2126 fatcat:5zifplk4qncwxovt6cqetqqjna

Effective static deadlock detection

Mayur Naik, Chang-Seo Park, Koushik Sen, David Gay
2009 2009 IEEE 31st International Conference on Software Engineering  
We present an effective static deadlock detection algorithm for Java.  ...  While neither sound nor complete, our approach is effective in practice, finding all known deadlocks as well as discovering previously unknown ones in our benchmarks with few false alarms.  ...  Acknowledgment We would like to thank Pallavi Joshi, Christos Stergiou, and the anonymous reviewers for their valuable comments.  ... 
doi:10.1109/icse.2009.5070538 dblp:conf/icse/NaikPSG09 fatcat:pq7gmp4hrrex3fg6w2zvrji324

Coffman deadlocks in SCOOP [article]

Georgiana Caltais, Bertrand Meyer
2014 arXiv   pre-print
In this paper we address the deadlock detection problem in the context of SCOOP - an OO-programming model for concurrency, recently formalized in Maude.  ...  We present the integration of a deadlock detection mechanism on top of the aforementioned formalization and analyze how an abstract semantics of SCOOP based on a notion of "may alias expressions" can contribute  ...  The literature on using static analysis [5] and abstracting techniques for (related) concurrency models is considerable.  ... 
arXiv:1409.7514v3 fatcat:xzspod62ozff3j6qdnu43t5gla

Software and the concurrency revolution

Herb Sutter, James Larus
2005 Queue  
This DARPA-and NSF-funded project investigated new approaches to building and programming parallel shared-memory computers. Larus received his Ph.D. in computer science from the  ...  www.acmqueue.com/forums HERB SUTTER is a software architect in Microsoft's developer division.  ...  Because this can happen any time two locks can be taken in opposite order, calling into code you don't control while holding a lock is a recipe for deadlock.  ... 
doi:10.1145/1095408.1095421 fatcat:kygmzir25fduzntmfilihm2pku

Visualizing massively multithreaded applications with ThreadScope

Kyle B. Wheeler, Douglas Thain
2010 Concurrency and Computation  
It also uses graph-based analysis to identify potential problems.  ...  As highly parallel multicore machines become commonplace, programs must exhibit more concurrency to exploit the available hardware.  ...  ACKNOWLEDGEMENTS Sandia is a multiprogram laboratory operated by Sandia Corporation, a Lockheed Martin Company, for the United States Department of Energy's National Nuclear Security Administration under  ... 
doi:10.1002/cpe.1469 fatcat:455imdfpybdh7csxm5qr6ae3yy

Schematic: A concurrent object-oriented extension to Scheme [chapter]

Kenjiro Taura, Akinori Yonezawa
1996 Lecture Notes in Computer Science  
In this way, Schematic achieves both the convenience for typical concurrent programming and simplicity and exibility of the language kernel.  ...  Schematic will be useful for intensive parallel applications on parallel machines or networks of workstations, concurrent GUI programming, distributed programming over network, and even concurrent shell  ...  In the traditional Actor model, invoking relax!s in parallel may result in deadlock. The situation is more formally illustrated as the follows [17] .  ... 
doi:10.1007/3-540-61487-7_22 fatcat:7jza3ibkg5b2taqwqsbtybkipa

The symbiosis of concurrency and verification: teaching and case studies

Jan B. Pedersen, Peter H. Welch
2017 Formal Aspects of Computing  
Concurrency is beginning to be accepted as a core knowledge area in the undergraduate CS curriculum-no longer isolated, for example, as a support mechanism in a module on operating systems or reserved  ...  Channels are zero-buffered, so a writing process will block until another process, running in parallel with it, executes a read on the other end of the same channel-for example: where the types listed  ...  of our concurrency courses at Kent, CMU and UNLV.  ... 
doi:10.1007/s00165-017-0447-x fatcat:bgcb2kyy6zfkfmek5e4cvqyuve

Application-Aware Byzantine Fault Tolerance

Wenbing Zhao
2014 2014 IEEE 12th International Conference on Dependable, Autonomic and Secure Computing  
We elaborate the need for exploiting application semantics for Byzantine fault tolerance and the benefits of doing so, provide a classification of various approaches to application-aware Byzantine fault  ...  However, state-machine-based Byzantine fault tolerance algorithms require deterministic application processing and sequential execution of totally ordered requests.  ...  In multi-tired session-oriented applications, this may happen frequently.  ... 
doi:10.1109/dasc.2014.17 dblp:conf/dasc/Zhao14 fatcat:vf6qbzcmijgwba7dc5dvqqja2q
« Previous Showing results 1 — 15 out of 6,123 results