Dataflow graphs as complete causal graphs

• URL: http://arxiv.org/abs/2303.09552v1
• Date: Thu, 16 Mar 2023 17:59:13 GMT
• Title: Dataflow graphs as complete causal graphs
• Authors: Andrei Paleyes, Siyuan Guo, Bernhard Sch\"olkopf, Neil D. Lawrence
• Abstract summary: We consider an alternative approach to software design, flow-based programming (FBP) We show how this connection can be leveraged to improve day-to-day tasks in software projects.
• Score: 17.15640410609126
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Component-based development is one of the core principles behind modern software engineering practices. Understanding of causal relationships between components of a software system can yield significant benefits to developers. Yet modern software design approaches make it difficult to track and discover such relationships at system scale, which leads to growing intellectual debt. In this paper we consider an alternative approach to software design, flow-based programming (FBP), and draw the attention of the community to the connection between dataflow graphs produced by FBP and structural causal models. With expository examples we show how this connection can be leveraged to improve day-to-day tasks in software projects, including fault localisation, business analysis and experimentation.

Related papers

• Federated Neural Graph Databases [53.03085605769093]
  We propose Federated Neural Graph Database (FedNGDB), a novel framework that enables reasoning over multi-source graph-based data while preserving privacy. Unlike existing methods, FedNGDB can handle complex graph structures and relationships, making it suitable for various downstream tasks.
  arXiv  Detail & Related papers  (2024-02-22T14:57:44Z)
• Privacy-preserving design of graph neural networks with applications to vertical federated learning [56.74455367682945]
  We present an end-to-end graph representation learning framework called VESPER. VESPER is capable of training high-performance GNN models over both sparse and dense graphs under reasonable privacy budgets.
  arXiv  Detail & Related papers  (2023-10-31T15:34:59Z)
• Semantic Code Graph -- an information model to facilitate software comprehension [0.0]
  There is an increasing need to accelerate the code comprehension process to facilitate maintenance and reduce associated costs. While a variety of code structure models already exist, there is a surprising lack of models that closely represent the source code. We propose the Semantic Code Graph (SCG), an information model that offers a detailed abstract representation of code dependencies.
  arXiv  Detail & Related papers  (2023-10-03T15:09:49Z)
• Understanding the Challenges of Deploying Live-Traceability Solutions [45.235173351109374]
  SAFA.ai is a startup focusing on fine-tuning project-specific models that deliver automated traceability in a near real-time environment. This paper describes the challenges that characterize commercializing software traceability and highlights possible future directions.
  arXiv  Detail & Related papers  (2023-06-19T14:34:16Z)
• Code Recommendation for Open Source Software Developers [32.181023933552694]
  CODER is a novel graph-based code recommendation framework for open source software developers. Our framework achieves superior performance under various experimental settings, including intra-project, cross-project, and cold-start recommendation.
  arXiv  Detail & Related papers  (2022-10-15T16:40:36Z)
• GraphMAE: Self-Supervised Masked Graph Autoencoders [52.06140191214428]
  We present a masked graph autoencoder GraphMAE that mitigates issues for generative self-supervised graph learning. We conduct extensive experiments on 21 public datasets for three different graph learning tasks. The results manifest that GraphMAE--a simple graph autoencoder with our careful designs--can consistently generate outperformance over both contrastive and generative state-of-the-art baselines.
  arXiv  Detail & Related papers  (2022-05-22T11:57:08Z)
• Software Vulnerability Detection via Deep Learning over Disaggregated Code Graph Representation [57.92972327649165]
  This work explores a deep learning approach to automatically learn the insecure patterns from code corpora. Because code naturally admits graph structures with parsing, we develop a novel graph neural network (GNN) to exploit both the semantic context and structural regularity of a program.
  arXiv  Detail & Related papers  (2021-09-07T21:24:36Z)
• Exploring the potential of flow-based programming for machine learning deployment in comparison with service-oriented architectures [8.677012233188968]
  We argue that part of the reason is infrastructure that was not designed for activities around data collection and analysis. We propose to consider flow-based programming with data streams as an alternative to commonly used service-oriented architectures for building software applications.
  arXiv  Detail & Related papers  (2021-08-09T15:06:02Z)
• Model-Agnostic Graph Regularization for Few-Shot Learning [60.64531995451357]
  We present a comprehensive study on graph embedded few-shot learning. We introduce a graph regularization approach that allows a deeper understanding of the impact of incorporating graph information between labels. Our approach improves the performance of strong base learners by up to 2% on Mini-ImageNet and 6.7% on ImageNet-FS.
  arXiv  Detail & Related papers  (2021-02-14T05:28:13Z)
• Graph Neural Network to Dilute Outliers for Refactoring Monolith Application [12.43382998243009]
  We propose a novel method to adapt the recent advancements in graph networks in the context of code to better understand the software. Our solution is able to improve state-of-the-art performance compared to works from both software engineering and existing graph representation based techniques.
  arXiv  Detail & Related papers  (2021-02-07T16:00:27Z)
• Graph signal processing for machine learning: A review and new perspectives [57.285378618394624]
  We review a few important contributions made by GSP concepts and tools, such as graph filters and transforms, to the development of novel machine learning algorithms. We discuss exploiting data structure and relational priors, improving data and computational efficiency, and enhancing model interpretability. We provide new perspectives on future development of GSP techniques that may serve as a bridge between applied mathematics and signal processing on one side, and machine learning and network science on the other.
  arXiv  Detail & Related papers  (2020-07-31T13:21:33Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.