Sciweavers

1882 search results - page 174 / 377
» Transformational Programming and Forests
Sort
View
87
Voted
PLILP
1994
Springer
15 years 1 months ago
Deriving Residual Reference Count Garbage Collectors
We present a strategy to derive an efficient reference count garbage collector for any applicative program by only modifying it on the source code level. The key to the approach is...
Wolfram Schulte
95
Voted
DAGSTUHL
2003
14 years 11 months ago
Query Answering in Inconsistent Databases
In this chapter, we summarize the research on querying inconsistent databases we have been conducting over the last five years. The formal framework we have used is based on two c...
Leopoldo E. Bertossi, Jan Chomicki
CAD
2004
Springer
14 years 10 months ago
Turtle geometry in computer graphics and computer-aided design
: LOGO is a programming language incorporating turtle graphics, originally devised for teaching computing to young children in elementary and middle schools. Here we advocate the u...
Ron Goldman, Scott Schaefer, Tao Ju
ASPLOS
1994
ACM
15 years 2 months ago
Compiler Optimizations for Improving Data Locality
In the past decade, processor speed has become significantly faster than memory speed. Small, fast cache memories are designed to overcome this discrepancy, but they are only effe...
Steve Carr, Kathryn S. McKinley, Chau-Wen Tseng
POPL
2008
ACM
15 years 10 months ago
Formal verification of translation validators: a case study on instruction scheduling optimizations
Translation validation consists of transforming a program and a posteriori validating it in order to detect a modification of its semantics. This approach can be used in a verifie...
Jean-Baptiste Tristan, Xavier Leroy