Sciweavers

2259 search results - page 83 / 452
» Separation and information hiding
Sort
View
POPL
2009
ACM
14 years 9 months ago
Positive supercompilation for a higher order call-by-value language
Previous deforestation and supercompilation algorithms may introduce accidental termination when applied to call-by-value programs. This hides looping bugs from the programmer, an...
Peter A. Jonsson, Johan Nordlander
ESORICS
2009
Springer
14 years 9 months ago
Super-Efficient Aggregating History-Independent Persistent Authenticated Dictionaries
Authenticated dictionaries allow users to send lookup requests to an untrusted server and get authenticated answers. Persistent authenticated dictionaries (PADs) add queries agains...
Scott A. Crosby, Dan S. Wallach
ERCIMDL
2009
Springer
108views Education» more  ERCIMDL 2009»
14 years 3 months ago
Hoppla - Digital Preservation Support for Small Institutions
Small businesses (small office/home office, SOHO) have tremendous amounts of digital information. At the same time, they have little to no expertise on how to manage it, not to me...
Stephan Strodl, Florian Motlik, Andreas Rauber
APLAS
2009
ACM
14 years 3 months ago
On the Decidability of Subtyping with Bounded Existential Types
Bounded existential types are a powerful language feature ling partial data abstraction and information hiding. However, existentials do not mingle well with subtyping as found in ...
Stefan Wehr, Peter Thiemann
ICADL
2007
Springer
70views Education» more  ICADL 2007»
14 years 3 months ago
Predicting Social Annotation by Spreading Activation
Social bookmark services like del.icio.us enable easy annotation for users to organize their resources. Collaborative tagging provides useful index for information retrieval. Howev...
Abon Chen, Hsin-Hsi Chen, Polly Huang