Sciweavers

6 search results - page 1 / 2
» Formal Verification of a Lazy Concurrent List-Based Set Algo...
Sort
View
CAV
2006
Springer
141views Hardware» more  CAV 2006»
13 years 8 months ago
Formal Verification of a Lazy Concurrent List-Based Set Algorithm
We describe a formal verification of a recent concurrent list-based set algorithm due to Heller et al. The algorithm is optimistic: the add and remove operations traverse the list ...
Robert Colvin, Lindsay Groves, Victor Luchangco, M...
PPL
2007
76views more  PPL 2007»
13 years 4 months ago
A Lazy Concurrent List-Based Set Algorithm
Abstract. List-based implementations of sets are a fundamental building block of many concurrent algorithms. A skiplist based on the lock-free list-based set algorithm of Michael w...
Steve Heller, Maurice Herlihy, Victor Luchangco, M...
CAV
2007
Springer
164views Hardware» more  CAV 2007»
13 years 8 months ago
SAT-Based Compositional Verification Using Lazy Learning
Abstract. A recent approach to automated assume-guarantee reasoning (AGR) for concurrent systems relies on computing environment assumptions for components using the L algorithm fo...
Nishant Sinha, Edmund M. Clarke
SBMF
2010
Springer
205views Formal Methods» more  SBMF 2010»
12 years 11 months ago
A High-Level Language for Modeling Algorithms and Their Properties
Designers of concurrent and distributed algorithms usually express them using pseudo-code. In contrast, most verification techniques are based on more mathematically-oriented forma...
Sabina Akhtar, Stephan Merz, Martin Quinson
JLP
2006
108views more  JLP 2006»
13 years 4 months ago
On testing UML statecharts
We present a formal framework for notions related to testing and model based test generation for a behavioural subset of UML Statecharts (UMLSCs). This framework builds, on one ha...
Mieke Massink, Diego Latella, Stefania Gnesi