940 search results - page 49 / 188 » Local rely-guarantee reasoning |
LICS
2005
IEEE
14 years 3 months ago
2005
IEEE
We show how to give a coherent semantics to programs that are well-specified in a version of separation logic for a language with higher types: idealized algol extended with heap...
FLOPS
2008
Springer
13 years 11 months ago
2008
Springer
We propose undoable versions of the projection operations used when programs written in higher-order statically-typed languages interoperate with dynamically typed ones, localizing...
CADE
2010
Springer
13 years 11 months ago
2010
Springer
It has recently been shown that proofs in which some symbols are colored (e.g. local or split proofs and symbol-eliminating proofs) can be used for a number of applications, such a...
NPL
2006
13 years 9 months ago
2006
We show that under reasonable conditions, online learning for a nonlinear function near a local minimum is similar to a multivariate Ornstein Uhlenbeck process. This implies that ...
LICS
1992
IEEE
14 years 2 months ago
1992
IEEE
The aim of this paper is to find the finest `observable' and `implementable' equivalence on concurrent processes. This is a part of a larger programme to develop a theor...