Sciweavers

132 search results - page 3 / 27
» Total Correctness by Local Improvement in Program Transforma...
Sort
View
ASPLOS
1994
ACM
13 years 9 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
PLILP
1995
Springer
13 years 8 months ago
Local Linear Logic for Locality Consciousness in Multiset Transformation
We use Girard's linear logic (LL) to produce a semantics for Gamma, a multiset transformation language. The semantics improves on the existing structured operational semantics...
Hugh McEvoy, Pieter H. Hartel
FM
2006
Springer
161views Formal Methods» more  FM 2006»
13 years 9 months ago
Changing Programs Correctly: Refactoring with Specifications
Refactorings change the internal structure of code without changing its external behavior. For non-trivial refactorings, the preservation of external behavior depends on semantic p...
Fabian Bannwart, Peter Müller
CC
2003
Springer
13 years 10 months ago
Improving Data Locality by Chunking
Cache memories were invented to decouple fast processors from slow memories. However, this decoupling is only partial, and many researchers have attempted to improve cache use by p...
Cédric Bastoul, Paul Feautrier
BMCBI
2002
101views more  BMCBI 2002»
13 years 5 months ago
Total sequence decomposition distinguishes functional modules, "molegos" in apurinic/apyrimidinic endonucleases
Background: Total sequence decomposition, using the web-based MASIA tool, identifies areas of conservation in aligned protein sequences. By structurally annotating these motifs, t...
Catherine H. Schein, Numan Özgün, Tadahi...