Johann Blieberger, Bernd Burgstaller, and Bernhard Scholz, Interprocedural Symbolic Evaluation of Ada Programs with Aliases, Ada-Europe'99 International Conference on Reliable Software Technologies (Santander, Spain), June 1999, pp. 136--145. 16, 21, 28  Home/Search   Document Details and Download   Summary   Related Articles   Check

.... # entry # 1 # 2 (#ld n# 1) # 2 # 3 # 4 # 5 ) 5.1. Symbolic Evaluation. Symbolic evaluation is a form of static program analysis in which symbolic expressions are used to denote the values of program variables and computations (cf. e.g. CHT79, Plo80, CR81, Sch96, BFS00, BB98, BBS99, BBS00, FS97] In addition a path condition describes the impact of the program s control flow onto the values of variables and the condition under which control flow reaches a given program point. 5.1.1. Program State and Context. The state S of a program is a set of pairs (v 1 , e 1 ) ....

....only if they are constant or of simple structure. Pointers are not treated at all because they are not contained in any example of this paper. How arrays can be treated in a symbolic evaluation framework is described and heavily used in [BFS00] The same ideas can be used to model aliasing e#ects [BBS99] and pointers [SBF00] 5.3. Symbolic Instrumentation. In this section we describe a method for determining symbolic path execution frequencies. We call the method symbolic instrumentation. Definition 5.7. For each basic block B i of a CFG we define a symbolic integervalued variable b i . The ....

[Article contains additional citation context not shown here]

Johann Blieberger, Bernd Burgstaller, and Bernhard Scholz, Interprocedural Symbolic Evaluation of Ada Programs with Aliases, Ada-Europe'99 International Conference on Reliable Software Technologies (Santander, Spain), June 1999, pp. 136--145. 16, 21, 28

.... is a form of static program analysis in which symbolic expressions are used to denote the values of program variables and computations (cf. e.g. Cheatham et al. 1979; Ploedereder, 1980; Clarke and Richardson, 1981; Scholz, 1996; Blieberger et al. 2000b; Blieberger and Burgstaller, 1998; Blieberger et al. 1999; Blieberger et al. 2000a; Fahringer and Scholz, 1997) In addition a path condition describes the impact of the program s control flow onto the values of variables and the condition under which control flow reaches a given program point. 5.1.1. Program State and Context The state S of a ....

....or of simple structure. Pointers are not treated at all because they are not contained in any example of this paper. How arrays can be treated in a symbolic evaluation framework is described and heavily used in (Blieberger et al. 2000b) The same ideas can be used to model aliasing effects (Blieberger et al. 1999) and pointers (Scholz et al. 2000) dfwcetklu.tex; 14 04 2000; 9:10; p.30 Data Flow Frameworks for WCET Analysis 31 5.3. Symbolic Instrumentation In this section we describe a method for determining symbolic path execution frequencies. We call the method symbolic instrumentation. Definition ....

[Article contains additional citation context not shown here]

Blieberger, J., B. Burgstaller, and B. Scholz: 1999, `Interprocedural Symbolic Evaluation of Ada Programs with Aliases'. In: Ada-Europe'99 International Conference on Reliable Software Technologies. Santander, Spain, pp. 136--145.

....onto the values of variables and the condition under which control flow reaches a given program point. In the past symbolic evaluation has been successfully applied to the reaching definitions problem [2] to worst case execution time analysis [1] to cache hit prediction [4] to alias analysis [3], to optimization problems of High Performance Fortran [12] and to pointer analysis for detecting memory leaks [17] The underlying program representation for symbolic evaluation is the control flow graph (CFG) a directed labelled graph. Its nodes are basic blocks containing the program ....

....all nodes in the CFG, a set of symbolic equations is used to compute program contexts. The equation system is solved by an elimination algorithm for data flow analysis [16] Symbolic Deadlock Detection in Ada Tasking Programs 3 3 Symbolic Data Flow Equations for Tasking Programs In previous work [3, 17, 4, 1] we have applied symbolic analysis for sequential programs. In order to analyze Ada programs with tasks we need a new form of analysis to cope with these notions of parallelism. To get a handle on the problem a new program representation, namely the tasking control flow graph (TCFG) is introduced ....

[Article contains additional citation context not shown here]

J. Blieberger, B. Burgstaller, and B. Scholz, Interprocedural Symbolic Evaluation of Ada Programs with Aliases, Ada-Europe'99 International Conference on Reliable Software Technologies (Santander, Spain), pp. 136--145.

....nil. A pointer variable is assigned a value from other pointer variables, from a new operation or it is set to nil. There is no memory overlap every eld is stored in a unique storage location . The third and forth restriction are important to avoid alias e ects of program variables [2] which goes beyond the scope of this paper. In the following we introduce heap algebra H , which is a formal vehicle to symbolically describe the heap. Then, we give the notions of symbolic evaluation for heap operations. Finally, we conclude this section with examples. 3.1 Heap Algebra In the ....

J. Blieberger, B. Burgstaller, and B. Scholz. Interprocedural Symbolic Evaluation of Ada Programs with Aliases. In Ada-Europe'99 International Conference on Reliable Software Technologies, pages 136-145, Santander, Spain, June 1999.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC