120 search results - page 6 / 24 » Functional Encryption for Regular Languages |
CSL
2004
Springer
14 years 26 days ago
2004
Springer
Set constraints are a useful formalism for verifying properties of programs. Usually, they are interpreted over the universe of finite terms. However, some logic languages allow i...
ECCC
2007
13 years 7 months ago
2007
In cryptography, there has been tremendous success in building primitives out of homomorphic semantically-secure encryption schemes, using homomorphic properties in a blackbox way...
TYPES
2004
Springer
14 years 25 days ago
2004
Springer
In this paper we use the Epigram language to define the universe of regular tree types—closed under empty, unit, sum, product and least fixpoint. We then present a generic deci...
AMAST
2004
Springer
14 years 26 days ago
2004
Springer
Abstract. We present a separate compositional analysis for objectoriented languages. We show how a generic static analysis of a context that uses an object can be split into two se...
ICFP
2005
ACM
14 years 7 months ago
2005
ACM
Recent research has shown how boilerplate code, or repetitive code for traversing datatypes, can be eliminated using generic programming techniques already available within some i...