Formal Engineering Methods, International Conference on (2000)
Sept. 4, 2000 to Sept. 7, 2000
Tetsuo Tamai , University of Tokyo
A family of well known problems on graphs including the shortest path problem and the data flow analysis problem can be uniformly formulated as a fixed-point problem on graphs. We specify this problem and its solution algorithm in a highly abstract manner, fully exploiting the parameterized module construct of CafeOBJ, an algebraic specification language. The objective of our research is to explore effectiveness of formal methods applying them not just to safety critical specific programs but also to general problems covering wide range of applications.
T. Tamai, "Formal Treatment of a Family of Fixed-Point Problems on Graphs by CafeOBJ," Formal Engineering Methods, International Conference on(ICFEM), York, England, 2000, pp. 67.