Filters








376 Hits in 8.0 sec

A relational approach to interprocedural shape analysis

Bertrand Jeannet, Alexey Loginov, Thomas Reps, Mooly Sagiv
2010 ACM Transactions on Programming Languages and Systems  
The algorithm creates procedure summaries using abstracted relations over memory configurations, and the meet-based composition operation provides a way to apply the summary transformer for a procedure  ...  -It applies these ideas in a new algorithm for context-sensitive interprocedural shape analysis.  ...  Kuncak for several discussions about the use of two-vocabulary structures in shape analysis; to N.  ... 
doi:10.1145/1667048.1667050 fatcat:hdz3xg5h7valjfg6lsooopgweq

A Relational Approach to Interprocedural Shape Analysis [chapter]

Bertrand Jeannet, Alexey Loginov, Thomas Reps, Mooly Sagiv
2004 Lecture Notes in Computer Science  
The algorithm creates procedure summaries using abstracted relations over memory configurations, and the meet-based composition operation provides a way to apply the summary transformer for a procedure  ...  -It applies these ideas in a new algorithm for context-sensitive interprocedural shape analysis.  ...  Kuncak for several discussions about the use of two-vocabulary structures in shape analysis; to N.  ... 
doi:10.1007/978-3-540-27864-1_19 fatcat:gwzrvcoxxnhx3no73rivmkavra

Interprocedural Shape Analysis with Separated Heap Abstractions [chapter]

Alexey Gotsman, Josh Berdine, Byron Cook
2006 Lecture Notes in Computer Science  
We describe an interprocedural shape analysis that makes use of spatial locality (i.e. the fact that most procedures modify only a small subset of the heap) in its representation of abstract states.  ...  The authors would also like to thank Noam Rinetzky for providing the test programs used in [15] and the anonymous reviewers for useful suggestions.  ...  Hackett & Rugina Several papers have described TVLA-based interprocedural shape analyses (i.e. [14, 13, 15] ) where the procedure summaries operate on local heaps.  ... 
doi:10.1007/11823230_16 fatcat:jo6ybevimbdkdagtheok5ig7wq

Compositional shape analysis by means of bi-abduction

Cristiano Calcagno, Dino Distefano, Peter O'Hearn, Hongseok Yang
2008 Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '09  
The analysis uses an abstract domain based on a restricted fragment of separation logic, and assigns a collection of Hoare triples to each procedure; the triples provide an over-approximation of data structure  ...  This paper describes a compositional shape analysis, where each procedure is analyzed independently of its callers.  ...  We would like to thank Jan Tobias Mühlberg for providing the benchmarks which initially sparked this work, Paul Kelly for giving us access to his group's 8-core machine, and Wei-Ngan Chin for useful comments  ... 
doi:10.1145/1480881.1480917 dblp:conf/popl/CalcagnoDOY09 fatcat:awkmfsvz3rg55eq2dsnsurf7bq

Compositional Shape Analysis by Means of Bi-Abduction

Cristiano Calcagno, Dino Distefano, Peter W. O'Hearn, Hongseok Yang
2011 Journal of the ACM  
The analysis uses an abstract domain based on a restricted fragment of separation logic, and assigns a collection of Hoare triples to each procedure; the triples provide an over-approximation of data structure  ...  This paper describes a compositional shape analysis, where each procedure is analyzed independently of its callers.  ...  We would like to thank Jan Tobias Mühlberg for providing the benchmarks which initially sparked this work, Paul Kelly for giving us access to his group's 8-core machine, and Wei-Ngan Chin for useful comments  ... 
doi:10.1145/2049697.2049700 fatcat:hjbrnwfa5nexngy3ibif4rf664

Compositional shape analysis by means of bi-abduction

Cristiano Calcagno, Dino Distefano, Peter O'Hearn, Hongseok Yang
2009 SIGPLAN notices  
The analysis uses an abstract domain based on a restricted fragment of separation logic, and assigns a collection of Hoare triples to each procedure; the triples provide an over-approximation of data structure  ...  This paper describes a compositional shape analysis, where each procedure is analyzed independently of its callers.  ...  We would like to thank Jan Tobias Mühlberg for providing the benchmarks which initially sparked this work, Paul Kelly for giving us access to his group's 8-core machine, and Wei-Ngan Chin for useful comments  ... 
doi:10.1145/1594834.1480917 fatcat:qp673bju6bahfaucp5voqbkmtm

Automatic pool allocation for disjoint data structures

Chris Lattner, Vikram Adve
2002 Proceedings of the workshop on Memory system performance - MSP '02  
The fully automatic transformation converts ordinary programs to use pool (aka region) allocation for heap-based data structures.  ...  The transformation relies on an efficient link-time interprocedural analysis to identify disjoint data structures in the program, to check whether these data structures are accessed in a type-safe manner  ...  A simple transformation would be to use fixed 32-bit indices, and generate a runtime error if a single logical structure uses more than ¾ ¿¾ ½ separate objects at runtime.  ... 
doi:10.1145/773146.773041 fatcat:5vk6yqmglvahzlzfnp3y3q5b7a

Automatic pool allocation for disjoint data structures

