Sciweavers

1557 search results - page 119 / 312
» Programming up to Congruence
Sort
View
ASPLOS
1994
ACM
15 years 3 months ago
Reducing Branch Costs via Branch Alignment
Several researchers have proposed algorithms for basic block reordering. We call these branch alignment algorithms. The primary emphasis of these algorithms has been on improving ...
Brad Calder, Dirk Grunwald
CAV
2010
Springer
179views Hardware» more  CAV 2010»
15 years 3 months ago
Generating Litmus Tests for Contrasting Memory Consistency Models
Well-defined memory consistency models are necessary for writing correct parallel software. Developing and understanding formal specifications of hardware memory models is a chal...
Sela Mador-Haim, Rajeev Alur, Milo M. K. Martin
FLOPS
2006
Springer
15 years 2 months ago
"Scrap Your Boilerplate" Reloaded
Abstract. The paper "Scrap your boilerplate" (SYB) introduces a combinator library for generic programming that offers generic traversals and queries. Classically, suppor...
Ralf Hinze, Andres Löh, Bruno C. D. S. Olivei...
BIOCOMP
2006
15 years 20 days ago
Filtering Tandem Repeats in DNA Sequences
A tandem repeat is a sequence of two or more contiguous, approximate copies of a pattern. Tandem repeats occur in the genomes of both eukaryotic and prokaryotic organisms. They ar...
Dina Sokol, Justin Tojeira
ICFP
2010
ACM
15 years 10 days ago
Functional pearl: every bit counts
We show how the binary encoding and decoding of typed data and typed programs can be understood, programmed, and verified with the help of question-answer games. The encoding of a...
Dimitrios Vytiniotis, Andrew Kennedy