Feedback-driven points-to analysis | Zendy

Tobias Gutzmann | Zendy; Jonas Lundberg | Zendy; Welf Löwe | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Feedback-driven points-to analysis

Author(s) -

Tobias Gutzmann,

Jonas Lundberg,

Welf Löwe

Publication year - 2011

Publication title -

kth publication database diva (kth royal institute of technology)

Language(s) - English

Resource type - Conference proceedings

DOI - 10.1145/1982185.1982475

Subject(s) - mathematical proof , a priori and a posteriori , computer science , upper and lower bounds , algorithm , theoretical computer science , mathematics , geometry , mathematical analysis , philosophy , epistemology

In this paper, we present feedback-driven points-to analysis where any classical points-to analysis has its points-to results at certain program points guarded by a-priori upper bounds. Such upper bounds can come from other points-to analyses -- this is of interest when different approaches are not strictly ordered in terms of accuracy -- and from human insight, i.e., manual proofs that certain points-to relations are infeasible for every program run.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research