| M. Sagiv, T. Reps, and R. Wilhelm. Parametric shape analysis via 3-valued logic. Tech. Rep. TR-1383, Comp. Sci. Dept., Univ. of Wisconsin, Madison, WI, July 1998. Available at "http://www.cs.wisc.edu/wpis/papers/parametric.ps". |
....example as well as in all the other programs this does not lead to false alarms since no cyclic lists are created. The advantage of our simplified approach is that it can be implemented in time linear in the size of the shape graph. A more precise and more expensive solution is described in [20]. x l 1 n l 2 n l 3 n l 4 n Delta Delta y OO x ONMLHIJK n1 x; y n n2 x; y n n n kk ONMLHIJK n3 x; y n kk y OO (a) b) Fig. 5. A cyclic concrete store (a) and the corresponding shape graph (b) 2.3 Cleanness Checking Every statement has a ....
M. Sagiv, T. Reps, and R. Wilhelm. Parametric shape analysis via 3-valued logic. Tech. Rep. TR-1383, Comp. Sci. Dept., Univ. of Wisconsin, Madison, WI, July 1998. Available at "http://www.cs.wisc.edu/wpis/papers/parametric.ps".
....of how three valued logic is used to define abstractions of concrete stores (which is needed for Section 4 and subsequent sections) Section 5 defines the more elaborate version of the shape analysis framework. Due to space constraints, some aspects of the abstract semantics are omitted (see [18]) Section 6 contains a short account of related work. 2 An Overview of the Parametric Framework Figure 1(a) shows the declaration of a linked list data type in C, and Figure 1(b) shows a C program that reverses a list via destructive updating. The analysis of the shapes of the data structures ....
....of constraints obtained by applying r to each of the formulae in F . 2 Rule (26) was added to enable an arbitrary formula to be converted to a constraint. Example 5.14 The constraints generated for the formulae that appear above the line in Table 4 are listed above the line in Table 7. 2 In [18], we define a closure operator d closure(F ) that generates certain logical consequences of a set F of compatibility formulae. For instance, the three formulae below the line in Table 4 are generated by d closure(F ) where F is the set of formulae given above the line in Table 4. The ....
M. Sagiv, T. Reps, and R. Wilhelm. Parametric shape analysis via 3-valued logic. Tech. Rep. TR-1383, Comp. Sci. Dept., Univ. of Wisconsin, Madison, WI, July 1998. Available at "http://www.cs.wisc.edu/wpis/papers/parametric.ps".
....into an Lr formula. 1 Introduction This paper aims to provide a better formalism for describing properties of linked data structures (e.g. lists, trees, graphs) In past work with the same motivation, a variety of different formalisms have been developed including static shape graphs [14, 15, 17, 12, 3, 23, 1, 19, 27, 21, 20, 22], path matrices [9, 11] graph types [16] and the ADDS annotation formalism [10] and several previously known formalisms have been exploited including graph grammars [6] and monadic second order logic [13] For lack of a better term, we will use the phrase structure description ....
....however, many of the techniques that have been proposed in the literature have the feature that additional imprecision crops up when information is extracted from the structure descriptor for a particular program point. For instance, with the threevalued logic used for shape analysis in [20, 22], a formula that queries for a specific piece of information sometimes evaluates to unknown , even when, in all of the stores that the static shape graph represents, the formula evaluates to a definite true or false value. For a structure description formalism in which each structure descriptor ....
[Article contains additional citation context not shown here]
M. Sagiv, T. Reps, and R. Wilhelm. Parametric shape analysis via 3-valued logic. Tech. Rep. TR-1383, Comp. Sci. Dept., Univ. of Wisconsin, Madison, WI, July 1998. Available at "http://www.cs.wisc.edu/wpis/papers/parametric.ps".
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