Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Data-flow analysis
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
=== IFDS problems === '''Interprocedural, finite, distributive, subset problems''' or '''IFDS''' problems are another class of problem with a generic polynomial-time solution.<ref name="Reps_1995"/><ref name="Naeem_2010"/> Solutions to these problems provide context-sensitive and flow-sensitive dataflow analyses. There are several implementations of IFDS-based dataflow analyses for popular programming languages, e.g. in the Soot<ref name="Bodden_2012"/> and WALA<ref name="Rapoport_2015"/> frameworks for Java analysis. Every bitvector problem is also an IFDS problem, but there are several significant IFDS problems that are not bitvector problems, including truly-live variables and possibly-uninitialized variables.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)