Data flow analysis is model checking of abstract interpretations

Author(s):  
David A. Schmidt
1990 ◽  
Vol 19 (325) ◽  
Author(s):  
Bernhard Steffen

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.


Author(s):  
Anna-Lena Lamprecht ◽  
Tiziana Margaria ◽  
Bernhard Steffen

2018 ◽  
pp. 493-540 ◽  
Author(s):  
Dirk Beyer ◽  
Sumit Gulwani ◽  
David A. Schmidt

1997 ◽  
Vol 4 (2) ◽  
Author(s):  
David A. Schmidt

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.


2007 ◽  
Vol 190 (3) ◽  
pp. 59-77 ◽  
Author(s):  
Alessandra Di Pierro ◽  
Chris Hankin ◽  
Herbert Wiklicky

Sign in / Sign up

Export Citation Format

Share Document