9 search results - page 1 / 2 » Formalizing Dijkstra |
TPHOL
1998
IEEE
13 years 11 months ago
1998
IEEE
ACTA
1998
13 years 7 months ago
1998
The paper focusses on the logical backgrounds of the Dijkstra-Scholten program development style for correct programs. For proving the correctness of a program (i.e. the fact that...
IFL
2007
Springer
14 years 1 months ago
2007
Springer
In this paper we describe the structure of the Essential Haskell Compiler (EHC) and how we manage its complexity, despite its growth from essentials to a full Haskell compiler. Our...
SOFSEM
2009
Springer
14 years 4 months ago
2009
Springer
During the last years, speed-up techniques for DIJKSTRA’s algorithm have been developed that make the computation of shortest paths a matter of microseconds even on huge road net...
COORDINATION
2007
Springer
14 years 1 months ago
2007
Springer
We present a generalized committed choice construct for concurrent programs that interact with a shared store. The generalized committed choice (GCC) allows multiple computations ...