Joey W Coleman & Cliff B Jones (2007):
A structural proof of the soundness of rely/guarantee rules.
Journal of Logic and Computation 17(4),
pp. 807–841,
doi:10.1093/logcom/exm030.
Patrick Cousot & Radhia Cousot (1977):
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints.
In: Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages,
pp. 238–252,
doi:10.1145/512950.512973.
Edsger Wybe Dijkstra (1965):
Solution of a problem in concurrent programming control.
Communications of the ACM 8(9),
pp. 569,
doi:10.1007/978-3-642-48354-7_10.
Lisbeth Fajstrup, Éric Goubault, Emmanuel Haucourt, Samuel Mimram & Martin Raussen (2012):
Trace spaces: An efficient new technique for state-space reduction.
In: European Symposium on Programming.
Springer,
pp. 274–294,
doi:10.1007/978-3-642-28869-2_14.
Lisbeth Fajstrup, Éric Goubault, Emmanuel Haucourt, Samuel Mimram & Martin Raussen (2012):
Trace Spaces: An Efficient New Technique for State-Space Reduction.
In: Helmut Seidl: Programming Languages and Systems,
Lecture Notes in Computer Science 7211.
Springer Berlin Heidelberg,
pp. 274294,
doi:10.1007/978-3-642-28869-2_14.
ArXiv:1204.0414.
Lisbeth Fajstrup, Éric Goubault, Emmanuel Haucourt, Samuel Mimram & Martin Raussen (2016):
Directed Algebraic Topology and Concurrency.
Springer International Publishing,
doi:10.1007/978-3-319-15398-8.
Lisbeth Fajstrup, Martin Raußen & Éric Goubault (2006):
Algebraic topology and concurrency.
Theoretical Computer Science 357(1-3),
pp. 241–278,
doi:10.1016/j.tcs.2006.03.022.
Jean-Yves Girard (2001):
Locus solum: From the rules of logic to the logic of rules.
Mathematical structures in computer science 11(3),
pp. 301,
doi:10.1017/S096012950100336X.
Patrice Godefroid (1996):
Partial-Order Methods for the Verification of Concurrent Systems.
Lecture Notes in Computer Science 1.
Springer, Berlin, Heidelberg,
doi:10.1007/3-540-60761-7.
É. Goubault, T. Heindel & S. Mimram (2013):
A geometric view of partial order reduction.
Electronic Notes in Theoretical Computer Science 298,
pp. 179–195,
doi:10.1016/j.entcs.2013.09.013.
Éric Goubault (2003):
Some geometric perspectives in concurrency theory.
Homology, Homotopy and Applications 5(2),
pp. 95–136,
doi:10.4310/HHA.2003.v5.n2.a5.
Éric Goubault & Emmanuel Haucourt (2005):
A practical application of geometric semantics to static analysis of concurrent programs.
In: International Conference on Concurrency Theory.
Springer,
pp. 503–517,
doi:10.1007/11539452_38.
Emmanuel Haucourt (2018):
The geometry of conservative programs.
Mathematical Structures in Computer Science 28(10),
pp. 17231769,
doi:10.1017/S0960129517000226.
Samuel Mimram & Aly-Bora Ulusoy (2021):
Sparkling.
Available at https://smimram.github.io/sparkling/.
Peter W O'Hearn (2007):
Resources, concurrency, and local reasoning.
Theoretical computer science 375(1-3),
pp. 271–307,
doi:10.1007/978-3-540-28644-8_4.
Susan Owicki & David Gries (1976):
An axiomatic proof technique for parallel programs I.
Acta informatica 6(4),
pp. 319–340,
doi:10.1007/978-1-4612-6315-9_12.
eptcs@eptcs.org