Patrick Cousot, Calculational design of a static dependency analysis

Patrick Cousot.
Calculational design of a static dependency analysis
ETAPS 2019 Mooly Fest, ETAPS, Prague, Czech Republic, Saturday April 6th, 2019.
Slides of the 30mn presentation at 2019 Mooly Fest:
- US letter, 1 slide per landscape page, 262 Kb,
- A4, 4 slides per landscape page, 638 Kb,
Abstract:
Dependency is a prevalent notion in computer science. There have been numerous informal or formal attempts to define viable syntactic and semantic concepts of dependency in programming languages with subtle variations and limitations.
We develop a new value dependency analysis defined by abstract interpretation of a trace semantics. A sound approximate dependency algorithm is formally derived by calculational design. Further abstractions provide information flow, slicing, non-interference, dye, and taint analyses.
Keywords:
Formal methods, Semantics, Program property, Dependency, Non-interference, Abstraction, Abstract interpretation.

Bibliographic reference:

@inproceedings{CousotETAPS2019MoolyFest,
  author    = {Patrick Cousot},
  title     = {Calculational design of a static dependency analysis},
  booktitle = {ETAPS 2019 Mooly Fest},
  year      = {2019},
  publisher = {{ETAPS, Prague, Czech Republic, Saturday April 6th, 2019}},
  url       = {https://conf.researchr.org/track/etaps-2019/etaps-2019-Mooly-Fest},
}

\bibitem{CousotETAPS2019MoolyFest}
Patrick Cousot.
\newblock Calculational design of a static dependency analysis.
\newblock In \emph{ETAPS 2019 Mooly Fest}, 
          ETAPS, Prague, Czech Republic, Saturday April 6th, 2019.
          (\url{https://conf.researchr.org/track/etaps-2019/etaps-2019-Mooly-Fest})

copyright notice
Last modified: Mon Apr 8 16:05:33 EDT 2019