A JMM-Faithful non-interference calculus for java

Authors:
Vladimir Klebanov
Affiliations:
Institute of Computer Science, University of Koblenz-Landau
Venue:
FIDJI'04 Proceedings of the 4th international conference on Scientific Engineering of Distributed Java Applications
Year:
2004

Citing 4
Cited 0

A generalization of Owicki-Gries's Hoare logic for a concurrent while language

Theoretical Computer Science - Thirteenth International Colloquim on Automata, Languages and Programming, Renne
Verifying properties of parallel programs: an axiomatic approach

Communications of the ACM
An Event-Based Structural Operational Semantics of Multi-Threaded Java

Formal Syntax and Semantics of Java
A Dynamic Logic for the Formal Verification of Java Card Programs

JavaCard '00 Revised Papers from the First International Workshop on Java on Smart Cards: Programming and Security

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a calculus for establishing non-interference of several Java threads running in parallel. The proof system is built atop an implemented sequential Java Dynamic Logic calculus with 100% Java Card coverage. We present two semantic and one syntactic type of non-interference conditions to make reasoning efficient. In contrast to previous works in this direction, our method takes into full account the weak guarantees of the Java Memory Model concerning visibility and ordering of memory updates between threads.