Abstract Semantic Dependency
In Proceedings of the 26th International Symposium on Static Analysis, Bor-Yuh Evan Chang (Ed), Porto, Portugal, October 9-11, 2019. LNCS 11822, pp. 38-—410, © Springer, 2019.
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.
Absence of interference, Abstract Domain, Abstract interpretation, Abstraction, Binding time analysis, Collecting semantics, Dependency, Dye instrumented semantics, Explicit dependency, Implicit dependency, Independence, Instrumented semantics, Reachability, Reduced product, Semantics, Soundness, Static analysis, Static checking, Static verification, Timely dependency, Timing channel, Trace Semantics, Tracking analysis, Value dependency.
@inproceedings{DBLP:conf/sas/Cousot19a,
author = {Patrick Cousot},
title = {Abstract Semantic Dependency},
booktitle = {{SAS}},
series = {Lecture Notes in Computer Science},
volume = {11822},
pages = {389--410},
publisher = {Springer},
year = {2019}
}