N. Rinetzky and M. Sagiv. Interprocedural shape analysis for recursive programs. Lecture Notes in Computer Science, 2027:133--149, 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Shape Analysis through Predicate Abstraction and Model Checking - Dams, Namjoshi (2003) (10 citations) (Correct)
....[F ] t 1 ; t 2 ) fails to hold. Otherwise, nothing is replaced. Type reasoning is also used to simplify equalities; e.g. x = y) is false if the types of x and y di er. 5 An Example We illustrate our approach on a program for in place reversal of singly linked lists, also considered in e.g. [4, 24, 33, 28, 29]. The core of the program is given in Figure 6. List x, y, t; x is an acyclic list n1: y = NULL; n2: while (x = NULL) n3: t = y; n4: y = x; n5: x = x n; n6: y n = NULL; n7: y n = t; n8: Fig. 6. The list reversal program Initially, x is the list to be reversed. It is ....
N. Rinetzky and S. Sagiv. Interprocedural shape analysis for recursive programs. In Computational Complexity, pages 133-149, 2001.
Automatic Assume/Guarantee Reasoning for - Heap-Manipulating Programs Ongoing Self-citation (Sagiv) (Correct)
No context found.
N. Rinetzky and M. Sagiv. Interprocedural shape analysis for recursive programs. Lecture Notes in Computer Science, 2027:133--149, 2001.
A Relational Approach to Interprocedural Shape Analysis.. - Alexey Loginov Thomas Self-citation (Sagiv) (Correct)
No context found.
N. Rinetzky and M. Sagiv. Interprocedural shape analysis for recursive programs. In Int. Conf. on Comp. Construct., pages 133--149, 2001.
A Relational Approach to Interprocedural Shape Analysis.. - Alexey Loginov Thomas (2004) Self-citation (Sagiv) (Correct)
No context found.
Rinetzky, N., Sagiv, M.: Interprocedural shape analysis for recursive programs. In: Comp. Construct. Volume 2027 of Lec. Notes in Comp. Sci. (2001) 133--149
Static Program Analysis via 3-Valued Logic - Thomas Reps Mooly (2004) (2 citations) Self-citation (Sagiv) (Correct)
No context found.
Rinetzky, N., Sagiv, M.: Interprocedural shape analysis for recursive programs. In: Comp. Construct. Volume 2027 of Lec. Notes in Comp. Sci. (2001) 133--149
Establishing Local Temporal Heap Safety Properties.. - Shaham, Yahav.. (2003) Self-citation (Sagiv) (Correct)
....by relying on spatial instrumentation predicates, that give sharing, reachability and cyclicity information for heap objects [24] For other programs, allocation site information for heap objects suffices for the verification procedure. In both abstractions interprocedural information is computed [23]. Finally, our implementation allows simultaneous verification of several free or assign null properties, by maintaining several automaton states per program object. The back end, implemented using TVLA libraries, traverses the analysis results, i.e. the logical structures at every program ....
N. Rinetzky and M. Sagiv. Interprocedural shape analysis for recursive programs. Lecture Notes in Computer Science, 2027:133--149, 2001.
Verifying Safety Properties using Separation and - Heterogeneous Ions Eran (Correct)
No context found.
N. Rinetzky and M. Sagiv. Interprocedural shape analysis for recursive programs. LNCS, 2027:133--149, 2001.
Verifying Safety Properties using Separation and - Heterogeneous Ions Eran (Correct)
No context found.
N. Rinetzky and M. Sagiv. Interprocedural shape analysis for recursive programs. LNCS, 2027:133--149, 2001.
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