Sciweavers

1724 search results - page 157 / 345
» Abstract Interpreters for Free
Sort
View
ENTCS
2010
84views more  ENTCS 2010»
15 years 3 months ago
Syntactic Language Extension via an Algebra of Languages and Transformations
We propose an algebra of languages and transformations as a means for extending s syntactically. The algebra provides a layer of high-level abstractions built on top of languages ...
Jacob Andersen, Claus Brabrand
APLAS
2011
ACM
14 years 6 months ago
Decentralized Delimited Release
Abstract. Decentralization is a major challenge for secure computing. In a decentralized setting, principals are free to distrust each other. The key challenge is to provide suppor...
Jonas Magazinius, Aslan Askarov, Andrei Sabelfeld
POPL
2007
ACM
16 years 6 months ago
Extracting queries by static analysis of transparent persistence
Transparent persistence promises to integrate programming languages and databases by allowing procedural programs to access persistent data with the same ease as non-persistent da...
Ben Wiedermann, William R. Cook
WILF
2007
Springer
114views Fuzzy Logic» more  WILF 2007»
16 years 19 days ago
Information Entropy and Co-entropy of Crisp and Fuzzy Granulations
The standard approach to information entropy applied to partitions of a universe is equivalently formulated as the entropy of the corresponding crisp identity resolutions, interpre...
Daniela Bianucci, Gianpiero Cattaneo, Davide Ciucc...
TCC
2004
Springer
173views Cryptology» more  TCC 2004»
15 years 12 months ago
Soundness of Formal Encryption in the Presence of Active Adversaries
Abstract. We present a general method to prove security properties of cryptographic protocols against active adversaries, when the messages exchanged by the honest parties are arbi...
Daniele Micciancio, Bogdan Warinschi