The paper develops a framework that is based on the idea that modal logic provides an appropriate framework for the speci cation of data ow analysis (DFA) algorithms as soon as programs are represented as models of the logic. This can be exploited to construct a DFA-generator that generates e cient implementations of DFA-algorithms from modal speci cations by partially evaluating a speci c model checker with respect to the specifying modal formula. Moreover, the use of a modal logic as speci cation language for DFAalgorithms supports the compositional development of speci cations and structured proofs of properties of DFA-algorithms. { The framework is illustrated by means of a real life example: the problem of determining optimal computation points within ow graphs.
Steffen also shows how dataflow analysis algorithms can be generated from modal logics REF .
Generating Data Flow Analysis Algorithms from Modal Specifications
SCIENCE OF COMPUTER PROGRAMMING
Computer Science