92 search results - page 2 / 19 » Structuring Optimizing Transformations and Proving Them Soun... |
PLDI
2012
ACM
11 years 7 months ago
2012
ACM
Approximate program transformations such as skipping tasks [29, 30], loop perforation [21, 22, 35], reduction sampling [38], multiple selectable implementations [3, 4, 16, 38], dy...
CPM
1999
Springer
13 years 9 months ago
1999
Springer
This paper examines some of the rich structure of the syntenic distance model of evolutionary distance, introduced by Ferretti et al. (1996). The syntenic distance between two gen...
JAR
2006
13 years 5 months ago
2006
To simplify the task of proving termination and AC-termination of term rewriting systems, elimination transformations have been vigorously studied since the 1990's. Dummy elim...
PLDI
2011
ACM
12 years 7 months ago
2011
ACM
Current proposals for concurrent shared-memory languages, including C++ and C, provide sequential consistency only for programs without data races (the DRF guarantee). While the i...
TCS
2002
13 years 4 months ago
2002
Suppose a principal in a cryptographic protocol creates and transmits a message containing a new value v, later receiving v back in a different cryptographic context. It can concl...