Sciweavers

1280 search results - page 221 / 256
» Soft Typing with Conditional Types
Sort
View
ASPLOS
2012
ACM
12 years 4 months ago
Applying transactional memory to concurrency bugs
Multithreaded programs often suffer from synchronization bugs such as atomicity violations and deadlocks. These bugs arise from complicated locking strategies and ad hoc synchroni...
Haris Volos, Andres Jaan Tack, Michael M. Swift, S...
CP
2006
Springer
13 years 11 months ago
Distributed Stable Matching Problems with Ties and Incomplete Lists
We consider the Stable Marriage Problem and the Stable Roommates Problem in presence of ties and incomplete preference lists. They can be solved by centralized algorithms, but this...
Ismel Brito, Pedro Meseguer
BMCBI
2007
127views more  BMCBI 2007»
13 years 9 months ago
Characterization and simulation of cDNA microarray spots using a novel mathematical model
Background: The quality of cDNA microarray data is crucial for expanding its application to other research areas, such as the study of gene regulatory networks. Despite the fact t...
Hye Young Kim, Seo Eun Lee, Min Jung Kim, Jin Il H...
PPOPP
2009
ACM
14 years 9 months ago
Detecting and tolerating asymmetric races
Because data races represent a hard-to-manage class of errors in concurrent programs, numerous approaches to detect them have been proposed and evaluated. We specifically consider...
Paruj Ratanaworabhan, Martin Burtscher, Darko Kiro...
POPL
2008
ACM
14 years 9 months ago
Cyclic proofs of program termination in separation logic
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
James Brotherston, Richard Bornat, Cristiano Calca...