Sciweavers

592 search results - page 103 / 119
» Can Component Service-Based Systems Be Proved Correct
Sort
View
CADE
2007
Springer
14 years 9 months ago
Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
Viktor Kuncak, Martin C. Rinard
DC
2010
13 years 8 months ago
Model checking transactional memories
Model checking software transactional memories (STMs) is difficult because of the unbounded number, length, and delay of concurrent transactions and the unbounded size of the memo...
Rachid Guerraoui, Thomas A. Henzinger, Vasu Singh
ICSE
1997
IEEE-ACM
14 years 23 days ago
Visualizing Interactions in Program Executions
Implementing, validating, modifying, or reengineering an object-oriented system requires an understanding of the object and class interactions which occur as a program executes. T...
Dean F. Jerding, John T. Stasko, Thomas Ball
ICDCS
2007
IEEE
14 years 2 months ago
Stabilizing Peer-to-Peer Spatial Filters
In this paper, we propose and prove correct a distributed stabilizing implementation of an overlay, called DR-tree, optimized for efficient selective dissemination of information...
Silvia Bianchi, Ajoy Kumar Datta, Pascal Felber, M...
JSAC
2006
96views more  JSAC 2006»
13 years 8 months ago
Price-based distributed algorithms for rate-reliability tradeoff in network utility maximization
Abstract--The current framework of network utility maximization for rate allocation and its price-based algorithms assumes that each link provides a fixed-size transmission "p...
Jang-Won Lee, Mung Chiang, A. Robert Calderbank