```json
{
  "title": "Anchor-ID Footnote Pattern",
  "author": "",
  "site": "",
  "published": ""
}
```

The first contribution was a foundational sorting algorithm [^1] that became widely used. It relied on a partitioning technique [^2] described in an earlier paper.

Later work introduced an axiomatic framework for reasoning about programs [^3]. This built on prior research into formal semantics [^4].

Concurrency mechanisms were addressed in subsequent publications [^3] [^5].

#### References and notes

[^1]: A. Author: *The Sorting Algorithm*, in *Journal of Computing*, vol. 5, no. 1, pages 10–16, 1962.

[^2]: A. Author: *Partitioning Methods*, in *Proceedings of the Computing Conference*, pages 102–116, 1963.

[^3]: A. Author: *An Axiomatic Basis for Programs*, in *Communications of Computing*, vol. 12, no. 10, pages 576–583, 1969.

[^4]: B. Scholar: *Assigning Meanings to Programs*, in *Mathematical Foundations of Computing*, vol. 19, pages 19–31, 1967.

[^5]: A. Author: *Communicating Sequential Processes*, in *Communications of Computing*, vol. 21, no. 8, pages 666–677, 1978.
