Abstract interpretation of annotated commands

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

10 Scopus citations

Abstract

This paper formalizes a generic abstract interpreter for a while-language, including widening and narrowing. The collecting semantics and the abstract interpreter operate on annotated commands: the program is represented as a syntax tree with the semantic information directly embedded, without auxiliary labels. The aim of the paper is simplicity of the formalization, not efficiency or precision. This is motivated by the inclusion of the material in a theorem prover based course on semantics.

Original languageEnglish
Title of host publicationInteractive Theorem Proving - Third International Conference, ITP 2012, Proceedings
Pages116-132
Number of pages17
DOIs
StatePublished - 2012
Event3rd International Conference on Interactive Theorem Proving, ITP 2012 - Princeton, NJ, United States
Duration: 13 Aug 201215 Aug 2012

Publication series

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

Conference

Conference3rd International Conference on Interactive Theorem Proving, ITP 2012
Country/TerritoryUnited States
CityPrinceton, NJ
Period13/08/1215/08/12

Fingerprint

Dive into the research topics of 'Abstract interpretation of annotated commands'. Together they form a unique fingerprint.

Cite this