Chris Lattner, Vikram Adve
2003 SIGPLAN notices  
The fully automatic transformation converts ordinary programs to use pool (aka region) allocation for heap-based data structures.  ...  The transformation relies on an efficient link-time interprocedural analysis to identify disjoint data structures in the program, to check whether these data structures are accessed in a type-safe manner  ...  A simple transformation would be to use fixed 32-bit indices, and generate a runtime error if a single logical structure uses more than ¾ ¿¾ ½ separate objects at runtime.  ... 
doi:10.1145/773039.773041 fatcat:5meru3jnwjgdncin2ij2ws25yu

Interprocedural Shape Analysis for Cutpoint-Free Programs [chapter]

Noam Rinetzky, Mooly Sagiv, Eran Yahav
2005 Lecture Notes in Computer Science  
We present a framework for interprocedural shape analysis, which is contextand flow-sensitive with the ability to perform destructive pointer updates.  ...  Technically, our analysis computes procedure summaries as transformers from inputs to outputs while ignoring parts of the heap not relevant to the procedure.  ...  interprocedural shape analysis.  ... 
doi:10.1007/11547662_20 fatcat:3pncexkidffmjge2ajlnxizrje

Interprocedural Shape Analysis for Effectively Cutpoint-Free Programs [chapter]

J. Kreiker, T. Reps, N. Rinetzky, M. Sagiv, Reinhard Wilhelm, E. Yahav
2013 Lecture Notes in Computer Science  
We present a framework for local interprocedural shape analysis that computes procedure summaries as transformers of procedure-local heaps (the parts of the heap that the procedure may reach).  ...  A main challenge in procedurelocal shape analysis is the handling of cutpoints, objects that separate the input heap of an invoked procedure from the rest of the heap, which-from the viewpoint of that  ...  [28] present a heap-modular interprocedural shape analysis that, similar to [8] , is based on a domain of separation-logic formulae.  ... 
doi:10.1007/978-3-642-37651-1_17 fatcat:robitlvuwvbrtibezx6cc2yemq

Program analysis via graph reachability

Thomas Reps
1998 Information and Software Technology  
Section 4 discusses how the graphreachability approach can be used to tackle interprocedural dataflow analysis, interprocedural program slicing, shape analysis, and flow-insensitive points-to analysis.  ...  . − 2 − Interprocedural program slicing Interprocedural versions of a large class of dataflow-analysis problems A method for approximating the possible "shapes" that heap-allocated structures can take  ...  Kleinberg pointed out the use of CFLreachability in reference [28] .  ... 
doi:10.1016/s0950-5849(98)00093-7 fatcat:jjmzbhmogfcnnbycwmttruel6i

Parallelizing irregular C codes assisted by interprocedural shape analysis

R. Asenjo, R. Castillo, F. Corbera, A. Navarro, A. Tineo, E.L. Zapata
2008 Proceedings, International Parallel and Distributed Processing Symposium (IPDPS)  
In this work we present a novel fully context-sensitive interprocedural shape analysis algorithm that supports recursion and can be used to uncover parallelism.  ...  We have also implemented a data dependence test over our interprocedural shape analysis.  ...  A important body of them use separation logic [6] , [13] , [1] , [8] to describe the shape of data structures through recursively defined predicates.  ... 
doi:10.1109/ipdps.2008.4536285 dblp:conf/ipps/AsenjoCCNTZ08 fatcat:zjaqmkxqyzbxdkdre5o4olir3m

Interprocedural Shape Analysis for Recursive Programs [chapter]

Noam Rinetzky, Mooly Sagiv
2001 Lecture Notes in Computer Science  
We present a novel technique for shape analysis of recursive programs. An algorithm based on our technique has been implemented.  ...  A shape-analysis algorithm statically analyzes a program to determine information about the heap-allocated data structures that the program manipulates.  ...  The Use of 3-Valued Logic for Program Analysis The algorithm is explained (and implemented) using the 3-valued logic framework developed in [13, 15] .  ... 
doi:10.1007/3-540-45306-7_10 fatcat:ky2oosu4dve5be6ytjjlgvuzya

The ParaScope parallel programming environment

K.D. Cooper, M.W. Hall, R.T. Hood, K. Kennedy, K.S. McKinley, J.M. Mellor-Crummey, L. Torczon, S.K. Warren
1993 Proceedings of the IEEE  
It assists the knowledgeable user by displaying and managing analysis and by providing a variety of interactive program transformations that are e ective in exposing parallelism.  ...  The ParaScope parallel programming environment, developed to support scienti c programming of sharedmemory multiprocessors, includes a collection of tools that use global program analysis to help users  ...  Recompilation analysis is handled using methods described by Burke and Torczon 19]. Interprocedural Analysis Interprocedural data-ow analysis addresses several distinct problems.  ... 
doi:10.1109/5.214549 fatcat:cv2fepwfgjfb3icllyqvpsfuqm

Shape Analysis

Bor-Yuh Evan Chang, Cezara Drăgoi, Roman Manevich, Noam Rinetzky, Xavier Rival
2020 Foundations and Trends® in Programming Languages  
Bor-Yuh Evan Chang, Cezara Drăgoi, Roman Manevich, Noam Rinetzky and Xavier Rival (2020), "Shape Analysis", Foundations and Trends R in Programming Languages: Vol. 6, No. 1-2, pp 1-158.  ...  ., shape graphs, three-valued logic, and separation logic, do.  ...  "A local shape analysis based on separation logic". In: Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS). Springer. 287-302. Dor, N., J. Field, D. Gopan, T.  ... 
doi:10.1561/2500000037 fatcat:77d5la5xw5alrkkr5oleqjhzbe
« Previous Showing results 1 — 15 out of 376 results