Sciweavers

718 search results - page 116 / 144
» Extraction of Structured Programs from Specification Proofs
Sort
View
ICFP
2005
ACM
14 years 8 months ago
A unified category-theoretic formulation of typed binding signatures
We generalise Fiore et al's account of variable binding for untyped cartesian contexts and Tanaka's account of variable binding for untyped linear contexts to give an ac...
Miki Tanaka, John Power
OSDI
2002
ACM
14 years 9 months ago
Using Model Checking to Debug Device Firmware
Device firmware is a piece of concurrent software that achieves high performance at the cost of software complexity. They contain subtle race conditions that make them difficult t...
Sanjeev Kumar, Kai Li
BMCBI
2010
89views more  BMCBI 2010»
13 years 8 months ago
Semi-automatic identification of punching areas for tissue microarray building: the tubular breast cancer pilot study
Background: Tissue MicroArray technology aims to perform immunohistochemical staining on hundreds of different tissue samples simultaneously. It allows faster analysis, considerab...
Federica Viti, Ivan Merelli, Mieke Timmermans, Mic...
BMCBI
2004
141views more  BMCBI 2004»
13 years 8 months ago
Estimates of statistical significance for comparison of individual positions in multiple sequence alignments
Background: Profile-based analysis of multiple sequence alignments (MSA) allows for accurate comparison of protein families. Here, we address the problems of detecting statistical...
Ruslan Sadreyev, Nick V. Grishin
HPCA
2007
IEEE
14 years 9 months ago
Exploiting Postdominance for Speculative Parallelization
Task-selection policies are critical to the performance of any architecture that uses speculation to extract parallel tasks from a sequential thread. This paper demonstrates that ...
Mayank Agarwal, Kshitiz Malik, Kevin M. Woley, Sam...