Results 1  10
of
149,782
Abstract Verifying Concurrent MessagePassing
"... We consider the modelchecking problem for C programs with (1) data ranging over very large domains, (2) (recursive) procedure calls, and (3) concurrent parallel components that communicate via synchronizing actions. We model such programs using communicating pushdown systems, and reduce the reachab ..."
Abstract
 Add to MetaCart
We consider the modelchecking problem for C programs with (1) data ranging over very large domains, (2) (recursive) procedure calls, and (3) concurrent parallel components that communicate via synchronizing actions. We model such programs using communicating pushdown systems, and reduce
Verifying Programs that use Causallyordered Messagepassing
 Science of Computer Programming
, 1995
"... We give an operational model of causallyordered messagepassing primitives. Based on this model, we formulate a Hoarestyle proof system for causallyordered delivery. To illustrate the use of this proof system and to demonstrate the feasibility of applying invariantbased verification techniques t ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We give an operational model of causallyordered messagepassing primitives. Based on this model, we formulate a Hoarestyle proof system for causallyordered delivery. To illustrate the use of this proof system and to demonstrate the feasibility of applying invariantbased verification techniques
Verifying Programs that use Causallyordered Messagepassing
, 1994
"... 17. CMSTI CODES 1S. SUBJECT TERMS (Conftin an renem if neftuary and kidenttfy by block number) FIEL GRO.P UBG~up Verification, messagepassing, causal delivery 19. A§STRACr (Cwiuh'ue an reewnse if necesm, anW kidentify by blok~jinuxwd We give an.operational model of causallyordered messagepa ..."
Abstract
 Add to MetaCart
17. CMSTI CODES 1S. SUBJECT TERMS (Conftin an renem if neftuary and kidenttfy by block number) FIEL GRO.P UBG~up Verification, messagepassing, causal delivery 19. A§STRACr (Cwiuh'ue an reewnse if necesm, anW kidentify by blok~jinuxwd We give an.operational model of causallyordered messagepassing
Verifying Programs that use Causallyordered Messagepassing
, 1995
"... We give an operational model of causallyordered messagepassing primitives. Based on this model, we formulate a Hoarestyle proof system for causallyordered delivery. To illustrate the use of this proof system and to demonstrate the feasibility of applying invariantbased verification techniques t ..."
Abstract
 Add to MetaCart
We give an operational model of causallyordered messagepassing primitives. Based on this model, we formulate a Hoarestyle proof system for causallyordered delivery. To illustrate the use of this proof system and to demonstrate the feasibility of applying invariantbased verification techniques
Verifying Programs that use Causallyordered Messagepassing
 Science of Computer Programming
, 1995
"... We give an operational model of causallyordered messagepassing primitives. Based on this model, we formulate a Hoarestyle proof system for causallyordered delivery. To illustrate the use of this proof system and to demonstrate the feasibility of applying invariantbased verification technique ..."
Abstract
 Add to MetaCart
We give an operational model of causallyordered messagepassing primitives. Based on this model, we formulate a Hoarestyle proof system for causallyordered delivery. To illustrate the use of this proof system and to demonstrate the feasibility of applying invariantbased verification
Verifying concurrent messagepassing C programs with recursive calls
 In TACAS
, 2006
"... Abstract. We consider the modelchecking problem for C programs with (1) data ranging over very large domains, (2) (recursive) procedure calls, and (3) concurrent parallel components that communicate via synchronizing actions. We model such programs using communicating pushdown systems, and reduce t ..."
Abstract

Cited by 41 (16 self)
 Add to MetaCart
Abstract. We consider the modelchecking problem for C programs with (1) data ranging over very large domains, (2) (recursive) procedure calls, and (3) concurrent parallel components that communicate via synchronizing actions. We model such programs using communicating pushdown systems, and reduce
Automatic Checking of MessagePassing Programs
, 1996
"... Introduction Model checking is an automatic technique for verifying finitestate reactive systems, such as sequential circuit designs and communication protocols. Early model checkers were unable to handle very large examples due to the state explosion problem. Because of this limitation, many rese ..."
Abstract
 Add to MetaCart
Introduction Model checking is an automatic technique for verifying finitestate reactive systems, such as sequential circuit designs and communication protocols. Early model checkers were unable to handle very large examples due to the state explosion problem. Because of this limitation, many
Messagepassing and linear programming approaches
, 2003
"... We develop and analyze methods for computing provably optimal maximum a posteriori (MAP) configurations for a subclass of Markov random fields defined on graphs with cycles. By decomposing the original distribution into a convex combination of treestructured distributions, we obtain an upper bound ..."
Abstract
 Add to MetaCart
is that any such shared configuration must also be a MAP configuration for the original distribution. Next we develop two approaches to attempting to obtain tight upper bounds: (a) a treerelaxed linear program (LP), which is derived from the Lagrangian dual of the upper bounds; and (b) a tree
An Empirical Study of MessagePassing Overhead
 Proceedings of the Seventh International Conference on Distributed Computing Systems
, 1987
"... Conventional wiodom holds that me.sagepassing is orders of magnitude more expensive than shared memory for communication between parallel proce..... Differences in the speed of underlying hardware mechaniems fail to account for a substantial portion of the performance gap. The remainder is ganerall ..."
Abstract

Cited by 15 (6 self)
 Add to MetaCart
Conventional wiodom holds that me.sagepassing is orders of magnitude more expensive than shared memory for communication between parallel proce..... Differences in the speed of underlying hardware mechaniems fail to account for a substantial portion of the performance gap. The remainder
A MESSAGEPASSING PARADIGM FOR OPTIMIZATION
, 2007
"... ii iv We consider a class of largescale optimization programs that appear in many engineering and management settings. Such complex, decentralized systems are comprised of many individual components, each interacting with a limited number of neighboring components. The resulting optimization progra ..."
Abstract
 Add to MetaCart
programs are characterized by the fact that the decision variables are coupled only in a localized and sparse fashion. Messagepassing algorithms are a new class of distributed and asynchronous methods for solving problems with graphical structure. They have emerged independently in a number of fields
Results 1  10
of
149,782