Constrained Shortest Path

Citation: Karl Stroetmann, "The Constrained Shortest Path Problem: A Case Study In Using ASMs", Journal of Universal Computer Science, vol. 3, no. 4 (1997), 304--319.
Summary: An abstract, nondeterministic form of the constrained shortest path problem is defined as an ASM and proven correct, then refined to the level of implementation.
Subjects: Abstract Algorithms, Verification
Download: PostScript, PDF, Compressed PostScript
Notes: Courtesy of Springer-Verlag.