ACM Transactions on Programming Languages and Systems · 2013 · 31 citations · 37 references
ComputingComputer ScienceFormal MethodsProgramming LanguagesSafety EngineeringConcurrency ControlMemory ModelingMemory SafetyModel CheckingType CheckingVirtual MemoryData Race ConditionsData-race FreedomDynamic Memory AllocationMemory AllocationMemory Model SemanticsOperational SemanticsSynchronization SemanticsType Safety
This work presents a machine-checked formalisation of the Java memory model and connects it to an operational semantics for Java and Java bytecode. For the whole model, I prove the data race freedom guarantee and type safety. The model extends previous formalisations by dynamic memory allocation, thread spawns and joins, infinite executions, the wait-notify mechanism, and thread interruption, all of which interact in subtle ways with the memory model. The formalisation resulted in numerous clarifications of and fixes to the existing JMM specification.
37
Constructing Induction Rules for Deductive Synthesis Proofs
Alan Bundy, Lucas Dixon, Jeremy Gow et al. · Electronic Notes in Theoretical Computer Science · 2006 · 2.8K citations · Full text
A Syntactic Approach to Type Soundness
Andy Wright, Matthias Felleisen · Information and Computation · 1994 · 1.1K citations
Shared memory consistency models: a tutorial
Sarita V. Adve, Kourosh Gharachorloo · Computer · 1996 · 1.1K citations
Jeremy Manson, William Pugh, Sarita V. Adve · 2005 · 732 citations · Full text