Pith. Sign in

RECORD

Scalable and Cost-effective Data Flow Analysis for Distributed Software: Algorithms and Applications

Distributed, Parallel, and Cluster Computing · Submitted 7 Mar 2023

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim My dissertation addresses these challenges via three novel approaches to data flow analysis for distributed software.

how it is stated · asserted 1.00 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID2303.03659 (version 1)
Pith IDIXJAPWDH, Pith's permanent record of this paper and its review
CitationXiaoqin Fu. "Scalable and Cost-effective Data Flow Analysis for Distributed Software: Algorithms and Applications." arXiv:2303.03659 (2023). https://pith.science/paper/IXJAPWDH
Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 7,932 input tokens.

What the abstract itself states, as probabilities: claims first 0.07 · states limitation 0.09 · human participants 0.04 · controlled comparison 0.03 · randomized assignment 0.01 · states quantitative result 0.03 · compares with prior results 0.13 · mentions code or data availability 0.03.

The abstract, sentence by sentence

arXiv listing abstract v1. Results and the main claim are underlined; .

More and more distributed software systems are being developed and deployed today. Like other software, distributed software systems also need very strong quality assurance support. Distributed software is often very large/complex, has distributed components, and does not have a global clock. All these characteristics make it very challenging to analyze the information flow of such systems to support the software quality assurance. One challenge is that existing dynamic analysis techniques hardly scale to large distributed software systems in the real world. It is also challenging to develop cost-effective dynamic analysis approaches. There are also applicability and portability challenges for dynamic analysis algorithms/applications of distributed software. My dissertation addresses these challenges via three novel approaches to data flow analysis for distributed software. My first approach is based on measuring interprocess communications to understand distributed software behaviors and predict distributed software quality. Then, I developed a particular approach that can actually pinpoint sensitive information via multi-staged and refinement-based dynamic information flow analysis for distributed software. Finally, I explored dynamic dependence analysis for distributed systems, utilizing reinforcement learning to automatically adjust analysis configurations for scalability and better cost-effectiveness tradeoffs.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 More and more distributed software systems are being developed and deployed today. background 1.00 0.06 0.02 asserted 1.00
s1 Like other software, distributed software systems also need very strong quality assurance support. background 1.00 0.04 0.02 asserted 1.00
s2 Distributed software is often very large/complex, has distributed components, and does not have a global clock. background 1.00 0.05 0.02 asserted 0.98
s3 All these characteristics make it very challenging to analyze the information flow of such systems to support the software quality assurance. background 0.93 0.10 0.03 asserted 1.00
s4 One challenge is that existing dynamic analysis techniques hardly scale to large distributed software systems in the real world. background 0.60 0.07 0.03 asserted 0.98
s5 It is also challenging to develop cost-effective dynamic analysis approaches. background 0.63 0.06 0.02 asserted 1.00
s6 There are also applicability and portability challenges for dynamic analysis algorithms/applications of distributed software. background 0.63 0.06 0.02 asserted 1.00
s7 My dissertation addresses these challenges via three novel approaches to data flow analysis for distributed software. contribution 1.00 0.91 0.20 asserted 1.00
s8 My first approach is based on measuring interprocess communications to understand distributed software behaviors and predict distributed software quality. contribution 0.54 0.91 0.07 asserted 1.00
s9 Then, I developed a particular approach that can actually pinpoint sensitive information via multi-staged and refinement-based dynamic information flow analysis for distributed software. contribution 0.54 0.95 0.08 asserted 0.98
s10 Finally, I explored dynamic dependence analysis for distributed systems, utilizing reinforcement learning to automatically adjust analysis configurations for scalability and better cost-effectiveness tradeoffs. contribution 0.58 0.93 0.11 asserted 0.98

What kind of paper the classifier reports this is: method or tool 1.00 · evidence from argument 0.51.

What was examined, and what was not

sources read
  • arXiv listing abstract v1
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original abstract

More and more distributed software systems are being developed and deployed today. Like other software, distributed software systems also need very strong quality assurance support. Distributed software is often very large/complex, has distributed components, and does not have a global clock. All these characteristics make it very challenging to analyze the information flow of such systems to support the software quality assurance. One challenge is that existing dynamic analysis techniques hardly scale to large distributed software systems in the real world. It is also challenging to develop cost-effective dynamic analysis approaches. There are also applicability and portability challenges for dynamic analysis algorithms/applications of distributed software. My dissertation addresses these challenges via three novel approaches to data flow analysis for distributed software. My first approach is based on measuring interprocess communications to understand distributed software behaviors and predict distributed software quality. Then, I developed a particular approach that can actually pinpoint sensitive information via multi-staged and refinement-based dynamic information flow analysis for distributed software. Finally, I explored dynamic dependence analysis for distributed systems, utilizing reinforcement learning to automatically adjust analysis configurations for scalability and better cost-effectiveness tradeoffs.

Human review

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.