A. Amighi, S. Blom, M. Huisman & M. Zaharieva-Stojanovski (2012):
The VerCors Project: Setting Up Basecamp.
In: Programming Languages meets Program Verification (PLPV 2012).
ACM Press,
pp. 71–82,
doi:10.1145/2103776.2103785.
J. Dovland, E. Broch Johnsen & O. Owe (2008):
Observable Behavior of Dynamic Systems: Component Reasoning for Concurrent Objects.
ENTCS 203,
pp. 19–34,
doi:10.1016/j.entcs.2008.04.084.
A. Gotsman & H. Yang (2011):
The Importance of Being Linearizable.
(Submitted).
C. Haack, M. Huisman & C. Hurlin (2011):
Permission-Based Separation Logic for Multithreaded Java Programs.
Nieuwsbrief van de Nederlandse Vereniging voor Theoretische Informatica 15,
pp. 13–23.
G.T. Leavens, E. Poll, C. Clifton, Y. Cheon, C. Ruby, D. R. Cok, P. Müller, J. Kiniry & P. Chalin (2007):
JML Reference Manual.
Dept. of Computer Science, Iowa State University. Available from http://www.jmlspecs.org.
P. W. O'Hearn, J. Reynolds & H. Yang (2001):
Local Reasoning about Programs that Alter Data Structures.
In: L. Fribourg: Computer Science Logic,
LNCS 2142.
Springer-Verlag,
pp. 1–19,
doi:10.1007/3-540-44802-0_1.
S. Owicki & D. Gries (1975):
An Axiomatic Proof Technique for Parallel Programs.
Acta Informatica Journal 6,
pp. 319–340,
doi:10.1007/BF00268134.
J.C. Reynolds (2002):
Separation Logic: A Logic for Shared Mutable Data Structures.
In: Logic in Computer Science.
IEEE Computer Society,
pp. 55–74,
doi:10.1109/LICS.2002.1029817.
G. Schellhorn, B. Tofan, G. Ernst & W. Reif (2011):
Interleaved Programs and Rely-Guarantee Reasoning with ITL.
In: Proc. of International Symposium on Temporal Representation and Reasoning in AI (TIME).
IEEE Press,
doi:10.1109/TIME.2011.12.
To appear.
N. Soundararajan (1983):
Correctness Proofs of CSP Programs.
Theoretical Computer Science 24,
pp. 131–141,
doi:10.1016/0304-3975(83)90045-2.
Viktor Vafeiadis (2010):
Automatically Proving Linearizability.
In: CAV,
pp. 450–464,
doi:10.1007/978-3-642-14295-6_40.
eptcs@eptcs.org