159 search results - page 20 / 32 » Type Equivalence Checking in Persistent Object Systems |
120
click to vote
PODC
1997
ACM
15 years 7 months ago
1997
ACM
Conditions on a shared object type T are given that are both necessary and sufficient for wait-free n-process consensus to be solvable using objects of type T and registers. The co...
118
click to vote
ESOP
2010
Springer
16 years 13 days ago
2010
Springer
Abstract. We present a framework that automatically produces suggestions to resolve type errors in security-typed programs, enabling legacy code to be retrofit with comprehensive s...
138
click to vote
POPL
2010
ACM
16 years 14 days ago
2010
ACM
Since Findler and Felleisen [2002] introduced higher-order contracts, many variants have been proposed. Broadly, these fall into two groups: some follow Findler and Felleisen in u...
133
click to vote
TPHOL
2003
IEEE
15 years 8 months ago
2003
IEEE
This paper addresses the crucial issue in the design of a proof development system of how to deal with partial functions and the related question of how to treat undefined terms. ...
117
click to vote
PPDP
2005
Springer
15 years 8 months ago
2005
Springer
We study contexts (terms with holes) by proposing a ‘λcalculus with holes’. It is very expressive and can encode programming constructs apparently unrelated to contexts, incl...