Pointer analysis is one of the key static analyses during compilation and affects scalability and precision of several client transformations. Recent advances still lack an efficient and scalable context-sensitive inclusion-based pointer analysis. In this work, we propose four novel techniques to improve the scalability of context-sensitive points-to analysis for C/C++ programs. First, we develop an efficient way of storing the approximate points-to information using a multi-dimensional bloom filter (multibloom). Second, we devise a sound randomized algorithm that processes a group of constraints in a less precise but efficient manner and the remaining constraints in a more precise manner. Third, we transform the points-to analysis problem into finding a solution to a system of linear equations. Finally, we observe that the order in which points-to constraints are processed plays a vital role in the algorithm efficiency and propose a greedy heuristic based on the amount of points-to information computed by a constraint to prioritize the constraints. We illustrate that our algorithms help in scaling the state-of-the-art pointer analyses.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Rupesh Nasre is an Assistant Professor at IIT Madras. He received Ph.D. from IISc, Bangalore. His research interests include Compilers and Parallelization. He is a recipient of the Young Faculty Recognition Award at IIT Madras, NVIDIA special prize in CodeForScience, a winner of the Yahoo! University Hack Day and holds five US patents.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Pointer analysis is one of the key static analyses during compilation and affects scalability and precision of several client transformations. Recent advances still lack an efficient and scalable context-sensitive inclusion-based pointer analysis. In this work, we propose four novel techniques to improve the scalability of context-sensitive points-to analysis for C/C++ programs. First, we develop an efficient way of storing the approximate points-to information using a multi-dimensional bloom filter (multibloom). Second, we devise a sound randomized algorithm that processes a group of constraints in a less precise but efficient manner and the remaining constraints in a more precise manner. Third, we transform the points-to analysis problem into finding a solution to a system of linear equations. Finally, we observe that the order in which points-to constraints are processed plays a vital role in the algorithm efficiency and propose a greedy heuristic based on the amount of points-to information computed by a constraint to prioritize the constraints. We illustrate that our algorithms help in scaling the state-of-the-art pointer analyses. 212 pp. Englisch. Bestandsnummer des Verkäufers 9783659977183
Anzahl: 2 verfügbar
Anbieter: moluna, Greven, Deutschland
Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Nasre RupeshRupesh Nasre is an Assistant Professor at IIT Madras. He received Ph.D. from IISc, Bangalore. His research interests include Compilers and Parallelization. He is a recipient of the Young Faculty Recognition Award at IIT M. Bestandsnummer des Verkäufers 151429952
Anzahl: Mehr als 20 verfügbar
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Pointer analysis is one of the key static analyses during compilation and affects scalability and precision of several client transformations. Recent advances still lack an efficient and scalable context-sensitive inclusion-based pointer analysis. In this work, we propose four novel techniques to improve the scalability of context-sensitive points-to analysis for C/C++ programs. First, we develop an efficient way of storing the approximate points-to information using a multi-dimensional bloom filter (multibloom). Second, we devise a sound randomized algorithm that processes a group of constraints in a less precise but efficient manner and the remaining constraints in a more precise manner. Third, we transform the points-to analysis problem into finding a solution to a system of linear equations. Finally, we observe that the order in which points-to constraints are processed plays a vital role in the algorithm efficiency and propose a greedy heuristic based on the amount of points-to information computed by a constraint to prioritize the constraints. We illustrate that our algorithms help in scaling the state-of-the-art pointer analyses. Bestandsnummer des Verkäufers 9783659977183
Anzahl: 1 verfügbar
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
Paperback. Zustand: Brand New. 212 pages. 8.66x5.91x0.48 inches. In Stock. Bestandsnummer des Verkäufers 3659977187
Anzahl: 1 verfügbar
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
Taschenbuch. Zustand: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Pointer analysis is one of the key static analyses during compilation and affects scalability and precision of several client transformations. Recent advances still lack an efficient and scalable context-sensitive inclusion-based pointer analysis. In this work, we propose four novel techniques to improve the scalability of context-sensitive points-to analysis for C/C++ programs. First, we develop an efficient way of storing the approximate points-to information using a multi-dimensional bloom filter (multibloom). Second, we devise a sound randomized algorithm that processes a group of constraints in a less precise but efficient manner and the remaining constraints in a more precise manner. Third, we transform the points-to analysis problem into finding a solution to a system of linear equations. Finally, we observe that the order in which points-to constraints are processed plays a vital role in the algorithm efficiency and propose a greedy heuristic based on the amount of points-to information computed by a constraint to prioritize the constraints. We illustrate that our algorithms help in scaling the state-of-the-art pointer analyses.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 212 pp. Englisch. Bestandsnummer des Verkäufers 9783659977183
Anzahl: 1 verfügbar