Abstract Interpretation as a Programming Language

Research output: Contribution to journalJournal articleResearchpeer-review

Abstract

In David Schmidts PhD work he explored the use of denotational semantics as a programming language. It was part of an effort to not only treat formal semantics as specifications but also as interpreters and input to compiler generators. The semantics itself can be seen as a program and one may
examine different programming styles and ways to represent
states. Abstract interpretation is primarily a technique for derivation and specification of program analysis. As with denotational semantics we may also view abstract interpretations as programs and examine the implementation. The main focus in this paper is to show that results from higher-order strictness analysis may be used more generally as fixpoint operators for higher-order functions over lattices and thus provide a technique for immediate implementation of a large class of abstract interpretations. Furthermore, it may be seen as a programming paradigm and be used to write programs
in a circular style.
In David Schmidts PhD work he explored the use of denotational semantics as a programming language. It was part of an effort to not only treat formal semantics as specifications but also as interpreters and input to compiler generators. The semantics itself can be seen as a program and one may
examine different programming styles and ways to represent
states. Abstract interpretation is primarily a technique for derivation and specification of program analysis. As with denotational semantics we may also view abstract interpretations as programs and examine the implementation. The main focus in this paper is to show that results from higher-order strictness analysis may be used more generally as fixpoint operators for higher-order functions over lattices and thus provide a technique for immediate implementation of a large class of abstract interpretations. Furthermore, it may be seen as a programming paradigm and be used to write programs
in a circular style.
Translated title of the contributionAbstrakt fortolkning som et programmeringssprog :
LanguageEnglish
JournalElectronic Proceedings in Theoretical Computer Science
Volume129
Pages84-104
ISSN2075-2180
DOIs
StatePublished - 2013

Bibliographical note

Published in David A. Schmidt’s 60th Birthday Festschrift

Bibliographical note

Published in David A. Schmidt’s 60th Birthday Festschrift

Cite this

@article{5bcbc8d3080d4a9b90f7f6e07792374b,
title = "Abstract Interpretation as a Programming Language",
abstract = "In David Schmidts PhD work he explored the use of denotational semantics as a programming language. It was part of an effort to not only treat formal semantics as specifications but also as interpreters and input to compiler generators. The semantics itself can be seen as a program and one mayexamine different programming styles and ways to representstates. Abstract interpretation is primarily a technique for derivation and specification of program analysis. As with denotational semantics we may also view abstract interpretations as programs and examine the implementation. The main focus in this paper is to show that results from higher-order strictness analysis may be used more generally as fixpoint operators for higher-order functions over lattices and thus provide a technique for immediate implementation of a large class of abstract interpretations. Furthermore, it may be seen as a programming paradigm and be used to write programsin a circular style.",
author = "Mads Rosendahl",
note = "Published in David A. Schmidt’s 60th Birthday Festschrift",
year = "2013",
doi = "10.4204/EPTCS.129.7",
language = "English",
volume = "129",
pages = "84--104",
journal = "Electronic Proceedings in Theoretical Computer Science",
issn = "2075-2180",
publisher = "Open Publishing Association",

}

Abstract Interpretation as a Programming Language. / Rosendahl, Mads.

In: Electronic Proceedings in Theoretical Computer Science, Vol. 129, 2013, p. 84-104.

Research output: Contribution to journalJournal articleResearchpeer-review

TY - JOUR

T1 - Abstract Interpretation as a Programming Language

AU - Rosendahl,Mads

N1 - Published in David A. Schmidt’s 60th Birthday Festschrift

PY - 2013

Y1 - 2013

N2 - In David Schmidts PhD work he explored the use of denotational semantics as a programming language. It was part of an effort to not only treat formal semantics as specifications but also as interpreters and input to compiler generators. The semantics itself can be seen as a program and one mayexamine different programming styles and ways to representstates. Abstract interpretation is primarily a technique for derivation and specification of program analysis. As with denotational semantics we may also view abstract interpretations as programs and examine the implementation. The main focus in this paper is to show that results from higher-order strictness analysis may be used more generally as fixpoint operators for higher-order functions over lattices and thus provide a technique for immediate implementation of a large class of abstract interpretations. Furthermore, it may be seen as a programming paradigm and be used to write programsin a circular style.

AB - In David Schmidts PhD work he explored the use of denotational semantics as a programming language. It was part of an effort to not only treat formal semantics as specifications but also as interpreters and input to compiler generators. The semantics itself can be seen as a program and one mayexamine different programming styles and ways to representstates. Abstract interpretation is primarily a technique for derivation and specification of program analysis. As with denotational semantics we may also view abstract interpretations as programs and examine the implementation. The main focus in this paper is to show that results from higher-order strictness analysis may be used more generally as fixpoint operators for higher-order functions over lattices and thus provide a technique for immediate implementation of a large class of abstract interpretations. Furthermore, it may be seen as a programming paradigm and be used to write programsin a circular style.

U2 - 10.4204/EPTCS.129.7

DO - 10.4204/EPTCS.129.7

M3 - Journal article

VL - 129

SP - 84

EP - 104

JO - Electronic Proceedings in Theoretical Computer Science

T2 - Electronic Proceedings in Theoretical Computer Science

JF - Electronic Proceedings in Theoretical Computer Science

SN - 2075-2180

ER -