Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jay Richards

dblp:403/4338 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2025
0009-0001-1738-3576ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
1 paper
Concurrent programming · 87% Program analysis · 13%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Concurrent programming › memory models › weak memory models
c11 memory model
0.912025
Symbolic MRD: Dynamic Memory, Undefined Behaviour, and Extrinsic Choice · Proc. ACM Program. Lang. 2025
Concurrent programming
memory models
0.912025
Symbolic MRD: Dynamic Memory, Undefined Behaviour, and Extrinsic Choice · Proc. ACM Program. Lang. 2025
Program analysis › static analysis
pointer analysis
0.312025
Symbolic MRD: Dynamic Memory, Undefined Behaviour, and Extrinsic Choice · Proc. ACM Program. Lang. 2025

Methods — techniques the papers use, named apart from their topics

operational semantics · 0.9executable semantics · 0.9
YearPublicationVenuePosition
2025 Symbolic MRD: Dynamic Memory, Undefined Behaviour, and Extrinsic Choice
abstract
We present the first thin-air free memory model that admits compiler optimisations that aggressively leverage knowledge from alias analysis, an assumption of freedom from undefined behaviour, and from the extrinsic choices of real implementations such as over-alignment. Our model has tooling support with state-of-the-art performance, executing a battery of tests orders of magnitude quicker than other executable thin-air free semantics. The model integrates with the C/C++ memory model through an exportable semantic dependency relation, it allows standard compilation mappings for atomics, and it matches all tests in the recently published desiderata for C/C++ from the ISO.
Jay Richards, Daniel Wright 0001, Simon Cooksey, Mark Batty
Proc. ACM Program. Lang.1