Abstract Semantic Dependency

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish (US)
Title of host publicationStatic Analysis - 26th International Symposium, SAS 2019, Proceedings
EditorsBor-Yuh Evan Chang
PublisherSpringer Science and Business Media Deutschland GmbH
Pages389-410
Number of pages22
ISBN (Print)9783030323035
DOIs
StatePublished - 2019
Event26th International Static Analysis Symposium, SAS 2019 held as part of the 3rd World Congress on Formal Methods, FM 2019 - Porto, Portugal
Duration: Oct 8 2019Oct 11 2019

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11822 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference26th International Static Analysis Symposium, SAS 2019 held as part of the 3rd World Congress on Formal Methods, FM 2019
Country/TerritoryPortugal
CityPorto
Period10/8/1910/11/19

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Fingerprint

Dive into the research topics of 'Abstract Semantic Dependency'. Together they form a unique fingerprint.

Cite this