MPC
2000
Springer
13 years 8 months ago
2000
Springer
It is possible, but difficult, to reason in Hoare logic about programs which address and modify data structures defined by pointers. The challenge is to approach the simplicity of ...
MPC
2000
Springer
13 years 8 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...