3228 search results - page 161 / 646 » Computationally Sound Proofs |
163
click to vote
FAC
2010
15 years 3 months ago
2010
Separation logic allows simple proofs of concurrent algorithms which use blocking mechanisms such as semaphores. It can even deal with non-blocking algorithms. With the addition of...
166
click to vote
SLP
1993
15 years 7 months ago
1993
In this paper we describe a method of programspecialisation and give an extended example of its application to specialisation of a refutation proof procedure for rst order logic. ...
386
click to vote
ACTA
2011
15 years 1 months ago
2011
A simple mutual exclusion algorithm is presented that only uses nonatomic shared variables of bounded size, and that satisfies bounded overtaking. When the shared variables behave...
137
click to vote
MPC
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. We present an algorithm for inverse computation in a rstorder functional language based on the notion of a perfect process tree. The Universal Resolving Algorithm (URA) i...
166
click to vote
IWFM
2003
15 years 7 months ago
2003
We outline a possible logic that will allow us to give a unified approach to reasoning about computational effects. The logic is given by extending Moggi’s computational λ-cal...