Sciweavers

35 search results - page 3 / 7
» popl 2008
Sort
View
POPL
2008
ACM
14 years 5 months ago
Lightweight semiformal time complexity analysis for purely functional data structures
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
Nils Anders Danielsson
POPL
2008
ACM
14 years 5 months ago
Extensible encoding of type hierarchies
The subtyping test consists of checking whether a type t is a descendant of a type r (Agrawal et al. 1989). We study how to perform such a test efficiently, assuming a dynamic hie...
Hamed Seiied Alavi, Seth Gilbert, Rachid Guerraoui
POPL
2008
ACM
14 years 5 months ago
Enhancing modular OO verification with separation logic
Conventional specifications for object-oriented (OO) programs must adhere to behavioral subtyping in support of class inheritance and method overriding. However, this requirement ...
Wei-Ngan Chin, Cristina David, Huu Hai Nguyen, She...
POPL
2008
ACM
14 years 5 months ago
Semantics of transactional memory and automatic mutual exclusion
Software Transactional Memory (STM) is an attractive basis for the development of language features for concurrent programming. However, the semantics of these features can be del...
Andrew Birrell, Martín Abadi, Michael Isard...
POPL
2008
ACM
14 years 5 months ago
A theory of contracts for web services
Contracts are behavioural descriptions of Web services. We devise a theory of contracts that formalises the compatibility of a client to a service, and the safe replacement of a s...
Giuseppe Castagna, Nils Gesbert, Luca Padovani