We examine the problem of automatically extracting a static semantics from a language^a€™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.
%0 Book Section
%1 hannan_02_extracting
%A Hannan, John
%D 2002
%J The Essence of Computation
%K _to_download_springer static_semantics 2002 _marcia
%P 157--171
%R 10.1007/3-540-36377-7_8
%T On Extracting Static Semantics
%U http://dx.doi.org/10.1007/3-540-36377-7_8
%X We examine the problem of automatically extracting a static semantics from a language^a€™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.
@incollection{hannan_02_extracting,
abstract = {We examine the problem of automatically extracting a static semantics from a language^{a}€™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.},
added-at = {2009-02-11T22:26:26.000+0100},
author = {Hannan, John},
biburl = {https://www.bibsonomy.org/bibtex/2a99e679de7692a291b8a6f4f8d7c488c/leonardo},
citeulike-article-id = {2498138},
doi = {10.1007/3-540-36377-7_8},
interhash = {6d0a511bc20624d74bb7faaa3a55e02f},
intrahash = {a99e679de7692a291b8a6f4f8d7c488c},
journal = {The Essence of Computation},
keywords = {_to_download_springer static_semantics 2002 _marcia},
pages = {157--171},
posted-at = {2008-03-10 01:32:12},
priority = {4},
timestamp = {2009-02-11T22:26:26.000+0100},
title = {On Extracting Static Semantics},
url = {http://dx.doi.org/10.1007/3-540-36377-7_8},
year = 2002
}