Combining Model Checking and Data-Flow Analysis

The paper develops the idea that modal logic provides an appropriate framework for the specification of data flow analysis (DFA) algorithms as soon as programs are represented as models of the logic. This can be exploited to construct a DFA-<strong>generator</strong> that generates efficient DFA-algorithms from modal specifications by partially evaluating a specific model checker wrt the specifying modal formula. Moreover, the use of a modal logic as specification language for DFA-algorithms supports the compositional development of specifications and structured proofs of properties of DFA-algorithms. These ideas are applied to the problem of determining optimal computation points within flow graphs.

Download Full-text

Data-Flow Analysis as Model Checking Within the jABC

Lecture Notes in Computer Science - Compiler Construction ◽

10.1007/11688839_9 ◽

2006 ◽

pp. 101-104 ◽

Cited By ~ 8

Author(s):

Anna-Lena Lamprecht ◽

Tiziana Margaria ◽

Bernhard Steffen

Keyword(s):

Model Checking ◽

Data Flow ◽

Flow Analysis ◽

Data Flow Analysis

Download Full-text

Early Results with Precision Abstraction: Using Data-flow Analysis to Improve the Scalability of Model Checking

2007 IEEE International Parallel and Distributed Processing Symposium ◽

10.1109/ipdps.2007.370520 ◽

2007 ◽

Author(s):

Adam Brown ◽

James C. Browne ◽

Calvin Lin

Keyword(s):

Model Checking ◽

Data Flow ◽

Flow Analysis ◽

Data Flow Analysis ◽

Early Results ◽

Using Data

Download Full-text

Abstract Interpretation in the Operational Semantics Hierarchy

BRICS Report Series ◽

10.7146/brics.v4i2.18781 ◽

1997 ◽

Vol 4 (2) ◽

Cited By ~ 2

Author(s):

David A. Schmidt

Keyword(s):

Model Checking ◽

Abstract Interpretation ◽

Data Flow ◽

Flow Analysis ◽

Operational Semantics ◽

Second Order ◽

Analysis Model ◽

Small Step ◽

Data Flow Analysis ◽

First Order

We systematically apply the principles of Cousot-Cousot-style abstract interpretation (a.i.) to the hierarchy of operational semantics definitions - flowchart, big-step, and small-step semantics. For each semantics format we examine the principles of safety and liveness interpretations, first-order and second-order analyses, and termination properties. Application of a.i. to data-flow analysis, model checking, closure analysis, and concurrency theory are demonstrated. Our primary contributions are separating the concerns of safety, termination, and efficiency of representation and showing how a.i. principles apply uniformly to the various levels of the operational semantics hierarchy and their applications.

Download Full-text