Sciweavers

140 search results - page 20 / 28
» Verifying timing properties of concurrent algorithms
Sort
View
IJFCS
2006
110views more  IJFCS 2006»
13 years 10 months ago
Sat-based Model Checking for Region Automata
For successful software verification, model checkers must be capable of handling a large number of program variables. Traditional, BDD-based model checking is deficient in this re...
Fang Yu, Bow-Yaw Wang
HPDC
2008
IEEE
14 years 5 months ago
FaTLease: scalable fault-tolerant lease negotiation with paxos
A lease is a token which grants its owner exclusive access to a resource for a defined span of time. In order to be able to tolerate failures, leases need to be coordinated by di...
Felix Hupfeld, Björn Kolbeck, Jan Stender, Mi...
TCOM
2010
83views more  TCOM 2010»
13 years 5 months ago
Global and Fast Receiver Antenna Selection for MIMO Systems
Abstract--For a multiple-input multiple-output (MIMO) system with more antennas at the receiver than the transmitter, selecting the same number of receiver antennas as the number o...
Bu Hong Wang, Hon Tat Hui, Mook Seng Leong
QEST
2006
IEEE
14 years 4 months ago
Compositional Performability Evaluation for STATEMATE
Abstract— This paper reports on our efforts to link an industrial state-of-the-art modelling tool to academic state-of-the-art analysis algorithms. In a nutshell, we enable timed...
Eckard Böde, Marc Herbstritt, Holger Hermanns...
POPL
2004
ACM
14 years 11 months ago
Atomizer: a dynamic atomicity checker for multithreaded programs
Ensuring the correctness of multithreaded programs is difficult, due to the potential for unexpected interactions between concurrent threads. Much previous work has focused on det...
Cormac Flanagan, Stephen N. Freund