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

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

Packet flow analysis in IP networks using data-flow analysis

2012 ◽  
Author(s):  
Raghavan Komondoor ◽  
K. Vasanta Lakshmi ◽  
Deva P. Seetharam ◽  
Sudha Balodia
Keyword(s):  
Data Flow ◽  
Flow Analysis ◽  
Ip Networks ◽  
Data Flow Analysis ◽  
Using Data

MAINTAINING DATA DEPENDENCIES ACROSS BPEL PROCESS FRAGMENTS

2008 ◽  
Vol 17 (03) ◽  
pp. 259-282 ◽  
Author(s):  
RANIA KHALAF ◽  
OLIVER KOPP ◽  
FRANK LEYMANN
Keyword(s):  
Collective Behavior ◽  
Data Flow ◽  
Continuous Process ◽  
Flow Analysis ◽  
Control Flow ◽  
Continuous Process Improvement ◽  
Data Dependencies ◽  
Data Flow Analysis ◽  
Data Links ◽  
Using Data

Continuous process improvement (CPI) may require a BPEL process to be split amongst different participants. In this paper, we enable splitting standard BPEL — without requiring any new middleware for the case of flat flows. The solution also supports splitting loops and scopes that have compensation and/or fault handlers. When splitting loops and scopes, we extend existing Web services standards and frameworks in a standard compliant manner in order to support the resulting split control (not data) between the fragments. Data dependencies, however, are handled directly using BPEL constructs placed in the fragments even for split loops and scopes. We present a solution that uses a BPEL process, partition information, and results of data-flow analysis to produce a BPEL process for each participant. The collective behavior of these participant processes recreates the control and data flow of the non-split process. Previous work presented process splitting using a variant of BPEL where data flow is modeled explicitly using "data links". We reuse the control flow aspect from that work as well as the control flow aspect from our work on splitting loops and scopes, focusing in this paper on maintaining the data dependencies in standard BPEL.

scholarly journals Data flow analysis as model checking

1990 ◽  
Vol 19 (325) ◽  
Author(s):  
Bernhard Steffen
Keyword(s):  
Model Checking ◽  
Modal Logic ◽  
Data Flow ◽  
Flow Analysis ◽  
Specific Model ◽  
Specification Language ◽  
Model Checker ◽  
Modal Formula ◽  
Data Flow Analysis ◽  
Flow Graphs

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.

scholarly journals Data-Flow Analysis as Model Checking Within the jABC

2006 ◽  
pp. 101-104 ◽  
Author(s):  
Anna-Lena Lamprecht ◽  
Tiziana Margaria ◽  
Bernhard Steffen
Keyword(s):  
Model Checking ◽  
Data Flow ◽  
Flow Analysis ◽  
Data Flow Analysis
Sign in / Sign up

Export Citation Format

Share Document