A Unified Formal Specification and Analysis of the New Java Memory Models

Awhad, Varsha; Wallace, Charles

doi:10.1007/3-540-36498-6_9

Cited by 4 publications

(5 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Also not surprisingly the correctness of the definite assignment analysis could be proved for C# [76] in a way similar to the proof developed for Java. In [171] the C# ground model has been extended by a component for multi-threaded C# and the .NET memory model, the latter one inspired by the ASM developed in [6] for Java's local consistency memory model, and has been used in [170] for a mathematical analysis (using Stärk's AsmTP system, an interactive proof assistant based on ASM logic) of various thread model properties.…”

Section: Reusing Java Ground Model For Ecma Standard C#mentioning

confidence: 99%

See 1 more Smart Citation

The abstract state machines method for modular design and analysis of programming languages

Börger¹

2014

Journal of Logic and Computation

View full text Add to dashboard Cite

We survey the use of Abstract State Machines in the area of programming languages, namely to define behavioral properties of programs at source, intermediate and machine levels in a way that is amenable to mathematical and experimental analysis by practitioners, like correctness and completeness of compilers, etc. We illustrate how theorems about such properties can be integrated into a modular development of programming languages and programs, using as example a Java/JVM compilation correctness theorem about defining, interpreting, compiling, and executing Java/JVM code. We show how programming features (read: programming constructs) modularize not only the source programs, but also the program property statements and their proofs. 1 1 This text originates from an invited lecture for the Workshop on Scalable Language Specification at Microsoft Research Cambridge, June 25-27, 2013. 2 Listening to lectures I had invited Yuri Gurevich to deliver in the years 1986, 1987 and 1991 to the computer science PhD program in Pisa. See [57, Ch.9] or [26] for historical details and references. 3 ASM refinement differs from other refinement concepts in the literature by allowing one to refine in combination both the data structures (which make up the ASM state) and the computation steps (which are described by the ASM rules). More precisely, to relate abstract and refined runs for stating and proving the desired run properties, one can determine five features: a) the targeted refined data structure, b) appropriate pairs of corresponding abstract and refined states of interest one wants to relate, c) segments of abstract and refined computation steps leading from one pair of corresponding states of interest to the next one, d) sets of abstract and refined locations of interest one wants to compare, e) the equivalence properties or whatever comparison one wants to establish, see [28,29] for details. Horizontal resp. vertical ASM refinement includes Java's "extends" resp. "implements". 4 The early work on specification and analysis of logic programming systems using ASMs, carried out in the period 1988-1994, is surveyed in the Proceedings of the first international ASM workshop which was organized as part of the 13th World Computer Congress, see [23].

show abstract

Section: Reusing Java Ground Model For Ecma Standard C#mentioning

confidence: 99%

“…The examples specified the semantics of Turing and stack machines [101,Sect. 4,6] and of some tiny Pascal programs [100,Sect. 10,11].…”

Section: Introductionmentioning

confidence: 99%

The abstract state machines method for modular design and analysis of programming languages

Börger¹

2014

Journal of Logic and Computation

View full text Add to dashboard Cite

show abstract

“…Note that in .NET a read or write of a volatile location affects also the ordering of reads and writes of other locations. For the ASM specification of the .NET memory model we follow the ASM specification of the Local Consistency Memory Model for Java in [1] and use a universe of events that is divided into disjoint subuniverses as follows:…”

Section: The Net Memory Modelmentioning

confidence: 99%

“…It justifies at least most of the common compiler optimizations which were prohibited by the old one. For a comparison and analysis of the different proposals we refer to [1].…”

Section: Introductionmentioning

confidence: 99%

An ASM Specification of C# Threads and the .NET Memory Model

Stärk

Börger

2004

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We present a high-level ASM model of C# threads and the .NET memory model. We focus on purely managed, fully portable threading features of C#. The sequential model interleaves the computation steps of the currently running threads and is suitable for uniprocessors. The parallel model addresses problems of true concurrency on multiprocessor systems. The models provide a sound basis for the development of multi-threaded applications in C#. The thread and memory models complete the abstract operational semantics of C# in [2].

show abstract

“…Since the thread models of Java and C# have been analysed and compared extensivley in [11,1,10], we skip here to reformulate the interpreter ExecL T . The static semantics of most programming languages can be captured appropriately by mainly declarative descriptions of the relevant syntactical and compile-time checked language features, e.g.…”

Section: Introductionmentioning

confidence: 99%

Exploiting Abstraction for Specification Reuse. The Java/C# Case Study

Börger

Stärk

2004

Formal Methods for Components and Objects

View full text Add to dashboard Cite

From the models provided in [11] and [4] for the semantics of Java and C# programs we abstract the mathematical structure that underlies the semantics of both languages. The resulting model reveals the kernel of object-oriented programming language constructs and can be used for teaching them without being bound to a particular language. It also allows us to identify precisely some of the major differences between Java and C#.

show abstract

A Unified Formal Specification and Analysis of the New Java Memory Models

Cited by 4 publications

References 15 publications

The abstract state machines method for modular design and analysis of programming languages

The abstract state machines method for modular design and analysis of programming languages

An ASM Specification of C# Threads and the .NET Memory Model

Exploiting Abstraction for Specification Reuse. The Java/C# Case Study

Contact Info

Product

Resources

About