On extracting static semantics

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

We examine the problem of automatically extracting a static semantics from a language's semantic definition. Traditional approaches require manual construction of static and dynamic semantics, followed by a proof that the two are consistent. As languages become more complex, the static analyses also become more complex, and consistency proofs have typically been challenging. We need to find techniques for automatically constructing static analyses that are provably correct. We study the issues of developing such techniques and propose avenues of research in this area. We find that significant advances are required before realizing the practical extraction of static semantics from language definitions.

Original languageEnglish (US)
Title of host publicationThe Essence of Computation
Subtitle of host publicationComplexity, Analysis, Transformation
EditorsTorben Mogensen, David Schmidt, Hal Sudborough
Pages157-171
Number of pages15
Publication statusPublished - Dec 1 2002

Publication series

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

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Hannan, J. (2002). On extracting static semantics. In T. Mogensen, D. Schmidt, & H. Sudborough (Eds.), The Essence of Computation: Complexity, Analysis, Transformation (pp. 157-171). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2566 LNCS).