The Community for Technology Leaders
Formal Engineering Methods, International Conference on (2000)
York, England
Sept. 4, 2000 to Sept. 7, 2000
ISBN: 0-7695-0822-7
pp: 67
Tetsuo Tamai , University of Tokyo
ABSTRACT
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.
INDEX TERMS
CITATION
Tetsuo Tamai, "Formal Treatment of a Family of Fixed-Point Problems on Graphs by CafeOBJ", Formal Engineering Methods, International Conference on, vol. 00, no. , pp. 67, 2000, doi:10.1109/ICFEM.2000.873806
99 ms
(Ver 3.3 (11022016))