Sciweavers

5387 search results - page 1004 / 1078
» Generating generic functions
Sort
View
POPL
2010
ACM
14 years 6 months ago
Higher-Order Multi-Parameter Tree Transducers and Recursion Schemes for Program Verification
We introduce higher-order, multi-parameter, tree transducers (HMTTs, for short), which are kinds of higher-order tree transducers that take input trees and output a (possibly infi...
Naoki Kobayashi, Naoshi Tabuchi, Hiroshi Unno
ICDT
2010
ACM
161views Database» more  ICDT 2010»
14 years 6 months ago
Composition with Target Constraints
It is known that the composition of schema mappings, each specified by source-to-target tgds (st-tgds), can be specified by a secondorder tgd (SO tgd). We consider the question of...
Marcelo Arenas, Ronald Fagin, Alan Nash
ICS
2010
Tsinghua U.
14 years 6 months ago
Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature?
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
ICS
2010
Tsinghua U.
14 years 6 months ago
Proof-Carrying Data and Hearsay Arguments from Signature Cards
: Design of secure systems can often be expressed as ensuring that some property is maintained at every step of a distributed computation among mutually-untrusting parties. Special...
Alessandro Chiesa, Eran Tromer
SPAA
2009
ACM
14 years 6 months ago
Optimizing transactions for captured memory
In this paper, we identify transaction-local memory as a major source of overhead from compiler instrumentation in software transactional memory (STM). Transaction-local memory is...
Aleksandar Dragojevic, Yang Ni, Ali-Reza Adl-Tabat...
« Prev « First page 1004 / 1078 Last » Next »