(ref.doc)toplas17-1

ACM Transactions on Programming Languages and Systems
January 1995: Vol 17, Nr 1

Notes on "A Methodology for Implementing Highly Concurrent Data Objects"
by Joseph P. Sukudlarek
pp 45-46
 load_linked and store_conditional instructions
 lock_free and wait_free protocols

Closure Analysis in Constraint Form
by Jens Palsberg
pp 47-62
 The traditional framework for program analysis is usually abstract
 interpretation, and for typed languages, suitable abstract domains
 can usually be defined by induction on the structure of types.
 For untyped languages or dynamically typed languages, abstract
 domains cannot be defined by abstracting function spaces into
 function spaces. [I]t may be difficult to relate the abstract
 interpretation to the denotational semantics. In this article, we
 consider [...] an abtraction of the opertional semantics.

Safe: A Semantic Technique for Transforming Programs in the Presence
of Errors
by Alexander Aiken, John H. Williams and Edward L. Wimmers
pp 63-84
 A [...] trend [has been the] use of denotational semantics [in] the
 design [...] of programming languages [...] An apparent exception to
 this trend is the treatment of error handling. All to often, errors
 are considered to be outside the scope of the denotational semantics
 [.]