Static Detection of Access Anomalies in Ada95

Lecture Notes in Computer Science

2006

Self Cite

Abstract. We present a generic symbolic analysis framework for imperative programming languages. Our framework is capable of computing all valid variable bindings of a program at given program points. This information is invaluable for domain-specific static program analyses such as memory leak detection, program parallelisation, and the detection of superfluous bound checks, variable aliases and task deadlocks. We employ path expression algebra to model the control flow information of programs. A homomorphism maps path expressions into the symbolic domain. At the center of the symbolic domain is a compact algebraic structure called supercontext. A supercontext contains the complete control and data flow analysis information valid at a given program point. Our approach to compute supercontexts is based purely on algebra and is fully automated. This novel representation of program semantics closes the gap between program analysis and computer algebra systems, which makes supercontexts an ideal intermediate representation for all domainspecific static program analyses. Our approach is more general than existing methods because it can derive solutions for arbitrary (even intra-loop) nodes of reducible and irreducible control flow graphs. We prove the correctness of our symbolic analysis method. Our experimental results show that the problem sizes arising from real-world applications such as the SPEC95 benchmark suite are tractable for our symbolic analysis framework.

Section: Discussionmentioning

confidence: 99%

“…The two distinguished data points in the upper right corner represent the 0.9 quantile and the 0.94 quantile. It follows from those data points that 90 percent of the 9 Hence the name ncc which stands for number of closure contexts.…”

Section: Methodsmentioning

confidence: 99%

Symbolic Analysis of Imperative Programming Languages

Burgstaller

Scholz

Lecture Notes in Computer Science

2006

Self Cite

“…If only the shown statements access the shared variables e and f we get with our algorithm one block for each of the first two threads, namely bl 1 and bl 2 , respectively. Because the third thread accesses both of the two variables two blocks are being generated, namely bl 3 and bl 4 .…”

Section: Examplementioning

confidence: 99%

“…Only the orders of bl 1 and bl 3 The third thread contains an intra-thread order bl 3 < bl 4 . Because of this the initial PO graph for every concrete interleaving (in this example) looks like the one depicted in Fig.…”

Section: Examplementioning

confidence: 99%

Static Partial-Order Reduction of Concurrent Systems in Polynomial Time

Mittermayr

Communications in Computer and Information Science

2008

Self Cite

“…They occur when several concurrent execution threads access (write-write, or read-write) the same memory area without coordination. [16] An implementation of the analysis framework proposed by Blieberger et al [17] aims at detecting such access anomalies by means of static analysis.…”

mentioning

confidence: 99%

A Framework for CFG-Based Static Program Analysis of Ada Programs

Fechete

Kienesberger

Reliable Software Technologies – Ada-Europe 2008

Self Cite

Abstract. The control flow graph is the basis for many code optimisation and analysis techniques. We introduce a new framework for the construction of powerful CFG-based representations of arbitrary Ada programs. The generated data holds extensive information about the original Ada source, such as visibility, package structure and type definitions and provides means for complete interprocedural analysis. We use ASIS-for-GNAT as an interface to the Ada environment and extract the needed information in a single traversal of the provided syntax trees. In addition, further refinement of the resulting data structures is done.