Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
874
May-happen-in-parallel . . .
, 2007
"... X10 is a modern object-oriented programming language designed for high performance, high productivity programming of parallel and multi-core computer systems. Compared to the lower-level thread-based concurrency model in the Java TM language, X10 has higher-level concurrency constructs such as async ..."
Abstract
- Add to MetaCart
such as async, atomic and finish built into the language to simplify creation, analysis and optimization of parallel programs. In this paper, we introduce a new algorithm for May-Happen-in-Parallel (MHP)analysisofX10 programs. The analysis algorithm is based on simple path traversals in the Program Structure
Transactional Memory: Architectural Support for Lock-Free Data Structures
"... A shared data structure is lock-free if its operations do not require mutual exclusion. If one process is interrupted in the middle of an operation, other processes will not be prevented from operating on that object. In highly concurrent systems, lock-free data structures avoid common problems asso ..."
Abstract
-
Cited by 1031 (27 self)
- Add to MetaCart
A shared data structure is lock-free if its operations do not require mutual exclusion. If one process is interrupted in the middle of an operation, other processes will not be prevented from operating on that object. In highly concurrent systems, lock-free data structures avoid common problems
Specification and analysis of system architecture using Rapide
- IEEE Transactions on Software Engineering
, 1995
"... Rapide is an event-based concurrent, object-oriented language specifically designed for prototyping system architectures. Two principle design goals are (1) to provide constructs for defining executable prototypes of architectures, and (2) to adopt an execution model in which the concurrency, sync ..."
Abstract
-
Cited by 386 (4 self)
- Add to MetaCart
Rapide is an event-based concurrent, object-oriented language specifically designed for prototyping system architectures. Two principle design goals are (1) to provide constructs for defining executable prototypes of architectures, and (2) to adopt an execution model in which the concurrency
Deadlocks and Livelocks in Concurrent Objects with Futures
, 2012
"... We study FJf, a concurrent object calculus with future types and operations for getting the values and releasing the control. Programs in FJf may manifest locks (deadlocks or livelocks) due to badly programmed release points. In order to statically detect possible misbehaviours, we develop a techniq ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
We study FJf, a concurrent object calculus with future types and operations for getting the values and releasing the control. Programs in FJf may manifest locks (deadlocks or livelocks) due to badly programmed release points. In order to statically detect possible misbehaviours, we develop a
Deadlock analysis of concurrent objects: Theory and practice
"... We present a framework for statically detecting deadlocks in a concurrent object language with asynchronous invocations and operations for getting values and releasing the control. Our approach is based on the integration of two static analysis techniques: (i) an inference algorithm to extract abst ..."
Abstract
-
Cited by 6 (4 self)
- Add to MetaCart
We present a framework for statically detecting deadlocks in a concurrent object language with asynchronous invocations and operations for getting values and releasing the control. Our approach is based on the integration of two static analysis techniques: (i) an inference algorithm to extract
McRT-STM: a High Performance Software Transactional Memory System for a Multi-Core Runtime
- In Proc. of the 11th ACM Symp. on Principles and Practice of Parallel Programming
, 2006
"... Applications need to become more concurrent to take advantage of the increased computational power provided by chip level multiprocessing. Programmers have traditionally managed this concurrency using locks (mutex based synchronization). Unfortunately, lock based synchronization often leads to deadl ..."
Abstract
-
Cited by 241 (14 self)
- Add to MetaCart
Applications need to become more concurrent to take advantage of the increased computational power provided by chip level multiprocessing. Programmers have traditionally managed this concurrency using locks (mutex based synchronization). Unfortunately, lock based synchronization often leads
Symbolic Deadlock Analysis in Concurrent Libraries and their Clients
"... Methods in object-oriented concurrent libraries hide internal synchronization details. However, information hiding may result in clients causing thread safety violations by invoking methods in an unsafe manner. Given such a library, we present a technique for inferring interface contracts that speci ..."
Abstract
-
Cited by 6 (0 self)
- Add to MetaCart
Methods in object-oriented concurrent libraries hide internal synchronization details. However, information hiding may result in clients causing thread safety violations by invoking methods in an unsafe manner. Given such a library, we present a technique for inferring interface contracts
Deadlock freedom through object ownership
- 5rd International Workshop on Aliasing, Confinement and Ownership in object-oriented programming (IWACO), in conjunction with ECOOP 2009
, 2009
"... Active objects are an attractive method of introducing con-currency into Java-like languages by decoupling method ex-ecution from invocation. In this paper, we show how owner-ship is used in the Java [14] subset language CoJava [17] to prevent deadlock associated with active object method calls. Thi ..."
Abstract
-
Cited by 3 (1 self)
- Add to MetaCart
. This approach builds on existing type-based approaches that eliminates data races and data-based deadlock in concurrent systems. The novel addition is the use of ownership to or-ganize active objects, thus preventing deadlock from arising when objects are allowed to block awaiting responses from others
Type-Based Analysis of Deadlock for a Concurrent Calculus with Interrupts
- In ESOP
, 2007
"... Abstract. The goal of our research project is to establish a type-based method for verification of certain critical properties (such as deadlockand race-freedom) of operating system kernels. As operating system kernels make heavy use of threads and interrupts, it is important that the method can pro ..."
Abstract
-
Cited by 10 (1 self)
- Add to MetaCart
properly deal with both of the two features. As a first step towards the goal, we formalize a concurrent calculus equipped with primitives for threads and interrupts handling. We also propose a type system that guarantees deadlock-freedom in the presence of interrupts. To our knowledge, ours is the first
Deadlock Checking Using Net Unfoldings
- In Proceeding of 9th International Conference on Computer Aided Verification (CAV’97
, 1997
"... McMillan presented a deadlock detection technique based on unfoldings of Petri net systems. It is realized by means of a backtracking algorithm that has its drawback for unfoldings that increase widely. We present an approach that exploits precisely this property. Moreover, we introduce a fast imple ..."
Abstract
-
Cited by 50 (1 self)
- Add to MetaCart
implementation of McMillan's algorithm and compare it with our new technique. 1 Introduction In the field of static analysis of concurrent systems deadlock freeness is almost always a desirable property. Many research has been carried out to propose methods that check this property [3]. One
Results 1 - 10
of
874
