147 search results - page 5 / 30 » Relational Parametricity and Separation Logic |
119
click to vote
ESOP
2010
Springer
15 years 9 months ago
2010
Springer
Formal reasoning about concurrent programs is usually done with the assumption that the underlying memory model is sequentially consistent, i.e. the execution outcome is equivalen...
97
Voted
FOSSACS
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We present a realizability model for a call-by-value, higherorder programming language with parametric polymorphism, general first-class references, and recursive types....
191
click to vote
POPL
2008
ACM
15 years 12 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...
112
click to vote
ECOOP
2010
Springer
15 years 2 months ago
2010
Springer
Specifications of Object-Oriented programs conventionally employ Boolean expressions of the programming language for assertions. Programming errors can be discovered by checking at...
214
click to vote
POPL
2008
ACM
15 years 12 months ago
2008
ACM
Conventional specifications for object-oriented (OO) programs must adhere to behavioral subtyping in support of class inheritance and method overriding. However, this requirement ...