Skip to main content

Structurally Defined Conditional Data-Flow Static Analysis

Elena Sherman, Matthew B. Dwyer

Full text DOI 10.1007/978-3-319-89963-3_15 dblp BibTeX

Abstract

Data flow analysis (DFA) is an important verification technique that computes the effect of data values propagating over program paths. While more precise than flow-insensitive analyses, such an analysis is time-consuming.

Related papers

Incremental data flow analysis in a structured program editor PLDI 1984
Synchronous Kahn Networks ICFP 1996
Static specification inference using predicate mining PLDI 2007
Canary: practical static detection of inter-thread value-flow bugs PLDI 2021
Monoids for Rapid Data Flow Analysis POPL 1978
Data Races and Static Analysis for Interrupt-Driven Kernels ESOP 2019
A global communication optimization technique based on data-flow analysis and linear algebra TOPLAS 1999
Checking type safety of foreign function calls TOPLAS 2008