• Home
  • Search
  • Verifying Weak Probabilistic Noninterference
  • Cite Icon3
  • https://doi.org/10.14569/ijacsa.2017.081026Copy DOI Icon

Verifying Weak Probabilistic Noninterference

  • Abstract
  • Highlights & Summary
  • PDF
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Weak probabilistic noninterference is a security property for enforcing confidentiality in multi-threaded programs. It aims to guarantee secure flow of information in the program and ensure that sensitive information does not leak to attackers. In this paper, the problem of verifying weak probabilistic noninterference by leveraging formal methods, in particular algorithmic verification, is discussed. Behavior of multi-threaded programs is modeled using probabilistic Kripke structures and formalize weak probabilistic noninterference in terms of these structures. Then, a verification algorithm is proposed to check weak probabilistic noninterference. The algorithm uses an abstraction technique to compute quotient space of the program with respect to an equivalence relation called weak probabilistic bisimulation and does a simple check to decide whether the security property is satisfied or not. The progress made is demonstrated by a real-world case study. It is expected that the proposed approach constitutes a significant step towards more widely applicable secure information flow analysis.

Loading PDF

Similar Papers
  • Research Article
  • Citations1

Checking Just Pairs of Threads for Efficient and Scalable Incremental Verification of Multithreaded Programs

  • Jan 10, 2023
  • ACM SIGSOFT Software Engineering Notes
  • Pavel Parízek +1
  • Conference Article
  • Citations3

A Hierarchical CPN Model Automatically Generating Method Aiming at Multithreading Program Algorithm Error Detection

  • Dec 01, 2018
  • Tao Sun +1
  • Research Article
  • Citations1

Debugging Multithreaded Programs as if They Were Sequential

  • Jan 01, 2018
  • IEEE Access
  • Xiaodong Zhang +6
  • Book Chapter
  • Citations8

Formal Reasoning about Hardware and Software Memory Models

  • Jan 01, 2002
  • Abhik Roychoudhury
  • PDF
  • Research Article
  • Citations6

Bisimulation for Secure Information Flow Analysis of Multi-Threaded Programs

  • Jun 17, 2019
  • Mathematical and Computational Applications
  • Ali A Noroozi +2
  • Research Article
  • Citations88

Iterative context bounding for systematic testing of multithreaded programs

  • Jun 10, 2007
  • ACM SIGPLAN Notices
  • Madanlal Musuvathi +1
  • Conference Article
  • Citations506

Iterative context bounding for systematic testing of multithreaded programs

  • Jun 10, 2007
  • Madanlal Musuvathi +1
  • Conference Article
  • Citations5

Automated analysis of multithreaded programs for performance modeling

  • Sep 15, 2014
  • Alexander Tarvo +1
  • Research Article
  • Citations64

Modular verification of multithreaded programs

  • Jan 01, 2005
  • Theoretical Computer Science
  • Cormac Flanagan +3
  • Conference Article
  • Citations18

Complexity of pattern-based verification for multithreaded programs

  • Jan 26, 2011
  • Javier Esparza +1
  • Conference Article
  • Citations39

On the Feasibility of Cryptography for a Wireless Insulin Pump System

  • Mar 09, 2016
  • Eduard Marin +4
  • Research Article

Unstructured Text Data Security Attribute Mining Method Based on Multi‐Model Collaboration

  • Jan 20, 2025
  • Concurrency and Computation: Practice and Experience
  • Xiaohan Wang +4
  • Book Chapter
  • Citations12

Localizing Defects in Multithreaded Programs by Mining Dynamic Call Graphs

  • Jan 01, 2010
  • Frank Eichinger +3
  • Conference Article
  • Citations1

Depiction and playout of multi-threaded program executions

  • Oct 06, 2003
  • A Roychoudhury
  • Conference Article
  • Citations3

Debugging Multithreaded Programs as if They Were Sequential

  • Nov 01, 2016
  • Xiaodong Zhang +7
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.