906 search results - page 168 / 182 » Linking Theories of Concurrency |
171
Voted
POPL
2008
ACM
15 years 10 months ago
2008
ACM
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
165
click to vote
POPL
2006
ACM
15 years 10 months ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
ICFP
2005
ACM
15 years 9 months ago
2005
ACM
Existential types provide a simple and elegant foundation for uning generative abstract data types, of the kind supported by the Standard ML module system. However, in attempting ...
ICFP
2005
ACM
15 years 9 months ago
2005
ACM
module is a programming abstraction that simultaneously generalizes -abstractions, records, and mutually recursive definitions. Although various mixin module type systems have bee...
185
Voted
STACS
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. In this talk, I will review some of the work performed by the research community in cryptology and security since the invention of public key cryptography by Diffie and H...