Filters








4,012 Hits in 5.9 sec

An Empirical Study on the Granularity of Pointer Analysis in C Programs [chapter]

Tong Chen, Jin Lin, Wei-Chung Hsu, Pen-Chung Yew
2005 Lecture Notes in Computer Science  
One of the important aspects of pointer analysis methods is their granularity, the way in which the memory objects are named for analysis.  ...  Pointer analysis plays a critical role in modern C compilers because of the frequent appearances of pointer expressions.  ...  Introduction The pervasive use of pointer expressions in C programs has created a serious problem for the C compilers.  ... 
doi:10.1007/11596110_11 fatcat:6xnthihkhrfwtdwuf7nvmo5xaq

GPT Conjecture: Understanding the Trade-offs between Granularity, Performance and Timeliness in Control-Flow Integrity [article]

Zhilong Wang, Peng Liu
2021 arXiv   pre-print
Accordingly, we proposed the GPT conjecture to pinpoint the trade-off in designing CFI schemes, which says that at most two out of three properties (fine granularity, acceptable performance, and preventive  ...  Although the three questions probably cannot be directly answered, they are inspiring. We find that a deeper understanding of the nature of the trade-off will help answer the three questions.  ...  We have verified the rationality of our conjecture based on an empirical study on existing works.  ... 
arXiv:1911.07828v3 fatcat:rfse3gkqofe6vchiummufoxy2u

Position paper: GPT conjecture: understanding the trade-offs between granularity, performance and timeliness in control-flow integrity

Zhilong Wang, Peng Liu
2021 Cybersecurity  
Accordingly, we proposed the GPT conjecture to pinpoint the trade-off in designing CFI schemes, which says that at most two out of three properties (fine granularity, acceptable performance, and preventive  ...  Although the three questions probably cannot be directly answered, they are inspiring. We find that a deeper understanding of the nature of the trade-off will help answer the three questions.  ...  Availability of data and materials Not applicable. Declarations Competing interests The authors declare that they have no competing interests. Received: 14 May 2021 Accepted: 9 August 2021  ... 
doi:10.1186/s42400-021-00098-2 fatcat:6r2q57vkxzfjrhftaoo7qkbneu

An empirical study of static program slice size

David Binkley, Nicolas Gold, Mark Harman
2007 ACM Transactions on Software Engineering and Methodology  
This article presents results from a study of all slices from 43 programs, ranging up to 136,000 lines of code in size. The study investigates the effect of five aspects that affect slice size.  ...  The results show that for the most precise slicer, the average slice contains just under one-third of the program.  ...  Gregg Rothermel provided the program empire and Erin Ptah assisted with the presentation.  ... 
doi:10.1145/1217295.1217297 fatcat:vq5bgp4k4rhlflgxzncud26qdq

Using the run-time sizes of data structures to guide parallel-thread creation

Lorenz Huelsbergen, James R. Larus, Alexander Aiken
1994 ACM SIGPLAN Lisp Pointers  
Performance measurements of dynamic granularity estimation in a parallel ML implementation on a shared-memory machine demonstrate the possibility of large reductions (> 20%) in execution time.  ...  Therefore, dynamic granularity estimation has compile-time and run-time components: Abstract interpretation statically identi es functions whose complexity depends on data structure sizes the run-time  ...  Acknowledgement This work was supported in part by the National Science Foundation under grant CCR-9101035 and by t h e Wisconsin Alumni Research F oundation. L.  ... 
doi:10.1145/182590.182442 fatcat:oy6fb7o2krdplanelqdx7phzba

A persistent runtime system using persistent data structures

Zhiqing Liu
1996 Proceedings of the 1996 ACM symposium on Applied Computing - SAC '96  
example as an application of the system.  ...  To address the issue that the space requirements can still be substantial and unbounded, we provide an approach to scale down the number of versions of runtime state actually recorded.  ...  for their invaluable comments on this work.  ... 
doi:10.1145/331119.331420 dblp:conf/sac/Liu96 fatcat:ivfidkfwlzggfezxxeqmcherwy

Using the run-time sizes of data structures to guide parallel-thread creation

Lorenz Huelsbergen, James R. Larus, Alexander Aiken
1994 Proceedings of the 1994 ACM conference on LISP and functional programming - LFP '94  
Performance measurements of dynamic granularity estimation in a parallel ML implementation on a shared-memory machine demonstrate the possibility of large reductions (> 20%) in execution time.  ...  Therefore, dynamic granularity estimation has compile-time and run-time components: Abstract interpretation statically identi es functions whose complexity depends on data structure sizes the run-time  ...  Acknowledgement This work was supported in part by the National Science Foundation under grant CCR-9101035 and by t h e Wisconsin Alumni Research F oundation. L.  ... 
doi:10.1145/182409.182442 dblp:conf/lfp/HuelsbergenLA94 fatcat:mthkd6a2nzbvfgh777xqovmbjm

Breaking Type Safety in Go: An Empirical Study on the Usage of the unsafe Package [article]

Diego Elias Costa, Suhaib Mujahid, Rabe Abdalkareem, Emad Shihab
2021 arXiv   pre-print
In this paper, we present the first large-scale study on the usage of the unsafe package in 2,438 popular Go projects.  ...  A decade after its first release, the Go programming language has become a major programming language in the development landscape.  ...  ACKNOWLEDGMENT The authors would like to thank Matthew Dempsky, for providing invaluable feedback and for communicating our work to members of the Go Team.  ... 
arXiv:2006.09973v4 fatcat:c6yglxype5bzvjr4ymn2bm43jy

Static Execute After/Before as a replacement of traditional software dependencies

Judit Jasz, Arpad Beszedes, Tibor Gyimothy, Vaclav Rajlich
2008 2008 IEEE International Conference on Software Maintenance  
In our case study we use about 30 subject programs that were previously used by other authors in empirical studies of program analysis. We report two main results.  ...  The paper then discusses whether based on these results the computation of the SDG should be replaced in some applications by the computation of the SEA/SEB.  ...  Any opinions, findings, conclusions, or recommendations expressed in this material are those of the author and do not necessarily reflect the views of the NSF or IBM.  ... 
doi:10.1109/icsm.2008.4658062 dblp:conf/icsm/JaszBGR08 fatcat:ruwjqfyp7rbdtkizjoqgdo2d3y

Evaluation of Semantic Interference Detection in Parallel Changes: an Exploratory Experiment

Danhua Shao, Sarfraz Khurshid, Dewayne E Perry
2007 Conference on Software Maintenance, Proceedings of the  
We use the match rate between semantic interference and faults to evaluate the effectiveness of the analyzer in predicting faults. Our contributions in this evaluative empirical study are twofold.  ...  To evaluate the analyzer's effectiveness in fault prediction, we designed an experiment in the context of an industrial project.  ...  her review of our preliminary results; and Xiangyu Zhang, Purdue University, for the discussion on dynamic slicing issues.  ... 
doi:10.1109/icsm.2007.4362620 dblp:conf/icsm/ShaoKP07 fatcat:c74bxcfxavhdtbuukisf3egzjy

How is aliasing used in systems software?

Brian Hackett, Alex Aiken
2006 Proceedings of the 14th ACM SIGSOFT international symposium on Foundations of software engineering - SIGSOFT '06/FSE-14  
We present a study of all sources of aliasing in over one million lines of C code, identifying in the process the common patterns of aliasing that arise in practice.  ...  We find that aliasing has a great deal of structure in real programs and that just nine programming idioms account for nearly all aliasing in our study.  ...  Third, we use the analysis to carry out a study of how aliasing is used in large C system programs and in the process show that the analysis is much more precise than previously reported results for static  ... 
doi:10.1145/1181775.1181785 dblp:conf/sigsoft/HackettA06 fatcat:k6lbzwegkfc6llnfp6e7dbtrqa

Decomposing memory performance

Kartik K. Agaram, Stephen W. Keckler, Calvin Lin, Kathryn S. McKinley
2006 Proceedings of the 2006 international symposium on Memory management - ISMM '06  
The second is a technique to determine the correct granularity at which to study the global phase behavior of applications.  ...  This paper explores the potential of highlevel application understanding in improving the performance of modern memory hierarchies, decomposing the often-chaotic address stream of an application into multiple  ...  Acknowledgments The design of DTrack was influenced by discussions with students in the CART and Speedway research groups.  ... 
doi:10.1145/1133956.1133970 dblp:conf/iwmm/AgaramKLM06 fatcat:ahkonz4j2vgxzlyp44xyoxfide

Efficient Flow-Sensitive Interprocedural Data-Flow Analysis in the Presence of Pointers [chapter]

Teck Bok Tok, Samuel Z. Guyer, Calvin Lin
2006 Lecture Notes in Computer Science  
Unlike other techniques for sparse analysis, our algorithm does not rely on precomputed def-use chains, since this computation can itself require costly analysis, particularly in the presence of pointers  ...  Instead, we compute def-use chains on the fly during the analysis, along with precise pointer information.  ...  We thank Ben Hardekopf and Kathryn McKinley for their valuable comments on early drafts of this paper.  ... 
doi:10.1007/11688839_3 fatcat:hrquucl42vbdpdmnembyglftl4

Effective and Efficient Memory Protection Using Dynamic Tainting

Ioannis Doudalis, James Clause, Guru Venkataramani, Milos Prvulovic, Alessandro Orso
2012 IEEE transactions on computers  
Programs written in languages allowing direct access to memory through pointers often contain memory-related faults, which cause nondeterministic failures and security vulnerabilities.  ...  Taint marks are then propagated and checked every time a memory address m is accessed through a pointer p; if the associated taint marks differ, an illegal access is reported.  ...  Any opinions expressed in this paper are those of the authors and do not necessarily reflect the views of the US Air Force.  ... 
doi:10.1109/tc.2010.215 fatcat:42cilvqzbrcd7jdymusg6kq3ui

Translating C to safer Rust

Mehmet Emre, Ryan Schroeder, Kyle Dewey, Ben Hardekopf
2021 Proceedings of the ACM on Programming Languages (PACMPL)  
We conduct an in-depth study into the underlying causes of unsafety in translated programs and the relative impact of fixing each cause.  ...  In this paper we investigate the problem of automatically translating C programs into safer Rust programs--that is, Rust programs that improve on the safety guarantees of the original C programs.  ...  Our first contribution is a quantitative study on the sources and causes of unsafety present in Rust programs that have been syntactically translated from C programs.  ... 
doi:10.1145/3485498 fatcat:vbadido2yfehvkanuhgjt55uci
« Previous Showing results 1 — 15 out of 4,012 results