• Published 2014

Modular Reasoning for Message-passing Programs ( Technical Report ) ∗

@inproceedings{Lei2014ModularRF,
  title={Modular Reasoning for Message-passing Programs ( Technical Report ) ∗},
  author={Jinjiang Lei and Zongyan Qiu},
  year={2014}
}
Verification of concurrent systems is difficult because of the inherent nondeterminism. Modern verification requires better locality and modularity. Reasoning of shared memory systems has gained much progress in these aspects. However, modular verification of distributed systems is still in demand. In this paper, we propose a new reasoning system for message-passing programs. It is a novel logic that supports Hoare style triples to specify and verify distributed programs modularly. We… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-10 OF 18 REFERENCES

Time, clocks, and the ordering of events in a distributed system

VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

Communicating sequential processes

VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

and P

  • I. Wehrman, C.A.R. Hoare
  • W. O’Hearn. Graphical models of separation logic. Inf. Process. Lett., 109(17):1001–1004,
  • 2009

A semantics for concurrent separation logic

VIEW 3 EXCERPTS

Variables as Resource in Hoare Logics

VIEW 1 EXCERPT

and R

  • M. Bickfor
  • L. Constable. A causal logic of events in formalized computational type theory,
  • 2005
VIEW 2 EXCERPTS

Separation logic: a logic for shared mutable data structures

  • John C. Reynolds
  • Computer Science
  • Proceedings 17th Annual IEEE Symposium on Logic in Computer Science
  • 2002
VIEW 2 EXCERPTS