Sciweavers

68 search results - page 12 / 14
» On the proof theory of type two functionals based on primiti...
Sort
View
PCI
2001
Springer
13 years 12 months ago
Communicating X-Machines: From Theory to Practice
Formal modeling of complex systems is a non-trivial task, especially if a formal method does not facilitate separate development of the components of a system. This paper describes...
Petros Kefalas, George Eleftherakis, Evangelos Keh...
ITP
2010
114views Mathematics» more  ITP 2010»
13 years 11 months ago
A New Foundation for Nominal Isabelle
Pitts et al introduced a beautiful theory about names and binding based on the notions of permutation and support. The engineering challenge is to smoothly adapt this theory to a t...
Brian Huffman, Christian Urban
PEPM
2009
ACM
14 years 4 months ago
Bidirectional data-flow analyses, type-systematically
We show that a wide class of bidirectional data-flow analyses and program optimizations based on them admit declarative descriptions in the form of type systems. The salient feat...
Maria João Frade, Ando Saabas, Tarmo Uustal...
ICFP
2002
ACM
14 years 7 months ago
Meta-programming with names and necessity
Meta-programming is a discipline of writing programs in a certain programming language that generate, manipulate or execute programs written in another language. In a typed settin...
Aleksandar Nanevski
IACR
2011
124views more  IACR 2011»
12 years 7 months ago
Efficient Multicast Key Distribution Using HOWF-based Access Control Structures
— Both broadcast encryption (BE) protocols and multicast key distribution (MKD) protocols try to solve the same problem of private group communication. For the first time, we dis...
Jing Liu, Qiong Huang, Bo Yang