Structurally Defined Conditional Data-Flow Static Analysis

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.

[1]  Aws Albarghouthi,et al.  Parallelizing top-down interprocedural analyses , 2012, PLDI '12.

[2]  Thomas A. Henzinger,et al.  Conditional model checking: a technique to pass information between verifiers , 2012, SIGSOFT FSE.

[3]  Laure Gonnord,et al.  Using Bounded Model Checking to Focus Fixpoint Iterations , 2011, SAS.

[4]  Barry K. Rosen,et al.  Qualified Data Flow Problems , 1980, IEEE Transactions on Software Engineering.

[5]  Thomas W. Reps,et al.  Guided Static Analysis , 2007, SAS.

[6]  Flemming Nielson,et al.  Principles of Program Analysis , 1999, Springer Berlin Heidelberg.

[7]  Alexander Aiken,et al.  Conditional must not aliasing for static race detection , 2007, POPL '07.

[8]  Ben Hardekopf,et al.  A parallel abstract interpreter for JavaScript , 2015, 2015 IEEE/ACM International Symposium on Code Generation and Optimization (CGO).

[9]  Barbara G. Ryder,et al.  Performing data flow analysis in parallel , 1990, Proceedings SUPERCOMPUTING '90.

[10]  Xavier Rival,et al.  The trace partitioning abstract domain , 2007, TOPL.

[11]  Matthew B. Dwyer,et al.  Exploiting Domain and Program Structure to Synthesize Efficient and Precise Data Flow Analyses (T) , 2015, 2015 30th IEEE/ACM International Conference on Automated Software Engineering (ASE).

[12]  H. Cassé,et al.  WCET Computation on Software Components by Partial Static Analysis , .

[13]  Cristiano Calcagno,et al.  Infer: An Automatic Program Verifier for Memory Safety of C Programs , 2011, NASA Formal Methods.

[14]  David Monniaux,et al.  Succinct Representations for Abstract Interpretation , 2012, ArXiv.

[15]  Kedar S. Namjoshi,et al.  Pointer Analysis, Conditional Soundness, and Proving the Absence of Errors , 2008, SAS.

[16]  Barbara G. Ryder,et al.  Elimination algorithms for data flow analysis , 1986, CSUR.

[17]  David Monniaux,et al.  Succinct Representations for Abstract Interpretation - Combined Analysis Algorithms and Experimental Evaluation , 2012, SAS.

[18]  Hridesh Rajan,et al.  Boa: A language and infrastructure for analyzing ultra-large-scale software repositories , 2013, 2013 35th International Conference on Software Engineering (ICSE).

[19]  Patrick Cousot,et al.  Modular Static Program Analysis , 2002, CC.

[20]  Patrick Cousot,et al.  The ASTREÉ Analyzer , 2005, ESOP.