Please use this identifier to cite or link to this item:
|Title:||A memory model sensitive checker for C#|
|Citation:||Huynh, T.Q.,Roychoudhury, A. (2006). A memory model sensitive checker for C#. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 4085 LNCS : 476-491. ScholarBank@NUS Repository.|
|Abstract:||Modern concurrent programming languages like Java and C# have a programming language level memory model; it captures the set of all allowed behaviors of programs on any implementation platform - uni- or multi-processor. Such a memory model is typically weaker than Sequential Consistency and allows reordering of operations within a program thread. Therefore, programs verified correct by assuming Sequential Consistency (that is, each thread proceeds in program order) may not behave correctly on certain platforms! The solution to this problem is to develop program checkers which are memory model sensitive. In this paper, we develop such an invariant checker for the programming language C#. Our checker identifies program states which are reached only because the C# memory model is more relaxed than Sequential Consistency. Furthermore, our checker identifies (a) operation reorderings which cause such undesirable states to be reached, and (b) simple program modifications - by inserting memory barrier operations -which prevent such undesirable reorderings. © Springer-Verlag Berlin Heidelberg 2006.|
|Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Oct 27, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.