Results 171 to 180 of about 683 (202)

Deadlock-freedom-by-design

ACM SIGPLAN Notices, 2013
Over the last decade, global descriptions have been successfully employed for the verification and implementation of communicating systems, respectively as protocol specifications and choreographies. In this work, we bring these two practices together by proposing a purely-global programming model.
Carbone, Marco, Montesi, Fabrizio
openaire   +2 more sources

Certifying deadlock-freedom for BIP models

Proceedings of th 12th International Workshop on Software and Compilers for Embedded Systems, 2009
The BIP framework provides a methodology supported by a tool chain for developing software for embedded systems. The design of a BIP system follows the decomposition in behavior, interaction and priority. The first step comprises the division of desired behavior of a system into components.
Jan Olaf Blech, Michaël Périn
openaire   +2 more sources

Testing Deadlock-Freedom of Computer Systems

Journal of the ACM, 1980
The problem of determining whether it is possible for a set of “free-running” processes to become deadlocked is considered. It is assumed that any request by a process is immediately granted as long as there are enough free resource units to satisfy the request.
openaire   +2 more sources

Verifying Deadlock- and Livelock Freedom in an SOA Scenario

2009 Ninth International Conference on Application of Concurrency to System Design, 2009
In a service-oriented architecture (SOA), a service broker assigns a previously published service (stored in a service registry) to a service requester. It is desirable for the composition of the requesting and the assigned service to interact properly.
Wolf, K., Stahl, C., Ott, J., Danitz, R.
openaire   +1 more source

Deadlock freedom using edge locks

ACM Transactions on Database Systems, 1982
We define a series of locking protocols for database systems that all have three main features: freedom from deadlock, multiple granularity, and support for general collections of locking primitives. A rooted directed acyclic graph is used to represent multiple granularities, as in System R.
openaire   +2 more sources

Tighter Reachability Criteria for Deadlock-Freedom Analysis

2016
We combine a prior incomplete deadlock-freedom-checking approach with two new reachability techniques to create a more precise deadlock-freedom-checking framework for concurrent systems. The reachability techniques that we propose are based on the analysis of individual components of the system; we use static analysis to summarise the behaviour that ...
Pedro R. G. Antonino, Thomas Gibson-Robinson, A. W. Roscoe 0001   +2 more
openaire   +1 more source

A trace-based service semantics guaranteeing deadlock freedom

Acta Informatica, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Stahl, Christian, Vogler, Walter
openaire   +3 more sources

Ensuring Deadlock-Freedom in Low-Diameter InfiniBand Networks

2016 IEEE 24th Annual Symposium on High-Performance Interconnects (HOTI), 2016
Lossless networks, such as InfiniBand use flow-control to avoid packet-loss due to congestion. This introduces dependencies between input and output channels, in case of cyclic dependencies the network can deadlock. Deadlocks can be resolved by splitting a physical channel into multiple virtual channels with independent buffers and credit systems ...
Timo Schneider, Otto Bibartiu, Torsten Hoefler   +2 more
openaire   +1 more source

Types and Deadlock Freedom in a Calculus of Services, Sessions and Pipelines

2008
The notion of a session is fundamental in service-oriented applications, as it serves to separate interactions between clients and different instances of the same service, and to group together logical units of work. Recently, the Service Centered Calculus (SCC) has been proposed as a process calculus designed around the concept of a dyadic session ...
BRUNI, ROBERTO, MEZZINA L.
openaire   +1 more source

Constructors, Sufficient Completeness, and Deadlock Freedom of Rewrite Theories

2010
Sufficient completeness has been throughly studied for equational specifications, where function symbols are classified into constructors and defined symbols. But what should sufficient completeness mean for a rewrite theory R = (Σ, E, R) with equations E and nonequational rules R describing concurrent transitions in a system?
Camilo Rocha, José Meseguer 0001
openaire   +1 more source