Staged concurrent program analysis

Sinha, Nishant; Wang, Chao

doi:10.1145/1882291.1882301

Cited by 41 publications

(37 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Yet, they do not handle nested interrupts. Sinha and Wang [2010; use axiomatic specifications of Sequential Consistency (SC) [Lamport 1997] to symbolically encode the executions of concurrent programs. Based on the semantics given in [Alglave et al 2012], Alglave et al [2013] introduce a symbolic encoding of concurrent programs that supports not only SC but also weaker memory models such as Intel's x86 and IBM's Power.…”

Section: Related Workmentioning

confidence: 99%

Effective Verification for Low-Level Software with Competing Interrupts

Liang

Melham

Kroening

et al. 2017

ACM Trans. Embed. Comput. Syst.

View full text Add to dashboard Cite

Interrupt-driven software is difficult to test and debug, especially when interrupts can be nested and subject to priorities. Interrupts can arrive at arbitrary times, leading to an exponential blow-up in the number of cases to consider. We present a new formal approach to verifying interrupt-driven software based on symbolic execution. The approach leverages recent advances in the encoding of the execution traces of interacting, concurrent threads. We assess the performance of our method on benchmarks drawn from embedded systems code and device drivers, and experimentally compare it to conventional approaches that use source-to-source transformations. Our results show that our method significantly outperforms these techniques. To the best of our knowledge, our work is the first to demonstrate effective verification of low-level embedded software with nested interrupts.

show abstract

Section: Related Workmentioning

confidence: 99%

Effective Verification for Low-Level Software with Competing Interrupts

Liang

Melham

Kroening

et al. 2017

ACM Trans. Embed. Comput. Syst.

View full text Add to dashboard Cite

show abstract

“…The bodies of the main function and the thread functions invoke only thread functions. We treat all the global variables as shared variables (similar to [39]). Authors of [23,38,10,9,40] assume that a pointer variable in the program accesses the data within its allocated memory bounds.…”

Section: Technical Descriptionmentioning

confidence: 99%

“…Static Analysis of Concurrent Applications: There are tools and frameworks developed to perform dataflow analysis [20,19]. In [32,22,39,20], a graph to represent the parallelism is built and a modified version of sequential analysis is performed. [21,14] provide a generic approach for static analysis of concurrent programs.…”

Section: Related Workmentioning

confidence: 99%

DEICS: Data Erasure in Concurrent Software

2014

View full text Add to dashboard Cite

A well known tenet for ensuring unauthorized leaks of sensitive data such as passwords and cryptographic keys is to erase ("zeroize") them after their intended use in any program. Prior work on minimizing sensitive data lifetimes has focused exclusively on sequential programs. In this work, we address the problem of data lifetime minimization for concurrent programs. We develop a new algorithm that precisely anticipates when to introduce these erasures, and develop an implementation of this algorithm in a tool called DEICS. Through an experimental evaluation, we show that DEICS is able to reduce lifetimes of shared sensitive data in several concurrent applications (over 100k lines of code combined) with minimal performance overheads.

show abstract

“…Another technique in this category was proposed by Sinha and Wang [19]. It is a staged static analysis that operates also on a concurrent CFG that captures interactions of all program threads (field accesses and thread synchronization).…”

Section: Related Workmentioning

confidence: 99%

Approximating happens-before order: interplay between static analysis and state space traversal

Parízek

Jančík

2014

Proceedings of the 2014 International SPIN Symposium on Model Checking of Software

View full text Add to dashboard Cite

Techniques and tools for verification of multi-threaded programs must cope with the huge number of possible thread interleavings. Tools based on systematic exploration of a program state space employ partial order reduction to avoid redundant thread interleavings. The key idea is to make non-deterministic thread scheduling choices only at statements that read or modify the global state shared by multiple threads. We focus on the approach to partial order reduction used in tools such as Java Pathfinder (JPF), which construct the program state space on-the-fly, and therefore can use only information available in the current program state and execution history to identify statements that may be globally-relevant.In our previous work, we developed a field access analysis that provides information about fields that may be accessed during program execution, and used it in JPF for more precise identification of globally-relevant statements. We build upon that and propose a may-happen-before analysis that computes a sound approximation of the happens-before ordering. Partial order reduction techniques can use the happens-before ordering to detect pairs of globallyrelevant field access statements that cannot be interleaved arbitrarily (due to thread synchronization), and based on that avoid making unnecessary thread scheduling choices. The may-happen-before analysis combines static analysis with knowledge of information available from the dynamic program state. Results of experiments with several Java programs show that usage of the may-happenbefore analysis further improves the performance of JPF.

show abstract

Staged concurrent program analysis

Cited by 41 publications

References 31 publications

Effective Verification for Low-Level Software with Competing Interrupts

Effective Verification for Low-Level Software with Competing Interrupts

DEICS: Data Erasure in Concurrent Software

Approximating happens-before order: interplay between static analysis and state space traversal

Contact Info

Product

Resources

About