Concurrency Among Strangers

Miller, Mark S.; Tribble, Eric Dean; Shapiro, Jonathan S.

doi:10.1007/11580850_12

Cited by 68 publications

(19 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Although shared-memory implementations are often possible, the burden of preventing unwanted thread interleavings without crippling performance is onerous. Many have instead adopted asynchronous programming models in which processes communicate by posting messages/tasks to others' message/task queues- [19] discuss why such models provide good programming abstractions. Single-process systems such as the JavaScript page-loading engine of modern web browsers [1], and the highly-scalable Node.js asynchronous web server [11], execute a series of short-lived tasks one-by-one, each task potentially queueing additional tasks to be executed later.…”

Section: Introductionmentioning

confidence: 99%

Bounded Phase Analysis of Message-Passing Programs

Bouajjani

Emmi

2012

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

Abstract. We describe a novel technique for bounded analysis of asynchronous message-passing programs with ordered message queues. Our bounding parameter does not limit the number of pending messages, nor the number of "contexts-switches" between processes. Instead, we limit the number of process communication cycles, in which an unbounded number of messages are sent to an unbounded number of processes across an unbounded number of contexts. We show that remarkably, despite the potential for such vast exploration, our bounding scheme gives rise to a simple and efficient program analysis by reduction to sequential programs. As our reduction avoids explicitly representing message queues, our analysis scales irrespectively of queue content and variation.

show abstract

Section: Introductionmentioning

confidence: 99%

Bounded Phase Analysis of Message-Passing Programs

Bouajjani

Emmi

2012

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

show abstract

“…In these scenarios it often makes a difference whether a reference points to an object at the current location, i.e., the location of the current executing object (in the following called a near reference), or to an object at a different location (a far reference). For example, in the E programming language [4], a far reference can only be used for asynchronous method calls (named eventual sends in E), but not for synchronous method calls. In Java Remote Method Invocation (RMI) [8] accessing a remote reference may throw a RemoteException, where accessing a normal reference cannot throw such an exception.…”

Section: Introductionmentioning

confidence: 99%

“…This versatile notion of locality is not only useful for distributed programming, but also for programs running on a single computer. For example, in object-oriented languages with concurrency models based on communicating groups of objects such as E [4], AmbientTalk/2 [5], JCoBox [6], or ABS [7], the location of an object can be considered as the group it belongs to. In these scenarios it often makes a difference whether a reference points to an object at the current location, i.e., the location of the current executing object (in the following called a near reference), or to an object at a different location (a far reference).…”

Section: Introductionmentioning

confidence: 99%

Location Types for Safe Programming with Near and Far References

Welsch

Schäfer

Poetzsch-Heffter

2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. In distributed object-oriented systems, objects belong to different locations. For example, in Java Remote Method Invocation (RMI), objects can be distributed over different Java virtual machines. Accessing a reference in RMI has crucially different semantics depending on whether the referred object is local or remote. Nevertheless, such references are not statically distinguished by the Java type system. This chapter presents location types, which statically distinguish far from near references. We present a formal type system for a minimal core language and develop a type inference system that gives maximally precise solutions satisfying further desirable properties. We prove soundness of the type system as well as soundness and correctness of the inference system. We have implemented location types as a pluggable type system for the ABS language, an object-oriented language with a concurrency and distribution model based on concurrent object groups. To facilitate programming with location types, we provide a tight integration of the type and inference system with an Eclipse-based integrated development environment (IDE) that presents inference results as overlays to the source code. The IDE drastically reduces the annotation overhead while providing full static type information to the programmer.

show abstract

“…Although sharedmemory implementations are often possible, the burden of preventing unwanted thread interleavings without crippling performance is onerous. Many have instead adopted asynchronous programming models in which processes communicate by posting messages/tasks to others' message/task queues-Miller et al [18] discuss why such models provide good programming abstractions. Single-process systems such as the JavaScript page-loading engine of modern web browsers [1], and the highly-scalable Node.js asynchronous web server [10], execute a series of short-lived tasks one-by-one, each task potentially queueing additional tasks to be executed later.…”

Section: Introductionmentioning

confidence: 99%