2007
DOI: 10.1017/s0956796807006363
|View full text |Cite
|
Sign up to set email alerts
|

What is the meaning of these constant interruptions?

Abstract: Asynchronous exceptions, orinterrupts, are important for writing robust, modular programs, but are traditionally viewed as being difficult from a semantic perspective. In this article, we present a simple, formally justified, semantics for interrupts. Our approach is to show how a high-level semantics for interrupts can be justified with respect to a low-level implementation, by means of a compiler and its correctness theorem. In this manner we obtain two different perspectives on the problem, formally shown t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
12
0

Year Published

2008
2008
2017
2017

Publication Types

Select...
4
3
1

Relationship

2
6

Authors

Journals

citations
Cited by 13 publications
(12 citation statements)
references
References 39 publications
0
12
0
Order By: Relevance
“…For brevity, we stay away from lambda-languages and binding issues, that with few exceptions [13,23,24] have been our favorite domain of discourse so far. Instead, we consider arithmetic expressions with effects (namely interruptions) and stuck terms (namely errors), as in Graham Hutton and Joel Wright's recent work [37]. In doing so, we aim at the same sort of telling, minimalistic elegance as can be found in Hutton's publications.…”
Section: Introductionmentioning
confidence: 99%
“…For brevity, we stay away from lambda-languages and binding issues, that with few exceptions [13,23,24] have been our favorite domain of discourse so far. Instead, we consider arithmetic expressions with effects (namely interruptions) and stuck terms (namely errors), as in Graham Hutton and Joel Wright's recent work [37]. In doing so, we aim at the same sort of telling, minimalistic elegance as can be found in Hutton's publications.…”
Section: Introductionmentioning
confidence: 99%
“…We are not aware of previous operational semantics for signals, although Feng, Shao, Guo and Dong [6] presents a program logic for assembly language with interrupts, which are analogous to signals at the hardware level. Hutton and Wright [7] study interruptions as asynchronous exceptions. By contrast, signals are a software alternative to hardware interrupts, where signal handlers could be addressed as asynchronous subroutine calls.…”
Section: Discussionmentioning
confidence: 99%
“…Here and throughout this article, we use 'co' on the left of rules to indicate that the relation is coinductively defined by that set of rules. 5 We assume that the reader is familiar with the basics of coinduction (for introductions see, e.g., [3; 13; 14]).…”
Section: Infinite Computationsmentioning
confidence: 99%
“…Leroy and Grall [3] cite compiler correctness proofs as a main motivation for using coinductive big-step semantics as opposed to small-step semantics: using small-step semantics complicates the correctness proof. Indeed, Hutton and Wright [5] and Hutton and Bahr [40] also use big-step semantics for their compiler correctness proofs. However, in CompCert, Leroy [41] uses a small-step semantics and sophisticated notions of bisimulation for its compiler correctness proofs.…”
Section: Related Workmentioning
confidence: 99%