TY - GEN
T1 - Abstract Semantic Dependency
AU - Cousot, Patrick
N1 - Publisher Copyright:
© Springer Nature Switzerland AG 2019.
PY - 2019
Y1 - 2019
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85075832457&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85075832457&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-32304-2_19
DO - 10.1007/978-3-030-32304-2_19
M3 - Conference contribution
AN - SCOPUS:85075832457
SN - 9783030323035
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 389
EP - 410
BT - Static Analysis - 26th International Symposium, SAS 2019, Proceedings
A2 - Chang, Bor-Yuh Evan
PB - Springer Science and Business Media Deutschland GmbH
T2 - 26th International Static Analysis Symposium, SAS 2019 held as part of the 3rd World Congress on Formal Methods, FM 2019
Y2 - 8 October 2019 through 11 October 2019
ER -